@inproceedings{c083e878d34444dc8d95b01ef50787cf,
title = "Local pooling factor of multihop wireless networks",
abstract = "Longest Queue First (LQF) is a well-known link scheduling strategy in multihop wireless networks. Its throughput efficiency ratio was shown to be exactly the local pooling factor (LPF) of the multihop wireless network in a recent seminar work by Joo et al. [5]. Under the 802.11 interference model with uniform interference radii, the LPF of a multihop wireless network was known to be at least 1/6. However, little is known about the LPF of a multihop wireless network under the 802.11 interference model with arbitrary interference radii or under the protocol interference model. In this paper, we derive constant lower bounds on LPFs of these multihop wireless networks. Specifically, under the 802.11 interference model with arbitrary interference radii, the LPF is at least 1/16. Under the protocol interference model, if the communication radius of each node is at most c times its interference radius for some c < 1, then the LPF is at least 1/ (2(π/arcsin 1-c/2- 1)).",
keywords = "interference, Link scheduling, local pooling factor, longest queue first, throughput efficiency ratio",
author = "Wan, \{Peng Jun\} and Minming Li and Lixin Wang and Zhu Wang and Ophir Frieder",
year = "2011",
doi = "10.1109/INFCOM.2011.5935215",
language = "英语",
isbn = "9781424499212",
series = "Proceedings - IEEE INFOCOM",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "511--515",
booktitle = "2011 Proceedings IEEE INFOCOM",
address = "美国",
note = "IEEE INFOCOM 2011 ; Conference date: 10-04-2011 Through 15-04-2011",
}