Maximal Independent Sets in Heterogeneous Wireless Ad Hoc Networks

In ad hoc wireless networks, a Connected Dominating Set (CDS) has been extensively used as a Virtual Backbone (VB) for routing. The majority of approximation algorithms for constructing a small CDS in wireless ad hoc networks follow a general two-phased approach. The first phase is to construct a Dominating Set (DS) and the second phase is to connect the nodes in it. Generally, in the first phase, a Maximum Independent Set (MIS) is used as the DS. The relation between the size of a Maximum Independent Set and a Minimum Connected Dominating Set (MCDS) plays the key role in the performance analyses of these two-phased algorithms. In homogeneous wireless ad hoc networks modeled as Unit Disk Graphs (UDG) and Unit Ball Graphs (UBG), the relation between them has been well studied. However, in heterogeneous wireless networks which generally modeled as Disk Graphs with Bidirectional links (DGB) and Ball Graphs with Bidirectional links (BGB), upper bounds for the size of MISs have seldom been studied. In this paper, we give tighter upper bounds for the size of MISs in heterogeneous wireless ad hoc networks. When the maximum and minimum transmission range are relatively close, our result is much better. In DGB, when the transmission range ratio is (1,1.152], (1.152,1.307], (1.307,1.407], (1.407,1.462], (1.462,1.515], (1.515,1.618], (1.618,1.932], we prove that the size of any Maximal Independent Set (MIS) is upper bounded by 6opt + 1, 7opt + 1, 8opt + 1, 9opt + 1, 10opt + 1, 11opt + 1, 16.7778opt + 1.2222, where opt denotes the size of an optimal solution of the CDS problem.

[1]  T. Hales.  The Kepler conjecture , 1998, math/9811078.

[2]  H. Melissen,et al.  Densest packings of eleven congruent circles in a circle , 1994 .

[3]  T. Tarnai,et al.  UPPER BOUND OF DENSITY FOR PACKING OF EQUAL CIRCLES IN SPECIAL DOMAINS IN THE PLANE , 2000 .

[4]  C. A. Rogers.  The Packing of Equal Spheres , 1958 .

[5]  Jiguo Yu,et al.  Minimum connected dominating set construction in wireless networks under the beeping model , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[6]  A. Ephremides,et al.  A design concept for reliable mobile radio networks with frequency hopping signaling , 1987, Proceedings of the IEEE.

[7]  Donghyun Kim,et al.  A Better Approximation Algorithm for Computing Connected Dominating Sets in Unit Ball Graphs , 2010, IEEE Transactions on Mobile Computing.

[8]  F. Fodor.  The Densest Packing of 19 Congruent Circles in a Circle , 1999 .

[9]  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.

[10]  Weili Wu,et al.  Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..

[11]  Ding-Zhu Du,et al.  Connected Dominating Sets in Wireless Networks with Different Transmission Ranges , 2007, IEEE Transactions on Mobile Computing.

[12]  Thomas C. Hales,et al.  Historical Overview of the Kepler Conjecture , 2006, Discret. Comput. Geom..

[13]  Károly Bezdek,et al.  Sphere packings revisited , 2006, Eur. J. Comb..

[14]  U. Pirl.  Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten , 1969 .

[15]  Helmut Groemer,et al.  Über die Einlagerung von Kreisen in einen konvexen Bereich , 1960 .

[16]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[17]  Dong Xuan,et al.  On wireless network coverage in bounded areas , 2013, 2013 Proceedings IEEE INFOCOM.

[18]  Sergiy Butenko,et al.  On connected domination in unit ball graphs , 2011, Optim. Lett..

[19]  Liang Yu,et al.  A Quasi Physical Method for the Equal Sphere Packing Problem , 2011, 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications.

[20]  Weijia Jia,et al.  Connected coverage in wireless networks with directional antennas , 2011, 2011 Proceedings IEEE INFOCOM.

[21]  Samir Khuller,et al.  Approximation Algorithms for Connected Dominating Sets , 1996, Algorithmica.