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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
New Distributed Algorithm for Connected Dominating Set in Wireless Ad Hoc Networks
HICSS '02 Proceedings of the 35th Annual Hawaii International Conference on System Sciences (HICSS'02)-Volume 9 - Volume 9
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
On Constructing k-Connected k-Dominating Set in Wireless Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Localized Protocols for Ad Hoc Clustering and Backbone Formation: A Performance Comparison
IEEE Transactions on Parallel and Distributed Systems
Efficient Distributed Low-Cost Backbone Formation for Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
On approximation algorithms of k-connected m-dominating sets in disk graphs
Theoretical Computer Science
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
On the construction of 2-connected virtual backbone in wireless networks
IEEE Transactions on Wireless Communications
Algorithms for minimum m-connected k-dominating set problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
The capacity of wireless networks
IEEE Transactions on Information Theory
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
| Hi-index | 0.00 |
This paper introduces Blackbone2, a novel fully decentralized algorithm that aims at creating a robust backbone in ad hoc networks. Backbone robustness is supported by a 2-Connected m-dominating Set, 2,m-CDS, and decentralization relies on the usage of two rules that only require two-hop knowledge in order to reduce the use of bandwidth. Blackbone2 deterministic approach guarantees a density-indpendent valid solution and is proved correct. The algorithm is also characterized by its efficient theoretical computation time, Ο(Δ2) with Δ the average number of neighbors, which outperforms known solutions. The domination parameter, m, can be increased without changing the theoretical computation time. Efficiency of the Blackbone2 algorithm compared to the equivalent literature solutions is illustrated through simulations of a large panel of networks with a wide density range.