Construction of directional virtual backbones with minimum routing cost in wireless networks

It is well-known that the application of directional antennas can help conserve bandwidth and energy consumption in wireless networks. Thus, to achieve efficiency in wireless networks, we study a special virtual backbone (VB) using directional antennas, requiring that from one node to any other node in the network, there exists at least one directional shortest path all of whose intermediate directions should belong to the VB, named as Minimum rOuting Cost Directional VB (MOC-DVB). In addition, VB has been well studied in Unit Disk Graph (UDG). However, radio wave based communications in wireless networks may be interrupted by obstacles (e.g., buildings and mountains). Thus, in this paper, we model a network as a general directed graph. We prove that construction of a minimum MOC-DVB is an NP-hard problem in a general directed graph and in term of the size of MOC-DVB, there exists an unreachable lower bound of the polynomial-time selected MOC-DVB. Therefore, we propose a distributed approximation algorithm for constructing MOC-DVB with approximation ratio of 1 + lnK + 2lnδD, where K is the number of antennas on each node and δD is the maximum direction degree in the network. Extensive simulations demonstrate that our constructed MOC-DVB is much more efficient in the sense of MOC-DVB size and routing cost compared to other VBs.

[1]  S. Guha,et al.  Approximation Algorithms for Connected Dominating Sets , 1998, Algorithmica.

[2]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[3]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, Theor. Comput. Sci..

[4]  Jie Wu,et al.  Efficient Backbone Construction Methods in MANETs Using Directional Antennas , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[5]  Michael Segal,et al.  A simple improved distributed algorithm for minimum CDS in unit disk graphs , 2005, WiMob'2005), IEEE International Conference on Wireless And Mobile Computing, Networking And Communications, 2005..

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

[7]  Weili Wu,et al.  Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

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

[9]  Donghyun Kim,et al.  Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

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

[11]  Xiaohua Jia,et al.  Energy efficient distributed connected dominating sets construction in wireless sensor networks , 2006, IWCMC '06.

[12]  David Lichtenstein,et al.  Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[13]  Dirk Timmermann,et al.  Distributed obstacle localization in large wireless sensor networks , 2006, IWCMC '06.

[14]  Minglu Li,et al.  On Reducing Broadcast Transmission Cost and Redundancy in Ad Hoc Wireless Networks Using Directional Antennas , 2010, IEEE Transactions on Vehicular Technology.

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

[16]  Panos M. Pardalos,et al.  On the Construction of Virtual Backbone for Ad Hoc Wireless Network , 2003 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  Ram Ramanathan,et al.  On the performance of ad hoc networks with beamforming antennas , 2001, MobiHoc '01.

[19]  Stefano Chessa,et al.  Bounds on hop distance in greedy routing approach in wireless ad hoc networks , 2006, Int. J. Wirel. Mob. Comput..

[20]  Ivan Stojmenovic,et al.  On calculating power-aware connected dominating sets for efficient routing in ad hoc wireless networks , 2002, J. Commun. Networks.

[21]  L. Gewali,et al.  Generating quality dominating sets for sensor network , 2005, Sixth International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'05).