Content area
Abstract
Several routing structures have been proposed for data gathering in a wireless sensor network. They are considered to be near-optimal with respect to energy efficiency or delivery delay, but they overlook the construction cost of a routing tree which may make trouble in implementation. Our primary goal in this work is to construct a routing tree with negligible cost, which performs as well as those near-optimal schemes. First, we propose a distributed and localized framework for tree construction called Local Parent Designation (LPD), where the node status information is exchanged locally and decision based on the local information leads us to construct a routing tree. Secondly, we extend LPD to so called LPD-Local Fix (LPD-LF) to reduce further the construction cost with less local information exchange. Simulation results validate that our goal is achieved. [PUBLICATION ABSTRACT]