## 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 1 2007 |

## Keywords

- Communication system routing
- Routing
- Sensor networks

## ASJC Scopus subject areas

- Electrical and Electronic Engineering