A constant-factor approximation for d-hop connected dominating sets in unit disk graph
by Xiaofeng Gao; Weili Wu; Xuefei Zhang; Xianyue Li
International Journal of Sensor Networks (IJSNET), Vol. 12, No. 3, 2012

Abstract: This paper presents a new distributed constant-factor approximation to compute d-CDS in Unit Disk Graph with low time complexity. We firstly propose an algorithm for a special case of d=2, namely Two-Hop Connected Dominating Set (TCDS or 2-CDS) with three phases: collecting information for each node; computing a Two-hop Maximal Independent Set (2-MIS); and connecting the selected set. The whole algorithm has approximation ratio 17.421opt + 51.456, where opt is the number of nodes in an optimal 2-CDS set. Next we generalise this algorithm for d-CDS with arbitrary integer d. The generalisation also has a constant-factor approximation ratio (0.335 r³ + 1.337 r² + 0.585 r)opt + (3.338 r³ + 0.5 r² - 0.585 r), where r = d + 0.5. We then compare our algorithm (d = 2) with two classical distributed routing protocols by numerical experiments, proving the efficiency of our design.

Online publication date: Fri, 23-Nov-2012

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 Sensor Networks (IJSNET):
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