Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 8th annual international conference on Mobile computing and networking
An on-demand minimum energy routing protocol for a wireless ad hoc network
ACM SIGMOBILE Mobile Computing and Communications Review
Conserving Transmission Power in Wireless Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Application-specific protocol architectures for wireless networks
Application-specific protocol architectures for wireless networks
Geographic routing without location information
Proceedings of the 9th annual international conference on Mobile computing and networking
Rate allocation in wireless sensor networks with network lifetime requirement
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Avoid 'void' in geographic routing for data aggregation in sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
Maximizing the Lifetime of Wireless Sensor Networks with Mobile Sink in Delay-Tolerant Applications
IEEE Transactions on Mobile Computing
Network lifetime optimization in wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
IEEE Transactions on Parallel and Distributed Systems
Perpetual and fair data collection for environmental energy harvesting sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Maximizing the lifetime of a sensor network has been a subject of intensive study. However, much prior work defines the network lifetime as the time before the first data-generating sensor in the network runs out of energy or is not reachable to the sink due to network partition. The problemis that even though one sensor is out of operation, the rest of the network may well remain operational, with other sensors generating useful data and delivering those data to the sink. Hence, instead of just maximizing the time before the first sensor is out of operation, we should maximize the lifetime vector of the network, consisting of the lifetimes of all sensors, sorted in ascending order. For this problem, there exists only a centralized algorithm that solves a series of linear programming problems with high-order complexities. This paper proposes a fully distributed algorithm that runs iteratively. Each iteration produces a lifetime vector that is better than the vector produced by the previous iteration. Instead of giving the optimal result in one shot after lengthy computation, the proposed distributed algorithm has a result at any time, and the more time spent gives the better result.We show that when the algorithm stabilizes, its result produces the maximum lifetime vector. Furthermore, simulations demonstrate that the algorithm is able to converge rapidly toward the maximum lifetime vector with low overhead.