Reliable energy efficient routing in wireless sensor networks

Abstract

This paper describes algorithms for creation and maintenance of a spanning tree connecting nodes to the central observer (root) in wireless sensor networks. The tree is dynamically reconfigured to route around failed nodes, while minimizing energy consumption. Reconfiguration uses only local information, so that the algorithm scales to large sensor networks. The performance of the algorithm is compared to the single path with repair routing scheme