期刊名称：International Journal of Wireless & Mobile Networks
印刷版ISSN：0975-4679
电子版ISSN：0975-3834
出版年度：2013
卷号：5
期号：5
DOI：10.5121/ijwmn.2013.5502
出版社：Academy & Industry Research Collaboration Center (AIRCC)
摘要：Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's neighbours while providing the worst-case latency guarantee for data collection, and a distributed algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, 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 SPD-based data collection approach in both network lifetime and load balance
