Data networks
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Optimization flow control—I: basic algorithm and convergence
IEEE/ACM Transactions on Networking (TON)
Localization for mobile sensor networks
Proceedings of the 10th annual international conference on Mobile computing and networking
MISTRAL: efficient flooding in mobile ad-hoc networks
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Rate-lifetime tradeoff for reliable communication in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal routing and data aggregation for maximizing lifetime of wireless sensor networks
IEEE/ACM Transactions on Networking (TON)
Opportunistic flooding in low-duty-cycle wireless sensor networks with unreliable links
Proceedings of the 15th annual international conference on Mobile computing and networking
Optimal flow control for utility-lifetime tradeoff in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed algorithms for minimum cost multicast with network coding
IEEE/ACM Transactions on Networking (TON)
Utility-based asynchronous flow control algorithm for wireless sensor networks
IEEE Journal on Selected Areas in Communications - Special issue on simple wireless sensor networking solutions
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
A Distributed Algorithm for Maximum Lifetime Routing in Sensor Networks with Mobile Sink
IEEE Transactions on Wireless Communications
Node-Based Optimal Power Control, Routing, and Congestion Control in Wireless Networks
IEEE Transactions on Information Theory
IEEE Communications Magazine
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
In this paper, we focus on minimum cost routing in the Wireless Sensor Networks (WSNs). In-network data is often routed in such a way that it can minimize overall energy consumption or it can maximize the network lifetime. However, these metrics do not take into account other costs such as queueing delay and congestion. We solve the problem by introducing a comprehensive cost function and formulating the problem as minimizing the overall cost with a lifetime guarantee. We demonstrate the convexity of the problem and introduce Lagrangian Duality method to decompose the problem. A gradient projection based algorithm is proposed to solve the problem in a fully distributed way. The convergence of the algorithm is verified theoretically. We show through extensive numerical results that our proposed algorithm converges quickly to the optimal solution, and that our algorithm has a better performance than existing algorithms.