On the approximation ratio of the MST based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks

We present a technique to evaluate the approximation ratio on random instances of the minimum energy broadcast problem in ad-hoc radio networks which is known to be NP-hard and approximable within 12. Our technique relies on polynomial-time computable lower bound on the optimal cost of any instance. The main result of this paper is that the approximation ratio has never achieved a value greater than 6.4. Furthermore, the worst values of this ratio are achieved for small network sizes. We also provide a clear geometrical motivation of such good approximation results.

[1]  Mario Gerla,et al.  GloMoSim: A Scalable Network Simulation Environment , 2002 .

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

[3]  Robert E. Tarjan,et al.  Verification and Sensitivity Analysis of Minimum Spanning Trees in Linear Time , 1992, SIAM J. Comput..

[4]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[5]  David Eppstein,et al.  Offline Algorithms for Dynamic Minimum Spanning Tree Problems , 1991, J. Algorithms.

[6]  J. Evans,et al.  Networking on the battlefield: challenges in highly dynamic multi-hop wireless networks , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

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

[8]  D. Raychaudhuri,et al.  ATM-based transport architecture for multiservices wireless personal communication networks , 1994, IEEE J. Sel. Areas Commun..

[9]  Robert Tappan Morris,et al.  Capacity of Ad Hoc wireless networks , 2001, MobiCom '01.

[10]  Jan M. Rabaey,et al.  PicoRadio Supports Ad Hoc Ultra-Low Power Wireless Networking , 2000, Computer.

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

[12]  J. Michael Steele,et al.  Asymptotics for Euclidean minimal spanning trees on random points , 1992 .

[13]  Lusheng Ji,et al.  Differential destination multicast-a MANET multicast routing protocol for small groups , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[15]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[16]  David Eppstein.  Offline Algorithms for Dynamic Minimum Spanning Tree Problems , 1994, J. Algorithms.

[17]  Gregory J. Pottie,et al.  Wireless integrated network sensors , 2000, Commun. ACM.

[18]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[19]  Paramvir Bahl,et al.  Analysis of a cone-based distributed topology control algorithm for wireless multi-hop networks , 2001, PODC '01.

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

[21]  J.-Y. Le Boudec,et al.  Toward self-organized mobile ad hoc networks: the terminodes project , 2001, IEEE Commun. Mag..

[22]  Reuven Bar-Yehuda,et al.  Multiple Communication in Multihop Radio Networks , 1993, SIAM J. Comput..

[23]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[24]  Teresa H. Meng,et al.  Minimum energy mobile wireless networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[25]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

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

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

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

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

[30]  Joseph E. Yukich.  Asymptotics for weighted minimal spanning trees on random points , 2000 .

[31]  J. Steele.  Growth Rates of Euclidean Minimal Spanning Trees With Power Weighted Edges , 1988 .

[32]  Gregory Lauer,et al.  Packet-radio routing , 1995 .

[33]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[34]  Zygmunt J. Haas,et al.  On some challenges and design choices in ad-hoc communications , 1998, IEEE Military Communications Conference. Proceedings. MILCOM 98 (Cat. No.98CH36201).

[35]  Reuven Bar-Yehuda,et al.  Multiple communication in multi-hop radio networks , 1989, PODC '89.

[36]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[37]  Enrico Nardelli,et al.  Maintaining a Minimum Spanning Tree Under Transient Node Failures , 2000, ESA.