Centralized scheduling contention resolution for wireless metropolitan area networks
|更新时间:2024-10-14
|
Centralized scheduling contention resolution for wireless metropolitan area networks
Issue 12, Pages: 83-91(2006)
作者机构:
1. 中南大学信息科学与工程学院
2. 中南大学信息科学与工程学院 湖南长沙410083 香港城市大学计算机科学系
3. 香港九龙
作者简介:
基金信息:
DOI:
CLC:TN925.93
Published:2006
稿件说明:
移动端阅览
LU Wen-yan1, JIA Wei-jia1, WANG Guo-jun1, et al. Centralized scheduling contention resolution for wireless metropolitan area networks[J]. 2006, (12): 83-91.
DOI:
LU Wen-yan1, JIA Wei-jia1, WANG Guo-jun1, et al. Centralized scheduling contention resolution for wireless metropolitan area networks[J]. 2006, (12): 83-91.DOI:
Centralized scheduling contention resolution for wireless metropolitan area networks
A novel centralized scheduling contention resolution (CSCR) was presented for the contention problem in PMP model of wireless metropolitan area networks. In each time frame
by estimating the number of active subscriber stations (SSs)
the base station (BS) provides an optimal window to all SSs. Each SS then individually participates with this win-dow in transmission. In comparison with the contention resolution based on truncated binary exponential backoff (BEB) algorithm given by IEEE 802.16
the CSCR resolution is not only easy to be implemented and more efficient in utilizing the transmission opportunities
but also can reduce the delay of admission. This was proved by our theoretical analysis and simulations.