Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications 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
Maximum lifetime routing in wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Stability of end-to-end algorithms for joint routing and rate control
ACM SIGCOMM Computer Communication Review
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Rate-lifetime tradeoff for reliable communication in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of game-theoretic approaches in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Transactions on Signal Processing
Optimal rate allocation for energy-efficient multipath routing in wireless ad hoc networks
IEEE Transactions on Wireless Communications
Distributed algorithms for maximum lifetime routing in wireless sensor networks
IEEE Transactions on Wireless Communications
Hi-index | 0.00 |
In the following paper, we study the tradeoff between network lifetime and network utility for energy-constrained wireless sensor networks (WSNs) with the real-time requirement. By introducing a parameter r, we combine these two objectives into a single weighted objective, and consider rate control and routing in this tradeoff framework simultaneously. For real-time requirement, we set up real-time constraints by forcing the end-to-end delay of each route to be bounded by the maximum tolerated delay and incorporate real-time constraints into the tradeoff framework. Consequently, the tradeoff model is formulated nonlinear programming. By using the dual decomposition method and gradient/subgradient algorithms, we propose a distributed algorithm to solve nonlinear programming. Rigorous analysis and simulation are presented in order to validate our algorithm.