DocumentCode :
2665843
Title :
Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks
Author :
Joo, Changhee ; Shroff, Ness B.
Author_Institution :
Purdue Univ., Lafayette
fYear :
2007
fDate :
6-12 May 2007
Firstpage :
19
Lastpage :
27
Abstract :
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.
Keywords :
distributed algorithms; greedy algorithms; radio networks; scheduling; constant-time optimal distributed random access scheduling algorithm; greedy centralized scheme; multihop wireless network; Communications Society; Interference; Optimal scheduling; Processor scheduling; Routing; Scheduling algorithm; Spread spectrum communication; Telecommunication traffic; Traffic control; Wireless networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM 2007. 26th IEEE International Conference on Computer Communications. IEEE
Conference_Location :
Anchorage, AK
ISSN :
0743-166X
Print_ISBN :
1-4244-1047-9
Type :
conf
DOI :
10.1109/INFCOM.2007.11
Filename :
4215593
Link To Document :
بازگشت