### 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 language | English (US) |
---|---|

Pages (from-to) | 323-332 |

Number of pages | 10 |

Journal | IEEE Transactions on Communications |

Volume | 55 |

Issue number | 2 |

DOIs | |

State | Published - Feb 2007 |

### Fingerprint

### Keywords

- Communication system routing
- Routing
- Sensor networks

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Computer Networks and Communications

### Cite this

*IEEE Transactions on Communications*,

*55*(2), 323-332. https://doi.org/10.1109/TCOMM.2006.887495

**A theory for maximizing the lifetime of sensor networks.** / Dagher, Joseph C.; Marcellin, Michael W; Neifeld, Mark A.

Research output: Contribution to journal › Article

*IEEE Transactions on Communications*, vol. 55, no. 2, pp. 323-332. https://doi.org/10.1109/TCOMM.2006.887495

}

TY - JOUR

T1 - A theory for maximizing the lifetime of sensor networks

AU - Dagher, Joseph C.

AU - Marcellin, Michael W

AU - Neifeld, Mark A

PY - 2007/2

Y1 - 2007/2

N2 - 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.

AB - 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.

KW - Communication system routing

KW - Routing

KW - Sensor networks

UR - http://www.scopus.com/inward/record.url?scp=33947586410&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947586410&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2006.887495

DO - 10.1109/TCOMM.2006.887495

M3 - Article

AN - SCOPUS:33947586410

VL - 55

SP - 323

EP - 332

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0090-6778

IS - 2

ER -