You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

A Study of Maximum Lifetime Routing in Sparse Sensor Networks

Fulltext:


Research group:


Publication Type:

Conference/Workshop Paper

Venue:

Proceedings of the International Workshop on Wireless Ad Hoc and Mesh Networks

Publisher:

IEEE Computer Society Press


Abstract

A major issue in wireless sensor networks is to prolong network lifetime by efficient energy management. In this paper we present an initial study of maximum lifetime routing in sparse sensor networks. We have studied simulations of how different heuristic routing algorithms influence the energy consumption of individual sensor nodes, and thus the functional lifetime of a sparse sensor network. The functional lifetime of the sensor network can be either until the first node has run out of energy or until a certain threshold of nodes has demised. We have also compared the maximum lifetime of the heuristic algorithms to the maximum lifetime of an optimal routing solution. Our simulations with non-aggregated data indicates that using one of the presented heuristic routing algorithms are not enough to find a near optimal routing. Our study is made in the AROS framework.

Bibtex

@inproceedings{Hansen1170,
author = {Ewa Hansen and Mikael Sj{\"o}din and Mats Bj{\"o}rkman},
title = {A Study of Maximum Lifetime Routing in Sparse Sensor Networks},
month = {March},
year = {2008},
booktitle = {Proceedings of the International Workshop on Wireless Ad Hoc and Mesh Networks},
publisher = {IEEE Computer Society Press},
url = {http://www.es.mdh.se/publications/1170-}
}