• DocumentCode
    1120161
  • Title

    A Theory for Maximizing the Lifetime of Sensor Networks

  • Author

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

  • Author_Institution
    Dept. of Electr. & Comput. Eng. & the Coll. of Opt. Sci., Arizona Univ., Tucson, AZ
  • Volume
    55
  • Issue
    2
  • fYear
    2007
  • Firstpage
    323
  • Lastpage
    332
  • 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 nth minimum lifetime subject to the (n-1) the minimum lifetime being maximum, subject to the (n-2) the minimum lifetime being maximum, etc. The algorithm can be stopped at any iteration n. The presented solution assumes static network conditions
  • Keywords
    bandwidth allocation; telecommunication network routing; wireless sensor networks; Pareto-optimal solution; bandwidth resources; unicast multihop wireless sensor networks; unicast network routing model; Bandwidth; Batteries; Communication system control; Energy consumption; Iterative algorithms; Routing; Signal processing algorithms; Spread spectrum communication; Unicast; Wireless sensor networks; Communication system routing; routing; sensor networks;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/TCOMM.2006.887495
  • Filename
    4100898