Ergodic capacity of spectrum sharing cognitive radio with MRC diversity and Nakagami fading

Author(s):  
Vesna M. Blagojevic ◽  
Predrag N. Ivanis
2012 ◽  
Vol 16 (3) ◽  
pp. 321-323 ◽  
Author(s):  
Vesna Blagojevic ◽  
Predrag Ivanis

2013 ◽  
Vol 2013 ◽  
pp. 1-8
Author(s):  
Phillip Babatunde Oni ◽  
Ruifeng Duan ◽  
Mohammed Elmusrati

In this study, the maximum achievable information transmission rate of spectrum sharing cognitive radio with maximal ratio combining (MRC) antenna diversity technique is investigated when the channel between the secondary transmitter and the primary receiver and that between the secondary transmitter and the secondary receiver suffer Nakagami-m fading. With an assumption that both channels encounter Nakagami-m fading and the transmission of the secondary transmitter is subject to average interference power constraint, the approximated expressions for analyzing the effective capacity and the ergodic capacity of cognitive radio users with MRC are presented. The two capacity models are compared. In the case of the effective capacity, it is shown that different applications or users with different quality of service (QoS) requirements can be supported in cognitive radio, and when the delay QoS decreases, the effective capacity approaches the ergodic capacity.


Electronics ◽  
2021 ◽  
Vol 10 (5) ◽  
pp. 602
Author(s):  
Monisha Devi ◽  
Nityananda Sarma ◽  
Sanjib K. Deka

Cognitive radio (CR) has evolved as a novel technology for overcoming the spectrum-scarcity problem in wireless communication networks. With its opportunistic behaviour for improving the spectrum-usage efficiency, CR enables the desired secondary users (SUs) to dynamically utilize the idle spectrum owned by primary users. On sensing the spectrum to identify the idle frequency bands, proper spectrum-allocation mechanisms need to be designed to provide an effectual use of the radio resource. In this paper, we propose a single-sided sealed-bid sequential-bidding-based auction framework that extends the channel-reuse property in a spectrum-allocation mechanism to efficiently redistribute the unused channels. Existing auction designs primarily aim at maximizing the auctioneer’s revenue, due to which certain CR constraints remain excluded in their models. We address two such constraints, viz. the dynamics in spectrum opportunities and varying availability time of vacant channels, and formulate an allocation problem that maximizes the utilization of the radio spectrum. The auctioneer strategises winner determination based on bids collected from SUs and sequentially leases the unused channels, while restricting the channel assignment to a single-channel-multi-user allocation. To model the spectrum-sharing mechanism, we initially developed a group-formation algorithm that enables the members of a group to access a common channel. Furthermore, the spectrum-allocation and pricing algorithms are operated under constrained circumstances, which guarantees truthfulness in the model. An analysis of the simulation results and comparison with existing auction models revealed the effectiveness of the proposed approach in assigning the unexploited spectrum.


Sign in / Sign up

Export Citation Format

Share Document