Minimum connected dominating sets and maximal independent sets in unit disk graphs

In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many constructions for approximating the minimum connected dominating set are based on the construction of a maximal independent set. The relation between the size mis(G) of a maximum independent set and the size cds(G) of a minimum connected dominating set in the same graph G plays an important role in establishing the performance ratio of those approximation algorithms. Previously, it is known that mis(G) ≤ 4ċcds(G) + 1 for all unit disk graphs G. In this paper, we improve it by showing mis(G) ≤ 3.8ċcds(G) + 1.2.

[1]  Peng-Jun Wan,et al.  Weakly-connected dominating sets and sparse spanners in wireless ad hoc networks , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[2]  Loren Schwiebert,et al.  Power efficient topologies for wireless sensor networks , 2001, International Conference on Parallel Processing, 2001..

[3]  Vaduvur Bharghavan,et al.  Routing in ad-hoc networks using minimum connected dominating sets , 1997, Proceedings of ICC'97 - International Conference on Communications.

[4]  Deying Li,et al.  A polynomial‐time approximation scheme for the minimum‐connected dominating set in ad hoc wireless networks , 2003, Networks.

[5]  Mahtab Seddigh,et al.  Internal nodes based broadcasting in wireless networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[6]  Peng-Jun Wan,et al.  Distributed Construction of Connected Dominating Set in Wireless Ad Hoc Networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[8]  Hans Eriksson,et al.  MBONE: the multicast backbone , 1994, CACM.

[9]  Weili Wu,et al.  Improving Construction for Connected Dominating Set with Steiner Tree in Wireless Sensor Networks , 2006, J. Glob. Optim..

[10]  Arthur L. Liestman,et al.  Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks , 2002, MobiHoc '02.

[11]  Vaduvur Bharghavan,et al.  Routing in ad hoc networks using a spine , 1997, Proceedings of Sixth International Conference on Computer Communications and Networks.

[12]  Peng-Jun Wan,et al.  Message-optimal connected dominating sets in mobile ad hoc networks , 2002, MobiHoc '02.

[13]  Weili Wu,et al.  A greedy approximation for minimum connected dominating sets , 2004, Theor. Comput. Sci..