
Be the first to like this
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our User Agreement and Privacy Policy.
Slideshare uses cookies to improve functionality and performance, and to provide you with relevant advertising. If you continue browsing the site, you agree to the use of cookies on this website. See our Privacy Policy and User Agreement for details.
Published on
Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In
this paper, we propose a novel routing structure, namely kDAG, to balance the load of the base station's
neighbours while providing the worstcase latency guarantee for data collection, and a distributed
algorithm for construction a kDAG based on a SPD (Shortest Path DAG). In a kDAG, the lengths of the
longest path and the shortest path of each sensor node to the base station differ by at most k. By adding
sibling edges to a SPD, our distributed algorithm allows critical nodes to have more routing choices. The
simulation results show that our approach significantly outperforms the SPDbased data collection
approach in both network lifetime and load balance.
Clipping is a handy way to collect and organize the most important slides from a presentation. You can keep your great finds in clipboards organized around topics.
Be the first to comment