Energy aware self-organizing density management in wireless sensor networks
MobiShare '06 Proceedings of the 1st international workshop on Decentralized resource sharing in mobile computing and networking
A Delaunay Triangulation based method for wireless sensor network deployment
Computer Communications
Localization and coverage for high density sensor networks
Computer Communications
On connected area coverage sets in wireless sensor networks
Mobility '07 Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology
Hilbert mobile beacon for localisation and coverage in sensor networks
International Journal of Systems Science - Networked Control Systems and Wireless Sensor Networks - Theories and Applications
Minimum Power Minimum D-Hop Dominating Sets in Wireless Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
An energy efficient connected coverage protocol in wireless sensor networks
APWeb/WAIM'07 Proceedings of the joint 9th Asia-Pacific web and 8th international conference on web-age information management conference on Advances in data and web management
Performance evaluation and enhancement of surface coverage relay protocol
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Limited mobility coverage and connectivity maintenance protocols for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
SPACC: a simple positioning and coverage control solution for wireless sensor networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Minimum connected cover of a query region in heterogeneous wireless sensor networks
Information Sciences: an International Journal
| Hi-index | 0.00 |
Sensor networks consist of autonomous nodes with limited battery and of base stations with theoritical infinite energy. Nodes can be sleep to extend the lifespan of the network without compromising neither area coverage nor network connectivity. This paper addresses the area coverage problem with equal sensing and communicating radii. The goal is to minimize the number of active sensors involved in coverage task, while computing a connected set able to report to monitoring stations. Our solution is fully localized, and each sensor is able to make decision on whether to sleep or to be active based on two messages sent by each sensor. The first message is a "hello" message to gather position of all neighboring nodes. Then each node computes its own relay area dominating set, by taking the futhest neighbor as the first node, and then adding neighbors farthest to the isobarycenter of already selected neighbors, until the area covered by neighbors is fully covered. The second message broadcasts this relay set to neighbors. Each node decides to be active if it has highest priority among its neighbors or is a relay node for its neighbor with the highest priority.