Power Efficient Range Assignment for Symmetric Connectivity in Static Ad Hoc Wireless Networks

In this paper we study the problem of assigning transmission ranges to the nodes of a static ad hoc wireless network so as to minimize the total power consumed under the constraint that enough power is provided to the nodes to ensure that the network is connected. We focus on the Min-Power Symmetric Connectivity problem, in which the bidirectional links established by the transmission ranges are required to form a connected graph.Implicit in previous work on transmission range assignment under asymmetric connectivity requirements is the proof that Min-Power Symmetric Connectivity is NP-hard and that the MST algorithm has a performance ratio of 2. In this paper we make the following contributions: (1) we show that the related Min-Power Symmetric Unicast problem can be solved efficiently by a shortest-path computation in an appropriately constructed auxiliary graph; (2) we give an exact branch and cut algorithm based on a new integer linear program formulation solving instances with up to 35–40 nodes in 1 hour; (3) we establish the similarity between Min-Power Symmetric Connectivity and the classic Steiner Tree problem in graphs, and use this similarity to give a polynomial-time approximation scheme with performance ratio approaching 5/3 as well as a more practical approximation algorithm with approximation factor 11/6; and (4) we give the results of a comprehensive experimental study comparing new and previously proposed heuristics with the above exact and approximation algorithms.

[1]  Alex Zelikovsky,et al.  An 11/6-approximation algorithm for the network steiner problem , 1993, Algorithmica.

[2]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[3]  Ernst Althaus,et al.  Power efficient range assignment in ad-hoc wireless networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[4]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[5]  Madhav V. Marathe,et al.  Algorithmic Aspects of Topology Control Problems for Ad Hoc Networks , 2005, Mob. Networks Appl..

[6]  Suresh Singh,et al.  Power-Aware Broadcasting in Mobile Ad Hoc Networks∗ , 1999 .

[7]  Choukhmane El-Arbi.  Une heuristique pour le problème de l'arbre de Steiner , 1978 .

[8]  Andrew B. Kahng,et al.  A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[9]  Michael Jünger,et al.  SCIL - Symbolic Constraints in Integer Linear Programming , 2002, ESA.

[10]  George Markowsky,et al.  A fast algorithm for Steiner trees , 1981, Acta Informatica.

[11]  Hans Jürgen Prömel,et al.  A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 , 2000, J. Algorithms.

[12]  Andrea E. F. Clementi,et al.  On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..

[13]  Andrew S. Tanenbaum,et al.  Computer networks (3rd ed.) , 1996 .

[14]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[15]  Francesco Maffioli,et al.  Random Pseudo-Polynomial Algorithms for Exact Matroid Problems , 1992, J. Algorithms.

[16]  Q. Feng,et al.  On better heuristic for Euclidean Steiner minimum trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[17]  Wen-Tsuen Chen,et al.  The strongly connecting problem on multihop packet radio networks , 1989, IEEE Trans. Commun..

[18]  Ding-Zhu Du,et al.  The k-Steiner Ratio in Graphs , 1997, SIAM J. Comput..

[19]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

[20]  Mikkel Thorup,et al.  Undirected single-source shortest paths with positive integer weights in linear time , 1999, JACM.

[21]  A. Zelikovsky.  Better approximation bounds for the network and Euclidean Steiner tree problems , 1996 .

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

[23]  Ion I. Mandoiu,et al.  Symmetric Connectivity with Minimum Power Consumption in Radio Networks , 2002, IFIP TCS.

[24]  Andrea E. F. Clementi,et al.  The Power Range Assignment Problem in Radio Networks on the Plane , 2000, STACS.

[25]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[26]  Xiang-Yang Li,et al.  Minimum-energy broadcast routing in static ad hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[27]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[28]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..

[29]  Andrew S. Tanenbaum,et al.  Computer Networks, 3rd Edition , 1996, Prentice-Hall international editions.

[30]  L. Lovász.  Matching Theory (North-Holland mathematics studies) , 1986 .

[31]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[32]  Ram Ramanathan,et al.  Topology control of multihop wireless networks using transmit power adjustment , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[33]  Laurence A. Wolsey,et al.  Trees and Cuts , 1983 .