A distributed algorithm for computing Connected Dominating Set in ad hoc networks
by Chuanhe Huang, Chuan Qin, Yi Xian
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 1, No. 2, 2006

Abstract: CDS (Connected Dominating Set) can be used as a backbone for efficient communications in ad hoc and wireless sensor networks. It is an NP-hard problem to find a Minimum Connected Dominating Set (MCDS) for a given graph. This paper proposes a distributed approximation algorithm to compute MCDS. The algorithm consists of three phases, and there is no strict boundary between any two consecutive phases. The algorithm has a constant approximation factor of 12, and message complexity O(max (n, opt × log opt)). The simulation result proves the effectiveness and reveals that this algorithm can perform even better as the density of network increases.

Online publication date: Fri, 16-Feb-2007

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com