Proceedings of the 7th annual international conference on Mobile computing and networking
Message-optimal connected dominating sets in mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Connected sensor cover: self-organization of sensor networks for efficient query execution
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Area and perimeter derivatives of a union of disks
Computer Science in Perspective
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Preserving Area Coverage in Wireless Sensor Networks by Using Surface Coverage Relay Dominating Sets
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Position-based routing in ad hoc networks
IEEE Communications Magazine
Game theoretic power allocation in sparsely distributed clusters of wireless sensors (GPAS)
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Hi-index | 0.01 |
The connected coverage is one of the most important problems in Wireless Sensor Networks. However, most existing approaches to connected coverage require knowledge of accurate location information. This paper solves a challenging problem: without accurate location information, how to schedule sensor nodes to save energy and meet both constraints of sensing area coverage and network connectivity. Our solution is based on the theoretical analysis of the sensing area coverage property of minimal dominating set. We establish the relationship between point coverage and area coverage, and derive the upper and lower bound that point coverage is equivalent to area coverage in random geometric graphs. Based on the analytical results and the existing algorithms which construct the connected dominating set, an Energy Efficient Connected Coverage Protocol (EECCP) is proposed. Extensive simulation studies show that the proposed connected coverage protocol can effectively maintain both high quality sensing coverage and connectivity for a long time.