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. Eac...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2006-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74662317/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|---|
| ISSN: | 1000-436X |