The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Regional gossip routing for wireless ad hoc networks
Mobile Networks and Applications
Integrated coverage and connectivity configuration for energy conservation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
IEEE/ACM Transactions on Networking (TON)
Gossiping in distributed systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Distributed energy-efficient scheduling approach for k-coverage in wireless sensor networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
An application-specific protocol architecture for wireless microsensor networks
IEEE Transactions on Wireless Communications
Coverage-Preserving Routing Protocols for Randomly Distributed Wireless Sensor Networks
IEEE Transactions on Wireless Communications
Gossiping for autonomic estimation of network-based parameters in dynamic environments
OTM'10 Proceedings of the 2010 international conference on On the move to meaningful internet systems
Coverage problems in sensor networks: A survey
ACM Computing Surveys (CSUR)
Journal of Network and Computer Applications
Hi-index | 0.00 |
Wireless sensor networks (WSNs) have been widely studied and usefully employed in many applications such as monitoring environments and embedded systems. WSNs consist of many nodes spread randomly over a wide area; therefore, the sensing regions of different nodes may overlap partially. This is called the ''sensing coverage problem''. In this paper, we define a maximum sensing coverage region (MSCR) problem and present a novel gossip-based sensing-coverage-aware algorithm to solve the problem. In the algorithm, sensor nodes gossip with their neighbors about their sensing coverage region. In this way, nodes decide locally to forward packets (as an active node) or to disregard packets (as a sleeping or redundant node). Being sensing-coverage-aware, the redundant node can cut back on its activities whenever its sensing region is k-covered by enough neighbors. With the distributed and low-overhead traffic benefits of gossip, we spread energy consumption to different sensor nodes, achieve maximum sensing coverage with minimal energy consumption in each individual sensor node, and prolong the whole network lifetime. We apply our algorithm to improve LEACH, a clustering routing protocol for WSNs, and develop a simulation to evaluate the performance of the algorithm.