Wireless link scheduling under physical interference model

Link scheduling is a fundamental problem in multihop wireless networks because the capacities of the communication links in multihop wireless networks, rather than being fixed, vary with the underlying link schedule subject to the wireless interference constraint. The majority of algorithmic works o...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 Proceedings IEEE INFOCOM s. 838 - 845
Hlavní autoři: Peng-Jun Wan, Frieder, O., Xiaohua Jia, Yao, F., Xiaohua Xu, Shaojie Tang
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2011
Témata:
approximation algorithm
Approximation algorithms
Approximation methods
Interference
Link scheduling
maximum (concurrent) multiflow
maximum independent set
physical interference model
Polynomials
Schedules
Spread spectrum communication
Wireless networks
ISBN:1424499194, 9781424499199
ISSN:0743-166X
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í:Link scheduling is a fundamental problem in multihop wireless networks because the capacities of the communication links in multihop wireless networks, rather than being fixed, vary with the underlying link schedule subject to the wireless interference constraint. The majority of algorithmic works on link scheduling in multihop wireless networks assume binary interference models such as the 802.11 interference model and the protocol interference model, which often put severe restrictions on interference constraints for practical applicability of the link schedules. On the other hand, while the physical interference model is much more realistic, the link scheduling problem under physical interference model is notoriously hard to resolve and been studied only recently by a few works. This paper conducts a full-scale algorithmic study of link scheduling for maximizing throughput capacity or minimizing the communication latency in multihop wireless networks under the physical interference model. We build a unified algorithmic framework and develop approximation algorithms for link scheduling with or without power control.
ISBN:1424499194
9781424499199
ISSN:0743-166X
DOI:10.1109/INFCOM.2011.5935307