• DocumentCode
    3188045
  • Title

    ENCAST: energy-critical node aware spanning tree for sensor networks

  • Author

    Zou, Shoudong ; Nikolaidis, Ioanis ; Harms, Janelle J.

  • Author_Institution
    Comput. Sci. Dept., Alberta Univ., Edmonton, Alta., Canada
  • fYear
    2005
  • fDate
    16-18 May 2005
  • Firstpage
    249
  • Lastpage
    254
  • Abstract
    Spanning trees rooted at a sink node are often employed for data collection in sensor networks. The node´s double task of sensing and forwarding traffic from other nodes results in energy depletion which is dependent on the constructed spanning tree. The approach taken in this paper is to extend the lifetime of a sensor network by judiciously recalculating the data collection tree to adjust it pro-actively before nodes fail due to total energy depletion. The proposed scheme attempts to make energy-critical nodes leaf nodes, or, as a last resort, to balance the traffic load handled by them. Additionally, an exponentially decaying threshold is used for adaptively characterizing nodes as critical. Simulations demonstrate significantly improved network lifetime but also point to the need to carefully set the thresholds for characterizing nodes as critical.
  • Keywords
    exponential distribution; resource allocation; telecommunication traffic; trees (mathematics); wireless sensor networks; ENCAST; data collection tree; energy-critical node aware spanning tree; exponential decaying threshold; network lifetime; sensor network; traffic load balance; Batteries; Communication networks; Computer networks; Life testing; Recruitment; Relays; Sensor phenomena and characterization; Telecommunication traffic;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communication Networks and Services Research Conference, 2005. Proceedings of the 3rd Annual
  • Print_ISBN
    0-7695-2333-1
  • Type

    conf

  • DOI
    10.1109/CNSR.2005.32
  • Filename
    1429976