Low-Complexity and Distributed Energy Minimization in Multihop Wireless Networks

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 scheduli...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE/ACM transactions on networking Ročník 18; číslo 2; s. 501 - 514
Hlavní autoři: Longbi Lin, Xiaojun Lin, Shroff, Ness B
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.04.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Computer networks
Cross-layer optimization
duality
Energy consumption
energy-aware routing
Interference
Mathematical models
mathematical programming/optimization
Networks
Optimization
Power consumption
Power control
Processor scheduling
Routing
Spread spectrum communication
Studies
Vehicle safety
Wireless application protocol
Wireless communication
Wireless networks
Wireless sensor networks
ISSN:1063-6692, 1558-2566
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 show that 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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1063-6692
1558-2566
DOI:10.1109/TNET.2009.2032419