Energy-Efficient Broadcasting in Wireless ad hoc Networks Lower Bounds and Algorithms

Energy-efficient communication is critical for increasing life of power limited wireless ad hoc networks. There has been considerable interest in minimum energy broadcast operations. In this paper, we develop bounds and an algorithm for minimizing energy cost for broadcasting from any source to all other nodes in the network. Most prior work have used simpler model for energy cost for wireless communications by accounting only the analog radiation cost for transmission and ignored the fixed cost for electronics in transmission and reception circuitry in nodes. Furthermore, in a network it is possible for some node pairs not be able to communicate directly even though they are in their radio ranges due to obstacles present in the terrain of the network.

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

[2]  StojmenovicIvan,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002 .

[3]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[4]  Anthony Ephremides,et al.  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).

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

[6]  Michele Zorzi,et al.  Energy Management in Wireless Communications , 2002 .

[7]  Krishna M. Sivalingam,et al.  Low power link and access protocols for wireless multimedia networks , 1997, 1997 IEEE 47th Vehicular Technology Conference. Technology in Motion.

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

[9]  Krishna M. Sivalingam,et al.  A Survey of Energy Efficient Network Protocols for Wireless Networks , 2001, Wirel. Networks.

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

[11]  S. M. Heemstra de Groot,et al.  Power-aware routing in mobile ad hoc networks , 1998, MobiCom '98.

[12]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[13]  Ivan Stojmenovic,et al.  Power-aware localized routing in wireless networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[14]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[15]  Gao Shuhong,et al.  Short containers in Cayley graphs , 2001 .

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

[17]  Suresh Singh,et al.  PAMAS—power aware multi-access protocol with signalling for ad hoc networks , 1998, CCRV.

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

[19]  Martin Nilsson,et al.  Investigating the energy consumption of a wireless network interface in an ad hoc networking environment , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[21]  Leandros Tassiulas,et al.  Energy conserving routing in wireless ad-hoc networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[22]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .

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

[24]  H. Bertoni,et al.  Effect of terrain on path loss in urban environments for wireless applications , 1998 .

[25]  Cauligi S. Raghavendra,et al.  Energy efficient broadcasting for situation awareness in ad hoc networks , 2001, International Conference on Parallel Processing, 2001..