A theory for maximizing the lifetime of sensor networks

Joseph C. Dagher, Michael W. Marcellin, Mark A Neifeld

Research output: Contribution to journalArticlepeer-review

67 Scopus citations

Abstract

An important issue in wireless sensor networks is the limited energy and bandwidth resources. A novel theory is developed here for maximizing the lifetime of unicast multihop wireless sensor networks. An optimal centralized solution is presented in the form of an iterative algorithm. The algorithm attempts to find a Pareto-optimal (PO) solution. In the first iteration, the minimum lifetime of the network is maximized. If the solution is not PO, a second iteration is performed which maximizes the second minimum lifetime, subject to the minimum lifetime being maximum. At the nth iteration, the algorithm maximizes the (n - 2)th minimum lifetime subject to the (n - 1)th minimum lifetime being maximum, subject to the (n-2)th minimum lifetime being maximum, etc. The algorithm can be stopped at any iteration n. The presented solution assumes static network conditions.

Original languageEnglish (US)
Pages (from-to)323-332
Number of pages10
JournalIEEE Transactions on Communications
Volume55
Issue number2
DOIs
StatePublished - Feb 2007
Externally publishedYes

Keywords

  • Communication system routing
  • Routing
  • Sensor networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'A theory for maximizing the lifetime of sensor networks'. Together they form a unique fingerprint.

Cite this