Details of Research Outputs

针对无线城域网PMP模式下的竞争问题,提出了一种中心调度的竞争解决方案CSCR（centralizedschedulingcontentionresolution）。通过对每一时间帧内活动用户站（subscriberstations）数目的预测,基站（basestation）给所有用户站提供了一个优化的竞争窗口,所有用户站都采用该窗口独立地参与竞争。理论分析和模拟结果表明,与IEEE802.16推荐的基于二进制指数回退BEB（binaryexponentialbackoff）算法的方案相比,CSCR方案不但易于实现,而且能更加有效地利用无线资源,同时减少请求接入延时。

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 window 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.