p-Percent Coverage in Wireless Sensor Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Recyclable Connected Dominating Set for Large Scale Dynamic Wireless Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Proceedings of the 7th ACM international symposium on Mobility management and wireless access
On quantifying the quality of CDS-based virtual backbones in mobile ad hoc networks
Proceedings of the 8th ACM international workshop on Mobility management and wireless access
WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
On the construction of k-connected m-dominating sets in wireless networks
Journal of Combinatorial Optimization
Journal of Network and Computer Applications
Load-balanced CDS construction in wireless sensor networks via genetic algorithm
International Journal of Sensor Networks
Efficient self-organized backbone formation in mobile ad hoc networks (MANETs)
Computers and Electrical Engineering
On dominating sets whose induced subgraphs have a bounded diameter
Discrete Applied Mathematics
Approximation algorithms for load-balanced virtual backbone construction in wireless sensor networks
Theoretical Computer Science
Efficient topology control scheme for wireless ad-hoc networks
International Journal of Computational Intelligence Studies
On construction of quality fault-tolerant virtual backbone in wireless networks
IEEE/ACM Transactions on Networking (TON)
Approximating 2-cliques in unit disk graphs
Discrete Applied Mathematics
Dominating problems in swapped networks
Information Sciences: an International Journal
Ad hoc node connectivity improvement analysis - Why not through mesh clients?
Computers and Electrical Engineering
| Hi-index | 0.00 |
Connected Dominating Sets (CDSs) can serve as virtual backbones for wireless networks. A smaller virtual backbone incurs less maintenance overhead. Unfortunately, computing a minimum size CDS is NP-hard, and thus most researchers in this area concentrate on how to construct smaller CDSs. However, people neglected other important metrics of network, such as diameter and average hop distances between two communication parties. In this paper, we investigate the problem of constructing quality CDS in terms of size, diameter, and Average Backbone Path Length (ABPL). We present two centralized algorithms having constant performance ratios for its size and diameter of the constructed CDS. Especially, the size of CDS computed by the second algorithm is no more than 6.906 times of its optimal solution. Furthermore, we give its distributed version, which not only can be implemented in real situation easily but also considers energy to extend network lifetime. In our simulation, we show that in average the distributed algorithm not only generates a CDS with smaller diameter and ABPL than related work but also suppresses its size well. We also show that it is more energy efficient than others in prolonging network lifetime.