On calculating connected dominating set for efficient routing in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Exposure in wireless Ad-Hoc sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
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
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Differentiated surveillance for sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Coverage in wireless ad hoc sensor networks
IEEE Transactions on Computers
A Mobicast Routing Protocol in Vehicular Ad-Hoc Networks
Mobile Networks and Applications
Hi-index | 0.00 |
In wireless sensor networks, one of the main design challenges is to save severely constrained energy resources and obtain a long system lifetime. Low cost of sensors enables us to initially deploy a large number of sensor nodes in a very high density. A potential approach to solve a lifetime problem is to schedule sensor nodes work alternatively by configuring some of them a low-energy, off-duty status. In a single wireless sensor network, sensors assume two main functionalities: sensing and communication. Most of the previous work addressed only one kind of redundancy: sensing or communication alone. In this paper, we prove: "the communication range is twice the sensing range" is the sufficient condition and the tight lower bound to ensure that complete coverage preservation implies connectivity among active nodes, if the original network topology (consisting of all the deployed nodes) is connected. This conclusion enables configuring node status in a two-phase tightly integrated mode. The experimental results show that it leads to more off-duty nodes in double domains than other two strategies.