Coverage Protocols for Wireless Sensor Networks: Review and Future Directions

The coverage problem in wireless sensor networks (WSNs) can be generally defined as a measure of how effectively a network field is monitored by its sensor nodes. This problem has attracted a lot of interest over the years and as a result, many coverage protocols were proposed. In this survey, we first propose a taxonomy for classifying coverage protocols in WSNs. Then, we classify the coverage protocols into three categories (i.e. coverage aware deployment protocols, sleep scheduling protocols for flat networks, and cluster-based sleep scheduling protocols) based on the network stage where the coverage is optimized. For each category, relevant protocols are thoroughly reviewed and classified based on the adopted coverage techniques. Finally, we discuss open issues (and recommend future directions to resolve them) associated with the design of realistic coverage protocols. Issues such as realistic sensing models, realistic energy consumption models, realistic connectivity models and sensor localization are covered

Power and Bandwidth allocation for High-Throughput Satellites using Particle Swarm Optimization

Resource allocation has always been a key issue in expensive multibeam satellite systems. In theory, dynamic allocation always gives better results than static allocation. In this work, the student will analyze different algorithms and their performance in the dynamic resource allocation of power and bandwidth in a multibeam satellite system. Within this context, the student will implement and compare state of the art optimization algorithms in order to obtain the best possible solution of the distribution problem.Outgoin