Maximum lifetime broadcasting in cooperative multi-hop wireless ad hoc networks
by Tamaghna Acharya, Samiran Chattopadhyay, Rajarshi Roy
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 6, No. 1, 2010

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.

Online publication date: Fri, 02-Jul-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com