Approximation algorithm for maximum lifetime in wireless sensor networks with data aggregation
by Jeffrey Stanford, Sutep Tongngam
International Journal of Sensor Networks (IJSNET), Vol. 6, No. 1, 2009

Abstract: We consider the problem of maximising the lifetime of sensor networks with data aggregation, which was previously investigated by Kalpakis et al. (2003). They propose an exact polynomial-time algorithm, which is however very slow, and faster heuristics, where an approximation ratio is not guaranteed. In this paper, we demonstrate an alternative approach based on the Garg and Konemann (1998) algorithm for packing linear programs, combined with the exact computation of minimum cost arborescence. For any ε > 0, our approach obtains a solution achieving at least 1-ε times the optimum lifetime with significantly faster running time than that of the exact algorithm. The simulation result also shows that our algorithm achieves a solution that is within 0.02% of optimum and is not slower than the heuristics previously proposed by Kalpakis et al. (2003).

Online publication date: Sat, 29-Aug-2009

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 Sensor Networks (IJSNET):
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