A distributed algorithm for load-balanced routing in multihop wireless sensor networks

  • Authors:
  • Punyasha Chatterjee;Nabanita Das

  • Affiliations:
  • Govt. College of Engg. & Textile Technology, Serampore;Indian Statistical Institute, Kolkata

  • Venue:
  • ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

For multi-hop wireless sensor networks, this paper presents a simple, loop-free, distributed algorithm to select path for data gathering from each sensor node to the sink node that attempts to balance the load in terms of power dissipation in communication at individual nodes with 100% data aggregation to enhance the lifetime of the network as a whole. It requires just a one-time computation during the initialization of the network, and the paths remain static unless the routing tree gets partitioned due to faults etc. The performance of the proposed scheme has been compared with some conventional centralized routing techniques, namely the minimum hop routing, the shortest power path routing and the minimum spanning tree routing by simulation. In all the cases, the proposed algorithm results improved lifetime.