Fairness and Network Capacity Trade-off in P2P IEEE 802.22 Networks

Wireless Regional Area Networks(WRAN), IEEE 802.22 standard, adopts a centralized cellular topology including base station (BS) and customer-premise equipments (CPEs). However this may lead to limited network capacity, since every CPE needs to communicate to the BS and only one channel can be used to communicate in the whole cell per time slot with one BS antenna. Peer to Peer WRAN (P2PWRAN) was proposed [3] to circumvent this, where CPEs can communicate with each other directly. P2PWRAN increases network capacity compared to the standard WRAN because of spatial reuse. Multiple communication channels can be simultaneously allocated and reused in one time slot by the BS and multiple CPEs. In IEEE 802.22b [4], a standard in progress, peer to peer communication plays an important role for enabling smart grids. Channel allocation influences the network performance significantly, therefore, we formulate the spectrum allocation problem in P2PWRAN as a quadratically constrained programming (QCP) problem. It is also proved as a computationally hard problem. The Greedy Coloring Algorithm (GCA) is examined in P2PWRAN channel allocation, and the results show that it may cause severe unfairness in allocation of channels. Thus a Fair Greedy Coloring Algorithm (FGCA) is proposed to guarantee a fair allocation by queuing flows considering previous allocations. However, FGCA guarantees fairness but leads to decrease in performance of P2PWRAN. Therefore, a Trade-off FGCA (TFGCA) is proposed considering fairness and network performance at the same time during allocation. Simulation results show that with the adjustment of two factors in TFGCA, network performance and fairness can be balanced.