Approximation Algorithms for Connected Dominating Sets
ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
PEAS: A Robust Energy Conserving Protocol for Long-lived Sensor Networks
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
Integrated coverage and connectivity configuration in wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Low-coordination topologies for redundancy in sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
International Journal of Communication Systems
Distributed Self-Minimum Connected Covering of a Query Region in Sensor Networks
ISPAN '05 Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks
Connected sensor cover: self-organization of sensor networks for efficient query execution
IEEE/ACM Transactions on Networking (TON)
Energy efficient distributed connected dominating sets construction in wireless sensor networks
Proceedings of the 2006 international conference on Wireless communications and mobile computing
A simple improved distributed algorithm for minimum CDS in unit disk graphs
ACM Transactions on Sensor Networks (TOSN)
Discrete Event Dynamic Systems
Improved approximation algorithms for connected sensor cover
Wireless Networks
Connected Dominating Sets in Wireless Networks with Different Transmission Ranges
IEEE Transactions on Mobile Computing
On approximation algorithms of k-connected m-dominating sets in disk graphs
Theoretical Computer Science
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Optimizing coverage in a K-covered and connected sensor network using genetic algorithms
EC'08 Proceedings of the 9th WSEAS International Conference on Evolutionary Computing
Distributed Connected Dominating Set Construction in Geometric k-Disk Graphs
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Connected sensor cover for area information coverage in wireless sensor networks
International Journal of Communication Systems
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Energy-efficient coverage problems in wireless ad-hoc sensor networks
Computer Communications
Distributed virtual backbone construction in sensor networks with asymmetric links
Wireless Communications & Mobile Computing
A distributed greedy algorithm for connected sensor cover in dense sensor networks
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Journal of Network and Computer Applications
Journal of Network and Computer Applications
An energy-efficient topology construction algorithm for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
This paper considers the problem of topology construction to save energy in wireless sensor networks. The proposed topology construction mechanisms build reduced topologies using the Connected Dominating Set approach in a distributed, efficient, and simple manner. This problem is very challenging because the solution must provide a connected network with complete coverage of the area of interest using the minimum number of nodes possible. Further, the algorithms need to be computationally inexpensive and the protocols simple enough in terms of their message and computation complexity, so they do not consume more energy creating the reduced topology than the energy that they are supposed to save. In addition, it is desirable to reduce or completely eliminate the need of localization mechanisms since they introduce additional costs and energy consumption. To this end, we present the family of A3 distributed topology construction algorithms, four simple algorithms that build reduced topologies with very low computational and message complexity without the need of localization information: A3, A3Cov, A3Lite and A3CovLite. The algorithms are compared in sparse and dense networks versus optimal theoretical bounds for connected-coverage topologies and two distributed heuristics found in the literature using the number of active nodes and the ratio of coverage as the main performance metrics. The results demonstrate that there is no clear winner, and rather, trade offs exist. If coverage is not as critical as energy (network lifetime), it would be better to use A3Lite, as it needs fewer number of nodes and messages. If coverage is very important for the application, then the A3CovLite is the best option mostly because of the lower message complexity.