Low-complexity and distributed energy minimization in multihop wireless networks

Authors:
Longbi Lin;Xiaojun Lin;Ness B. Shroff
Affiliations:
Morgan Stanley, New York, NY and School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN;Center for Wireless Systems and Applications and the School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN;Department of Electrical and Computer Engineering and the Department of Computer Science and Engineering, The Ohio State University, Columbus, OH
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2010

Citing 13
Cited 1

A fast and simple randomized parallel algorithm for maximal matching

Information Processing Letters
Online power-aware routing in wireless Ad-hoc networks

Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Convex Optimization

Convex Optimization
The impact of imperfect scheduling on cross-layer congestion control in wireless networks

IEEE/ACM Transactions on Networking (TON)
Energy-aware routing in sensor networks: A large system approach

Ad Hoc Networks
Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks

IEEE Transactions on Mobile Computing
Optimal backpressure routing for wireless networks with multi-receiver diversity

Ad Hoc Networks
Wireless mesh networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Energy optimal control for time-varying wireless networks

IEEE Transactions on Information Theory
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks

IEEE Transactions on Information Theory
Maximum battery life routing to support ubiquitous mobile computing in wireless ad hoc networks

IEEE Communications Magazine
A tutorial on cross-layer optimization in wireless networks

IEEE Journal on Selected Areas in Communications

A theoretical analysis of multi-hop consensus algorithms for wireless networks: Trade off among reliability, responsiveness and delay tolerance

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we study the problem of minimizing the total power consumption in a multihop wireless network subject to a given offered load. It is well-known that the total power consumption of multihop wireless networks can be substantially reduced by jointly optimizing power control, link scheduling, and routing. However, the known optimal cross-layer solution to this problem is centralized and with high computational complexity. In this paper, we develop a low-complexity and distributed algorithm that is provably power-efficient. In particular, under the node-exclusive interference model and with suitable assumptions on the power-rate function, we can showthat the total power consumption of our algorithm is at most (2 + Ɛ) times as large as the power consumption of the optimal (but centralized and complex) algorithm, where is an arbitrarily small positive constant. Our algorithm is not only the first such distributed solution with provable performance bound, but its power-efficiency ratio is also tighter than that of another suboptimal centralized algorithm in the literature.