Convex Optimization
Medium access control with coordinated adaptive sleeping for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Proceedings of the 5th international conference on Information processing in sensor networks
Maximizing system lifetime in wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
DSSP: A Dynamic Sleep Scheduling Protocol for Prolonging the Lifetime of Wireless Sensor Networks
AINAW '07 Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02
Rate allocation and network lifetime problems for wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Network lifetime maximization for estimation in multihop wireless sensor networks
IEEE Transactions on Signal Processing
Distributed algorithms for maximum lifetime routing in wireless sensor networks
IEEE Transactions on Wireless Communications
Cross-Layer Design for Lifetime Maximization in Interference-Limited Wireless Sensor Networks
IEEE Transactions on Wireless Communications
Power Control By Geometric Programming
IEEE Transactions on Wireless Communications
IEEE Transactions on Wireless Communications
Network lifetime maximization with cross-layer design in wireless sensor networks
IEEE Transactions on Wireless Communications
Emerging techniques for long lived wireless sensor networks
IEEE Communications Magazine
| Hi-index | 0.01 |
The rapid proliferation of wireless sensor networks has stimulated enormous research efforts that aim to maximize the lifetime of battery-powered sensor nodes and, by extension, the overall network lifetime. Most work in this field can be divided into two equally important threads, namely (i) energyefficient routing that balances traffic load across the network according to energy-related metrics and (ii) sleep scheduling that reduces energy cost due to idle listening by providing periodic sleep cycles for sensor nodes. To date, these two threads are pursued separately in the literature, leading to designs that optimize one component assuming the other is pre-determined. Such designs give rise to practical difficulty in determining the appropriate routing and sleep scheduling schemes in the real deployment of sensor networks, as neither component can be optimized without pre-fixing the other one. This paper endeavors to address the lack of a joint routing-and-sleep-scheduling scheme in the literature by incorporating the design of the two components into one optimization framework. Notably, joint routing-andsleep-scheduling by itself is a non-convex optimization problem, which is difficult to solve. We tackle the problem by transforming it into an equivalent Signomial Program (SP) through relaxing the flow conservation constraints. The SP problem is then solved by an iterative Geometric Programming (IGP) method, yielding an near optimal routing-and-sleep-scheduling scheme that maximizes network lifetime. To the best of our knowledge, this is the first attempt to obtain the optimal joint routing-andsleep-scheduling strategy for wireless sensor networks. The near optimal solution provided by this work opens up new possibilities for designing practical and heuristic schemes targeting the same problem, for now the performance of any new heuristics can be easily evaluated by using the proposed near optimal scheme as a benchmark.