Multicast Communications in Ad Hoc Networks Using Directional Antennas: A Lifetime-Centric Approach

We consider a wireless ad hoc network where each node employs a single-beam directional antenna and is provisioned with limited energy. We are interested in an online routing algorithm for successive multicast communication requests with the aim of maximizing the network lifetime. The beam-forming property, which is associated with single-beam directional antennas, introduces some unique problems that do not exist for omnidirectional antennas and, therefore, significantly increases the design space for routing algorithms. The contributions of this paper are twofold. First, we provide some important theoretical understanding on various multicast problems and deduce that even an offline version of this problem is NP-hard. Second, we develop a highly competitive online routing algorithm that takes the network lifetime consideration directly into iterative calculations and show that an algorithm that is designed under this methodology provides consistently better performance than the current state-of-the-art algorithm that only considers remaining energy. The theoretical results and routing algorithm in this paper offer some important insights on algorithm design for energy-constrained wireless ad hoc networks with directional antennas

[1]  Saswati Sarkar,et al.  A framework for optimal battery management for wireless nodes , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[2]  Song Guo,et al.  Antenna orientation optimization for minimum-energy multicast tree construction in wireless ad hoc networks with directional antennas , 2004, MobiHoc '04.

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

[4]  Radha Poovendran,et al.  A novel power-efficient broadcast routing algorithm exploiting broadcast efficiency , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[5]  Sandeep K. S. Gupta,et al.  G-REMiT: An algorithm for building energy efficient multicast trees in wireless ad hoc networks , 2003, Second IEEE International Symposium on Network Computing and Applications, 2003. NCA 2003..

[6]  Pekka Orponen,et al.  Lifetime maximization for multicasting in energy-constrained wireless networks , 2005 .

[7]  Qun Li,et al.  Distributed energy-conserving routing protocols , 2003, 36th Annual Hawaii International Conference on System Sciences, 2003. Proceedings of the.

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

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

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

[11]  Qun Li,et al.  Online power-aware routing in wireless Ad-hoc networks , 2001, MobiCom '01.

[12]  Stefano Leonardi,et al.  On-line Network Routing , 1996, Online Algorithms.

[13]  Anthony Ephremides,et al.  Energy-Aware Wireless Networking with Directional Antennas: The Case of Session-Based Broadcasting and Multicasting , 2002, IEEE Trans. Mob. Comput..

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

[15]  Leandros Tassiulas,et al.  Routing for network capacity maximization in energy-constrained ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[16]  Sandy Irani,et al.  Online computation , 1996 .

[17]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[18]  S HochbaDorit.  Approximation Algorithms for NP-Hard Problems , 1997 .

[19]  Paolo Santi,et al.  Investigating upper bounds on network lifetime extension for cell-based energy conservation techniques in stationary ad hoc networks , 2002, MobiCom '02.

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

[21]  Radha Poovendran,et al.  Maximizing Network Lifetime of Broadcasting Over Wireless Stationary Ad Hoc Networks , 2005, Mob. Networks Appl..

[22]  Pekka Orponen,et al.  Multicast time maximization in energy constrained wireless networks , 2003, DIALM-POMC '03.

[23]  Theodore S. Rappaport,et al.  Smart antennas: Adaptive arrays, algorithms, & wireless position location , 1998 .

[24]  Mohamed A. El-Sharkawi,et al.  r-shrink: a heuristic for improving minimum power broadcast trees in wireless networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[25]  Mohamed A. El-Sharkawi,et al.  MDLT: a polynomial time optimal algorithm for maximization of time-to-first- failure in energy constrained wireless broadcast networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).