Volume 2, Issue 4 (12-2010)                   IJICTR 2010, 2(4): 33-40 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Farmahini Farahani M, Ghasemi A, Razavizadeh S M. Sequential Interference-Aware Admission Control in Underlay Cognitive Radio Networks . IJICTR. 2010; 2 (4) :33-40
URL: http://ijict.itrc.ac.ir/article-1-248-en.html
1- Communication Technology Faculty Iran Telecommunication Research Center (ITRC) Tehran, Iran
2- Faculty of Electrical and Computer Engineering, K. N. Toosi University of Technology, Tehran, Iran
3- Department of Electrical Engineering, Iran University of Science and Technology (IUST) Tehran, Iran
Abstract:   (2256 Views)

In this paper, a new joint admission and power control scheme is introduced for wireless cognitive radio networks. It is assumed that the Cognitive Users (CUs) arrive sequentially in time and exploit the spectrum simultaneous to the licensed primary users. The objective is to minimize the blocking probability of the new arriving CUs while the interference limit constraint of primary users is not violated and the quality of service (QoS) requirements of the current admitted CUs is satisfied. To these aims, an algorithm is developed for CUs admission in which the power of the new arriving CU gradually increases according to two predefined parameters, Primary Interference Margin (PIM) and Secondary Interference Margin (SIM). In addition to protect the QoS of the current CUs, their powers are boosted by a particular parameter, which is calculated based on PIM and their maximum allowable power. Moreover, the PIM guarantees the protection of the primary users during the admission phase of the new arriving CU. Two admission control algorithms have been proposed, a safe admission which tightly admits a new CU and a moderate one which loosely accepts a new CU. Simulation results are provided to evaluate the performance of the proposed algorithms in terms of the blocking and outage probability and compared with recent proposed schemes. These results show that the proposed algorithms outperform the similar schemes while they are more suitable for a practical scenario.

Full-Text [PDF 1152 kb]   (975 Downloads)    
Type of Study: Research | Subject: Information Technology

Add your comments about this article : Your username or Email: