Format

Send to

Choose Destination
Sensors (Basel). 2017 Dec 7;17(12). pii: E2838. doi: 10.3390/s17122838.

Self-Coexistence among IEEE 802.22 Networks: Distributed Allocation of Power and Channel.

Author information

1
Department of Computer Science and Engineering, University of Dhaka, Dhaka 1000, Bangladesh. sayefsakin@gmail.com.
2
Department of Computer Science and Engineering, University of Dhaka, Dhaka 1000, Bangladesh. razzaque@du.ac.bd.
3
College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia. mmhassan@ksu.edu.sa.
4
College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia. atif@ksu.edu.sa.
5
Department of Computer Science and Engineering, Kyung Hee University, Gyeonggi-do 17104, Korea. nguyenth@khu.ac.kr.
6
Department of Informatics, Modeling, Electronics, and Systems, University of Calabria, 87036 Arcavacata, Italy. g.fortino@unical.it.

Abstract

Ensuring self-coexistence among IEEE 802.22 networks is a challenging problem owing to opportunistic access of incumbent-free radio resources by users in co-located networks. In this study, we propose a fully-distributed non-cooperative approach to ensure self-coexistence in downlink channels of IEEE 802.22 networks. We formulate the self-coexistence problem as a mixed-integer non-linear optimization problem for maximizing the network data rate, which is an NP-hard one. This work explores a sub-optimal solution by dividing the optimization problem into downlink channel allocation and power assignment sub-problems. Considering fairness, quality of service and minimum interference for customer-premises-equipment, we also develop a greedy algorithm for channel allocation and a non-cooperative game-theoretic framework for near-optimal power allocation. The base stations of networks are treated as players in a game, where they try to increase spectrum utilization by controlling power and reaching a Nash equilibrium point. We further develop a utility function for the game to increase the data rate by minimizing the transmission power and, subsequently, the interference from neighboring networks. A theoretical proof of the uniqueness and existence of the Nash equilibrium has been presented. Performance improvements in terms of data-rate with a degree of fairness compared to a cooperative branch-and-bound-based algorithm and a non-cooperative greedy approach have been shown through simulation studies.

KEYWORDS:

IEEE 802.22; Nash equilibrium; OFDMA; WRAN; cognitive radio; distributed algorithm; game theory; non-linear optimization

Supplemental Content

Full text links

Icon for Multidisciplinary Digital Publishing Institute (MDPI) Icon for PubMed Central
Loading ...
Support Center