Title: Maximum lifetime broadcasting in cooperative multi-hop wireless ad hoc networks

Authors: Tamaghna Acharya, Samiran Chattopadhyay, Rajarshi Roy

Addresses: Department of ETCE, BESU, Shibpur, Howrah 711103, India. ' Department of Information Technology, Jadavpur University, Kolkata 700098, India. ' Department of Electronics and Electrical Communication Engineering, Indian Institute of Technology Kharagpur, Kharagpur 721302, India

Abstract: We investigate the scope of using cooperative routing for maximising network lifetime for a given broadcast connection in an energy-constrained multi-hop static wireless ad-hoc network. Unlike existing broadcast algorithms which have formulated lifetime maximisation as a min-max tree problem our formulation reflects node-based nature of wireless networks. We consider three different transmission techniques at the physical layer: point-to-point; point-to-multipoint (i.e., multicast); multipoint-to-point (i.e., cooperative transmission). We propose a polynomial time algorithm for lifetime maximising broadcast tree construction. Simulation results show that our algorithm outperforms the global optimal solution that achieves maximum network lifetime without using cooperation.

Keywords: wireless ad hoc networks; maximum lifetime broadcast; cooperative transmission; broadcast power minimisation; performance evaluation; greedy algorithms; broadcast trees; omni-directional antenna; polynomial time algorithms; multi-hop wireless networks; cooperative routing; simulation.

DOI: 10.1504/IJAHUC.2010.033822

International Journal of Ad Hoc and Ubiquitous Computing, 2010 Vol.6 No.1, pp.10 - 23

Published online: 02 Jul 2010 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article