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
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Topology management for sensor networks: exploiting latency and density
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
A coverage-preserving node scheduling scheme for large wireless sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
The coverage problem in a wireless sensor network
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Performance of random routing on grid-based sensor networks
CCNC'09 Proceedings of the 6th IEEE Conference on Consumer Communications and Networking Conference
Developing energy-efficient topologies and routing for wireless sensor networks
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
| Hi-index | 0.00 |
The coverage problem is one of the most fundamental issues in a wireless sensor network, which directly affects the capability and efficiency of the sensor network. In this paper, we formulate this problem as a construction problem to find a topology that covers the required sensing area with high reliability. Deploying a good topology is also beneficial to management and energy saving. We propose an optimal coverage scheme for wireless sensor networks that can maintain sufficient sensing area as well as provide high reliability and long system lifetime, which is the main design challenge in sensor networks. With the same number of sensors, our scheme compares favorably with the existing schemes.