Model and Algorithms for the Density , Coverage and Connectivity Control Problem in Flat WSNs

In the last decade, several technological advances in embed ded systems and wireless communication allowed the arising of a new kind of ad-hoc network, the Wireless Sens or Network (WSN). A WSN is a special kind of mobile network composed by hundreds or even thousands of aut nomous and compact devices, called sensor nodes, which can perform sensing, processing and wireless c ommunication tasks. In a WSN application, the source nodes collect data from a phenomenon and disseminate them towards the sink node, using multi-hop communication.

[1]  Antonio Alfredo Ferreira Loureiro,et al.  Scheduling nodes in wireless sensor networks: a Voronoi approach , 2003, 28th Annual IEEE International Conference on Local Computer Networks, 2003. LCN '03. Proceedings..

[2]  Geraldo Robson Mateus,et al.  Evolutionary algorithm for the dynamic coverage problem applied to wireless sensor networks design , 2005, 2005 IEEE Congress on Evolutionary Computation.

[3]  Nael B. Abu-Ghazaleh,et al.  Infrastructure tradeoffs for sensor networks , 2002, WSNA '02.

[4]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[5]  Jennifer C. Hou,et al.  Maintaining Sensing Coverage and Connectivity in Large Sensor Networks , 2005, Ad Hoc Sens. Wirel. Networks.

[6]  Geraldo Robson Mateus,et al.  An Optimal Node Scheduling for Flat Wireless Sensor Networks , 2005, ICN.

[7]  M. Potkonjak,et al.  Low Power 0 / 1 Coverage and Scheduling Techniques in Sensor Networks , 2003 .

[8]  Songwu Lu,et al.  PEAS: a robust energy conserving protocol for long-lived sensor networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[9]  Geraldo Robson Mateus,et al.  A Hybrid Approach to solve the Coverage and Connectivity Problem in Wireless Sensor Networks , .