On the construction of energy-efficient broadcast tree with Hitch-hiking in wireless networks

Due to the limited power supplies of a wireless node, energy efficiency is a crucial aspect to the design of a broadcast protocol. In the minimum energy broadcast problem, each node adjusts its transmission power to minimize the total energy consumption. The minimum energy broadcast problem is proved to be NP-Complete. The Hitch-hiking model introduced recently in [M. Agarwal et al., (2004)] takes advantage of the physical layer to combine partial signals containing the same data in order to decode a complete message. Moreover, the wireless multicast advantage (WMA), that is a single transmission can be received by all the nodes that are within the transmission range of a transmitting node, reduces the total energy of the broadcast tree. In this paper, we take advantages of both Hitch-hiking and WMA to design an energy-efficient broadcast tree algorithm with Hitch-hiking (BHH). The simulation results show that BHH reduces the total energy of the broadcast tree greatly.

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

[2]  Jie Wu,et al.  Energy Efficient Broadcast in Wireless Ad hoc Networks with Hitch-hiking , 2004, IEEE INFOCOM 2004.

[3]  Ivan Stojmenovic,et al.  Energy-Efficient Broadcasting in Wireless Mobile Ad Hoc Networks , 2004 .

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

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

[6]  Ivan Stojmenovic,et al.  Localized minimum-energy broadcasting in ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[7]  Arindam Kumar Das,et al.  Minimum power broadcast trees for wireless networks: integer programming formulations , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

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

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

[10]  Andrew Chi-Chih Yao,et al.  On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems , 1977, SIAM J. Comput..

[11]  A. Ephremides,et al.  Algorithms for energy-efficient multicasting in ad hoc wireless networks , 1999, MILCOM 1999. IEEE Military Communications. Conference Proceedings (Cat. No.99CH36341).

[12]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[13]  Robert Tappan Morris,et al.  Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks , 2002, Wirel. Networks.

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

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

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