Counter-intuitive channel allocation improvement in distributed cognitive radio networks by adding optimal interference in user's utility

Kahn at Penn ◽  
2017 ◽  
Author(s):  
Amulya Bhattarai ◽  
Prapun Suksompong ◽  
Chalie Charoenlarpnopparut ◽  
Patrachart Komolkiti
Author(s):  
Sylwia Romaszko ◽  
Petri Mähönen

In the case of Opportunistic Spectrum Access (OSA), unlicensed secondary users have only limited knowledge of channel parameters or other users' information. Spectral opportunities are asymmetric due to time and space varying channels. Owing to this inherent asymmetry and uncertainty of traffic patterns, secondary users can have trouble detecting properly the real usability of unoccupied channels and as a consequence visiting channels in such a way that they can communicate with each other in a bounded period of time. Therefore, the channel service quality, and the neighborhood discovery (NB) phase are fundamental and challenging due to the dynamics of cognitive radio networks. The authors provide an analysis of these challenges, controversies, and problems, and review the state-of-the-art literature. They show that, although recently there has been a proliferation of NB protocols, there is no optimal solution meeting all required expectations of CR users. In this chapter, the reader also finds possible solutions focusing on an asynchronous channel allocation covering a channel ranking.


Author(s):  
K. Annapurna ◽  
B. Seetha Ramanjaneyulu

Satisfying the Quality of Service (QoS) is often a challenge in cognitive radio networks, because they depend on opportunistic channel accessing. In this context, appropriate pricing of vacant channels that is linked to the preference in their allocation, is found to be useful. However, ambiguity on the possible price at which the channel would be allotted is still a concern. In this work, an auction mechanism in which maximum value of the bid is predefined is proposed. With this, users quote their bid values as per their needs of getting the channels, up to the predefined maximum allowed bid price. However, final price of allocation is decided based on the sum total demand from all the users and the availability of vacant channels. Performance of the system is found in terms of blocking probabilities of secondary users and revenues to primary users. The proposed system is found to yield similar quantum of revenues as that of the Generalized Second Price (GSP) auction, while offering much lesser blocking probabilities to high-priority users to satisfy their QoS requirements.


2011 ◽  
Vol 52 (4) ◽  
pp. 1895-1904 ◽  
Author(s):  
Wei Wang ◽  
Kejian Wu ◽  
Haiyan Luo ◽  
Guanding Yu ◽  
Zhaoyang Zhang

Sign in / Sign up

Export Citation Format

Share Document