Data networks
Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE 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
Maximum flow-life curve for a wireless ad hoc network
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
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
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Power-Aware Localized Routing in Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
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
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
Rate allocation and network lifetime problems for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Maximize the lifetime of a data-gathering wireless sensor network
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Traffic monitoring and rate allocation in sensor networks
SENSIG'09/VIS'09/MATERIALS'09 Proceedings of the 2nd WSEAS International Conference on Sensors, and Signals and Visualization, Imaging and Simulation and Materials Science
Hi-index | 0.00 |
A fundamental problem in wireless sensor networks is to maximize network lifetime under given energy constraints. In this paper, we study the network lifetime problem by considering not only maximizing the time until the first node fails, but also maximizing the lifetimes for all the nodes in the network, which we define as the Lexicographic Max-Min (LMM) node lifetime problem. The main contributions of this paper are two-fold. First, we develop a polynomial-time algorithm to derive the LMM-optimal node lifetime vector, which effectively circumvents the computational complexity problem associated with an existing state-of-the-art approach, which is exponential. The main ideas in our approach include: (1) a link-based problem formulation, which significantly reduces the problem size in comparison with a flow-based formulation, and (2) an intelligent exploitation of parametric analysis technique, which in most cases determines the minimum set of nodes that use up their energy at each stage using very simple computations. Second, we present a simple (also polynomial-time) algorithm to calculate the flow routing schedule such that the LMM-optimal node lifetime vector can be achieved. Our results in this paper advance the state-of-the-art algorithmic design for network-wide node lifetime problem and facilitate future studies of the network lifetime problem in energy-constrained wireless sensor networks.