TY - GEN
T1 - Performance of random access scheduling schemes in multi-hop wireless networks
AU - Joo, Changhee
AU - Shroff, Ness B.
PY - 2007
Y1 - 2007
N2 - The performance of scheduling schemes in multi-hop wireless networks has attracted significant attention in the recent literature. It is well known that optimal scheduling solutions require centralized information and lead to impractical implementations due to their enormous complexity (high-degree polynomial or NP-hard, depending on the interference scenario). Further, multi-hop networks typically require distributed algorithms that operate on local information. Thus, in this paper, we develop a constant-time distributed random access algorithm for scheduling in multi-hop wireless networks. An important feature of this scheme is that it is guaranteed to achieve a fraction (efficiency factor) of the optimal performance. We show that this scheme theoretically achieves a superior efficiency factor as well as numerically achieves a significant performance improvement over the state-of-the-art. Simulation results also confirm that the performance of this scheme is close to a greedy centralized scheme.
AB - The performance of scheduling schemes in multi-hop wireless networks has attracted significant attention in the recent literature. It is well known that optimal scheduling solutions require centralized information and lead to impractical implementations due to their enormous complexity (high-degree polynomial or NP-hard, depending on the interference scenario). Further, multi-hop networks typically require distributed algorithms that operate on local information. Thus, in this paper, we develop a constant-time distributed random access algorithm for scheduling in multi-hop wireless networks. An important feature of this scheme is that it is guaranteed to achieve a fraction (efficiency factor) of the optimal performance. We show that this scheme theoretically achieves a superior efficiency factor as well as numerically achieves a significant performance improvement over the state-of-the-art. Simulation results also confirm that the performance of this scheme is close to a greedy centralized scheme.
UR - http://www.scopus.com/inward/record.url?scp=34548359429&partnerID=8YFLogxK
U2 - 10.1109/INFCOM.2007.11
DO - 10.1109/INFCOM.2007.11
M3 - Conference contribution
AN - SCOPUS:34548359429
SN - 1424410479
SN - 9781424410477
T3 - Proceedings - IEEE INFOCOM
SP - 19
EP - 27
BT - Proceedings - IEEE INFOCOM 2007
T2 - IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
Y2 - 6 May 2007 through 12 May 2007
ER -