Simple approximation algorithms and PTASs for various problems in wireless ad hoc networks

A wireless ad hoc network is often composed of a set V of n wireless devices distributed in a two-dimensional domain. For each wireless device (also called node) [email protected]?V, there is a transmission region within which signal-to-noise-ratio (SNR) is at least a threshold @c so that the signal transmitted by u can be correctly received by other nodes with high probability. The transmission region is often modeled as a disk centered at the node u. In addition, for each node u, there is an interference region within which the transmission from u makes the signal-to-interference-and-noise-ratio (SINR) of the legitimate receiver smaller than the threshold @c so that the legitimate receiver cannot correctly receive the message from the legitimate transmitter. In this paper, we first present new graph models to model the communication graphs and the interference graphs defined by wireless ad hoc networks with attention to interference-free channel assignment or scheduling. Then we propose some simple approximation algorithms and/or PTASs (polynomial time approximation scheme) to approximate several classical graph problems such as maximum independent set, minimum vertex cover and minimum vertex coloring in these graph models. In addition, we also discuss various possible applications for these simple approximation algorithms and/or PTASs in wireless ad hoc networks.

[1]  Rajiv Gandhi,et al.  Distributed Algorithms for Coloring and Domination in Wireless Ad Hoc Networks , 2004, FSTTCS.

[2]  F. Roberts.  Graph Theory and Its Applications to Problems of Society , 1987 .

[3]  Tzu-Chieh Tsai,et al.  An Adaptive IEEE 802.11 MAC in Multihop Wireless Ad Hoc Networks Considering Large Interference Range , 2004, WONS.

[4]  Xiang-Yang Li,et al.  Geometric spanners for wireless ad hoc networks , 2002, Proceedings 22nd International Conference on Distributed Computing Systems.

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

[6]  Christian Bettstetter,et al.  Scenario-based stability anlysis of the distributed mobility-adaptive clustering (DMAC) algorithm , 2001, MobiHoc.

[7]  Yunnan Wu,et al.  Bounding the power rate function of wireless ad hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[8]  Harry B. Hunt,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998, J. Algorithms.

[9]  Ravi Prakash,et al.  Load-balancing clusters in wireless ad hoc networks , 2000, Proceedings 3rd IEEE Symposium on Application-Specific Systems and Software Engineering Technology.

[10]  G. Szekeres,et al.  An inequality for the chromatic number of a graph , 1968 .

[11]  W. Thurston,et al.  Three-Dimensional Geometry and Topology, Volume 1 , 1997, The Mathematical Gazette.

[12]  Rohit Negi,et al.  Physical Layer Effect on MAC Performance in Ad-Hoc Wireless Networks , 2003 .

[13]  Xiang-Yang Li,et al.  Simple heuristics and PTASs for intersection graphs in wireless ad hoc networks , 2002, DIALM '02.

[14]  Wolfgang Maass,et al.  Approximation schemes for covering and packing problems in image processing and VLSI , 1985, JACM.

[15]  Rong Zheng,et al.  Time indexing in sensor networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[16]  Rong Zheng,et al.  Asynchronous wakeup for ad hoc networks , 2003, MobiHoc '03.

[17]  Sajal K. Das,et al.  A Weight Based Distributed Clustering Algorithm for Mobile ad hoc Networks , 2000, HiPC.

[18]  T. Gonzalez,et al.  Minimum-energy Broadcast in Simple Graphs with Limited Node Power , 2007 .

[19]  Mahesh K. Marina,et al.  Virtual dynamic backbone for mobile ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[20]  David G. Kirkpatrick,et al.  Unit disk graph recognition is NP-hard , 1998, Comput. Geom..

[21]  Xiuzhen Cheng,et al.  Strong Minimum Energy Topology in Wireless Sensor Networks: NP-Completeness and Heuristics , 2003, IEEE Trans. Mob. Comput..

[22]  Xiang-Yang Li,et al.  OVSF-CDMA Code Assignment in Wireless Ad Hoc Networks , 2004, DIALM-POMC '04.

[23]  Yan Gao,et al.  Fair scheduling with bottleneck consideration in wireless ad-hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).

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

[25]  Aravind Srinivasan,et al.  End-to-end packet-scheduling in wireless ad-hoc networks , 2004, SODA '04.

[26]  MaratheMadhav,et al.  NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs , 1998 .

[27]  Gen-Huey Chen,et al.  Maximum traffic scheduling and capacity analysis for IEEE 802.15.3 high data rate MAC protocol , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[28]  W. Thurston,et al.  Three-Dimensional Geometry and Topology, Volume 1 , 1997, The Mathematical Gazette.

[29]  Haitao Liu,et al.  Selective backbone construction for topology control in ad hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[30]  O. Kachirski,et al.  Intrusion detection using mobile agents in wireless ad hoc networks , 2002, Proceedings. IEEE Workshop on Knowledge Media Networking.

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

[32]  Nitin H. Vaidya,et al.  Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications , 1999 .

[33]  Stefano Basagni,et al.  Distributed clustering for ad hoc networks , 1999, Proceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99).

[34]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[35]  Mario Gerla,et al.  How effective is the IEEE 802.11 RTS/CTS handshake in ad hoc networks , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[36]  Panos M. Pardalos,et al.  A reliable virtual backbone scheme in mobile ad-hoc networks , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[37]  F. McMorris,et al.  Topics in Intersection Graph Theory , 1987 .

[38]  Donald F. Towsley,et al.  Optimal multicast smoothing of streaming video over an internetwork , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[39]  Shugong Xu,et al.  Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks? , 2001, IEEE Commun. Mag..

[40]  Jie Wu,et al.  A Dominating-Set-Based Routing Scheme in Ad Hoc Wireless Networks , 2001, Telecommun. Syst..

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

[42]  Xiang-Yang Li,et al.  Distributed low-cost backbone formation for wireless ad hoc networks , 2005, MobiHoc '05.

[43]  Vaduvur Bharghavan,et al.  The clade vertebrata: spines and routing in ad hoc networks , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[45]  Timothy M. Chan.  Polynomial-time approximation schemes for packing and piercing fat objects , 2003, J. Algorithms.

[46]  P. Kumar,et al.  Capacity of Ad Hoc Wireless Networks , 2002 .

[47]  Klaus Jansen,et al.  Polynomial-time approximation schemes for geometric graphs , 2001, SODA '01.

[48]  J. Mark Keil,et al.  An optimal algorithm for finding dominating cycles in circular-arc graphs , 1992, Discret. Appl. Math..

[49]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[50]  Zygmunt J. Haas,et al.  Virtual backbone generation and maintenance in ad hoc network mobility management , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[51]  Kaoru Watanabe,et al.  Craph theoretical considerations of a channel assignment problem on multihop wireless networks , 2002 .

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

[53]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[54]  Xiang-Yang Li,et al.  Efficient distributed low-cost backbone formation for wireless networks , 2006, IEEE Transactions on Parallel and Distributed Systems.

[55]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.

[56]  Stefano Basagni,et al.  Finding a Maximal Weighted Independent Set in Wireless Networks , 2001, Telecommun. Syst..

[57]  Peng-Jun Wan,et al.  New distributed algorithm for connected dominating set in wireless ad hoc networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[58]  Dorit S. Hochbaum,et al.  Efficient bounds for the stable set, vertex cover and set packing problems , 1983, Discret. Appl. Math..