Bounded-hops power assignment in ad-hoc wireless networks

Motivated by topology control in ad-hoc wireless networks, power assignment is a family of problems, each defined by a certain connectivity constraint (such as strong connectivity). These problems have been studied in the past. In this paper we consider delay bounds as an additional constraint to provide quality of service. Delay is measured by the number of hops on a path between two nodes. We present an algorithm for minimum power bounded hops broadcast with guaranteed bicriteria ratio of (O(log n), O(log n)) for general graphs. That is, in the solution produced by our algorithm, the number of hops between the root and any other node is at most O(log n) times the given bound and the power is at most O(log n) times the power of optimal solution. Our bicriteria results extend to min-power bounded-hops strong connectivity (the solution must have a path of at most d edges in between any two nodes) and min-power bounded-hops symmetric connectivity (the undirected graph having an edge uv iff the solution has both uv and vu is required to have diameter at most d). Previous work for min-power bounded-hops strong connectivity consists only of constant or better approximation for special cases of the Euclidean case. We also provide better guarantees for the Euclidean cases by post processing solutions of the main algorithm.

[1]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[2]  Gruia Calinescu,et al.  Network Lifetime and Power Assignment in ad hoc Wireless Networks , 2003, ESA.

[3]  Rajmohan Rajaraman,et al.  Topology control and routing in ad hoc networks: a survey , 2002, SIGA.

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

[5]  Nitin H. Vaidya,et al.  An energy efficient MAC protocol for wireless LANs , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

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

[7]  Anthony Ephremides,et al.  Algorithms for Energy-Efficient Multicasting in Static Ad Hoc Wireless Networks , 2001, Mob. Networks Appl..

[8]  Ioannis Caragiannis,et al.  New Results for Energy-Efficient Broadcasting in Wireless Networks , 2002, ISAAC.

[9]  Peter Sanders,et al.  Energy Optimal Routing in Radio Networks Using Geometric Data Structures , 2002, ICALP.

[10]  D. Hochbaum.  Approximating covering and packing problems: set cover, vertex cover, independent set, and related problems , 1996 .

[11]  Afonso Ferreira,et al.  The Minimum Range Assignment Problem on Linear Radio Networks , 2000, ESA.

[12]  Madhav V. Marathe,et al.  Topology Control Problems under Symmetric and Asymmetric Power Thresholds , 2003, ADHOC-NOW.

[13]  Li Li,et al.  Distributed topology control for power efficient operation in multihop wireless ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  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).

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

[16]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2005, IEEE Trans. Wirel. Commun..

[17]  Friedhelm Meyer auf der Heide,et al.  Congestion, Dilation, and Energy in Radio Networks , 2004, Theory of Computing Systems.

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

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

[20]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[21]  Andrea E. F. Clementi,et al.  Some Recent Theoretical Advances and Open Questions on Energy Consumption in Ad-Hoc Wireless Networks , 2001 .

[22]  Andrea E. F. Clementi,et al.  Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks , 2004, STACS.

[23]  Weifa Liang,et al.  Constructing minimum-energy broadcast trees in wireless ad hoc networks , 2002, MobiHoc '02.

[24]  Robert Krauthgamer,et al.  Polylogarithmic inapproximability , 2003, STOC '03.

[25]  Guy Kortsarz,et al.  Approximating the Weight of Shallow Steiner Trees , 1999, Discret. Appl. Math..

[26]  Arthur Warburton,et al.  Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..

[27]  Laura Marie Feeney,et al.  A QoS aware power save protocol for wireless ad hoc networks , 2002 .

[28]  Andrea E. F. Clementi,et al.  The minimum broadcast range assignment problem on linear multi-hop wireless networks , 2003, Theor. Comput. Sci..

[29]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[30]  Sudipto Guha,et al.  Approximation algorithms for directed Steiner problems , 1999, SODA '98.

[31]  Refael Hassin,et al.  Approximation Schemes for the Restricted Shortest Path Problem , 1992, Math. Oper. Res..

[32]  Cynthia A. Phillips,et al.  The network inhibition problem , 1993, STOC.

[33]  R. Ravi,et al.  Bicriteria Network Design Problems , 1994, J. Algorithms.

[34]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[35]  Jean-Pierre Hubaux,et al.  Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues , 2002, MobiCom '02.