An efficient distributed algorithm for finding virtual backbones in wireless ad-hoc networks

Authors:
B. Paul;S. V. Rao;S. Nandi
Affiliations:
Department of Computer Science & Engineering, Indian Institute of Technology Guwahati, Guwahati, Assam, India;Department of Computer Science & Engineering, Indian Institute of Technology Guwahati, Guwahati, Assam, India;Department of Computer Science & Engineering, Indian Institute of Technology Guwahati, Guwahati, Assam, India
Venue:
HiPC'05 Proceedings of the 12th international conference on High Performance Computing
Year:
2005

Citing 10
Cited 2

Unit disk graphs

Discrete Mathematics - Topics on domination
Multicluster, mobile, multimedia radio network

Wireless Networks
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
Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
Message-optimal connected dominating sets in mobile ad hoc networks

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
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
Approximation Algorithms for Connected Dominating Sets

Algorithmica

An adaptive backbone formation algorithm for wireless sensor networks

Computer Communications
Mobility-Based Backbone Formation in Wireless Mobile Ad-hoc Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

A minimum connected dominating set is an efficient approach to form a virtual backbone for ad-hoc networks. We propose a tree based distributed time/message efficient approximation algorithm to compute a small connected dominating set without using geographic positions. The algorithm has O(n) time, O(n log n) message complexity, and has an approximation factor of eight. The algorithm is implemented using dominating set simulation program, which shows that our method gives smaller connected dominating set than the existing methods.