A new distributed algorithm to find breadth first search trees
IEEE Transactions on Information Theory
Approximating the minimum-degree Steiner tree to within one of optimal
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Balancing minimum spanning and shortest path trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Wireless sensor networks for habitat monitoring
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Application-specific protocol architectures for wireless networks
Application-specific protocol architectures for wireless networks
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Balancing energy efficiency and quality of aggregate data in sensor networks
The VLDB Journal — The International Journal on Very Large Data Bases
TAG: a Tiny AGgregation service for Ad-Hoc sensor networks
OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
IEEE Transactions on Mobile Computing
INFOCOM'10 Proceedings of the 29th conference on Information communications
Constructing maximum-lifetime data gathering forests in sensor networks
IEEE/ACM Transactions on Networking (TON)
Probability based dynamic load-balancing tree algorithm for wireless sensor networks
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 0.00 |
Energy-constrained sensor networks have been widely deployed for environmental monitoring and security surveillance purposes. Since sensors are usually powered by energy-limited batteries, in order to prolong the network lifetime, most existing research focuses on constructing a load-balanced routing tree rooted at the base station for data gathering. However, this may result in a long routing path from some sensors to the base station. Motivated by the need of some mission-critical applications that require all sensed data to be received by the base station with minimal delay, this paper aims to construct a routing tree such that the network lifetime is maximized while keeping the routing path from each sensor to the base station minimized. This paper shows that finding such a tree is NP-hard. Thus a novel heuristic called top-down algorithm is presented, which constructs the routing tree layer by layer such that each layer is optimally extended, using a network flow model. A distributed refinement algorithm is then devised that dramatically improves on the load balance for the routing tree produced by the top-down algorithm. Finally, extensive simulations are conducted. The experimental results show that the top-down algorithm with balance-refinement delivers a shortest routing tree whose network lifetime achieves around 85% of the optimum.