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
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE 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
Spine routing in ad hoc networks
Cluster Computing
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Propagation and Leader Election in a Multihop Broadcast Environment
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
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
Routing in Ad Hoc Networks Using a Spine
IC3N '97 Proceedings of the 6th International Conference on Computer Communications and Networks
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
Maximal independent sets in radio networks
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
ICPPW '05 Proceedings of the 2005 International Conference on Parallel Processing Workshops
Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons
Journal of Computer and System Sciences
Medium access control in mobile ad hoc networks: challenges and solutions: Research Articles
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Virtual backbone construction in multihop ad hoc wireless networks: Research Articles
Wireless Communications & Mobile Computing - Special Issue on Ad Hoc Wireless Networks
Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks
Journal of Global Optimization
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Theoretical Computer Science
IEEE Transactions on Wireless Communications
A maximal independent set based giant component formation in random unit-disk graphs
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Hi-index | 0.00 |
In multi-hop wireless networks, the use of virtual backbone can greatly simplify routing, broadcasting, as well as energy/bandwidth saving. However, constructing a virtual backbone is costly and time-consuming because of the inevitable transmission interference during the process of the construction. In the literature, most of virtual backbone construction algorithms did not take the interference issue into consideration. To the best of our knowledge, our proposed algorithm is the first fully-distributed, interference-aware virtual backbone construction algorithm that has a proven bound on the construction latency. Besides, our proposed algorithm can be applied to the leader election problem, and such application results in a fully-distributed and interference-aware leader election algorithm of time complexity O(n log n) (where n is the number of nodes). This new leader election algorithm is practical in wireless networks because interference has already been dealt with; is also results in the fastest interference-aware leader election algorithm to the best of our knowledge.