Issue No. 05 - May (2008 vol. 7)
We propose several localized sensor area coverage protocols for heterogeneous sensors, each with arbitrary sensing and transmission radii. Sensors are assumed to be time synchronized, and active sensors are determined at the beginning of each round. The approach has a very small communication overhead since prior knowledge about neighbor existence is not required. Each node selects a random timeout and listens to messages sent by other nodes before the timeout expires. Sensor nodes whose sensing area is not fully covered (or fully covered but with a disconnected set of active sensors) when the deadline expires decide to remain active for the considered round, and transmit an activity message announcing it. There are four variants in our approach, depending on whether or not withdrawal and retreat messages are transmitted. Covered nodes decide to sleep, with or without transmitting withdrawal message to inform neighbors about the status. After hearing from more neighbors, active sensors may observe that they became covered, and may decide to alter their original decision and transmit a retreat message. Our simulation shows reduced message overhead while preserving coverage quality compared to existing method based on hello messages followed by retreat ones.
Distributed networks, Wireless communication, Algorithm/protocol design and analysis
David Simplot-Ryl, Ivan Stojmenović, Jean Carle, Antoine Gallais, "Localized Sensor Area Coverage with Low Communication Overhead", IEEE Transactions on Mobile Computing, vol. 7, no. , pp. 661-672, May 2008, doi:10.1109/TMC.2007.70793