Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks
Cited 12 times inCited 20 times in
- Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks
- Joo, Changhee; Shroff, Ness B.
- Capacity region; communication systems; multi-hop wireless networks; random access scheduling; stability
- Issue Date
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- IEEE-ACM TRANSACTIONS ON NETWORKING, v.17, no.5, pp.1481 - 1493
- The scheduling problem in multi-hop wireless networks has been extensively investigated. Although throughput optimal scheduling solutions have been developed in the literature, they are unsuitable for multi-hop wireless systems because they are usually centralized and have very high complexity. In this paper, we develop a random-access based scheduling scheme that utilizes local information. The important features of this scheme include constant-time complexity, distributed operations, and a provable performance guarantee. Analytical results show that it guarantees a larger fraction of the optimal throughput performance than the state-of-the-art. Through simulations with both single-hop and multi-hop traffics, we observe that the scheme provides high throughput, close to that of a well-known highly efficient centralized greedy solution called the Greedy Maximal Scheduler.
- ; Go to Link
- Appears in Collections:
- EE_Journal Papers
- Files in This Item:
can give you direct access to the published full text of this article. (UNISTARs only)
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.