Mathematical Modeling of Association Attempt with the Base Station for Maximum Number of Customer Premise Equipments in the IEEE 802.22 Network

摘要

Avoiding collision among contending customer premise equipments (CPEs) attempting to associate with a base station (BS), the only available solution in IEEE 802.22 standard is binary exponential random backoff process in which the contending CPEs retransmit their association requests. The number of attempts the CPEs sends their requests to the BS are fixed in IEEE 802.22 network. This paper presents a mathematical framework for helping the BS in determining at which attempt the majority of the CPEs become the part of wireless regional area network (WRAN) from a particular number of contending CPEs at a given initial contention window size.