Cognitive Radio Relay Networks with Multiple Primary and Secondary Users: Distributed Stable Matching Algorithms for Spectrum Access

Bayat, Siavash; Louie, Raymond H. Y.; Li, Yonghui; Vucetic, Branka

doi:10.1109/icc.2011.5962935

Cited by 41 publications

(80 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In line with [12], we consider an overlay cooperative CR scheme comprising L P U number of "PU transmitter (Pt) and PU receiver (Pr) pairs" 2 , namely (…”

Section: System Modelmentioning

confidence: 99%

“…Hence the CU has to wait for the PU to cease its transmissions [11]. Cooperation strategies involving multiple PUs were considered in [12]- [15]. Different PUs may operate using different licensed bands in the same geographical location.…”

mentioning

confidence: 99%

“…Moreover, all PUs and CUs may be considered to be selfish, hence they may only be concerned about their own benefit, pursuing their own best strategies for maximizing their own sum rate or throughput. A conventional distributed algorithm (CDA) was proposed in [12], which may be viewed as an evolution from the dynamic auction algorithms [16], [17], since it considers a resourceallocation [18] framework that facilitates a joint competitive strategy of the PUs and the CUs conceived for accessing the spectral resources. Moreover, the authors of [12] conceived a non-cooperative game, which employs the CDA for efficiently representing the interaction among the competing PUs, where each PU chooses its allocation independently of the others in order to improve its own performance.…”

mentioning

confidence: 99%

“…A conventional distributed algorithm (CDA) was proposed in [12], which may be viewed as an evolution from the dynamic auction algorithms [16], [17], since it considers a resourceallocation [18] framework that facilitates a joint competitive strategy of the PUs and the CUs conceived for accessing the spectral resources. Moreover, the authors of [12] conceived a non-cooperative game, which employs the CDA for efficiently representing the interaction among the competing PUs, where each PU chooses its allocation independently of the others in order to improve its own performance. Explicitly, a spectral access strategy is designed for multiple PUs and CUs, where the PUs and CUs are carefully paired for ensuring that both the PUs' and the CUs' minimum sum-rate requirements are satisfied.…”

mentioning

confidence: 99%

See 3 more Smart Citations

Pragmatic Distributed Algorithm for Spectral Access in Cooperative Cognitive Radio Networks

Liang

Jiao

et al. 2014

IEEE Trans. Commun.

View full text Add to dashboard Cite

Abstract-A pragmatic distributed algorithm (PDA) is proposed for supporting the efficient spectral access of multiple Primary Users (PUs) and Cognitive Users (CUs) in cooperative Cognitive Radio (CR) networks. The novelty of our PDA is that the PUs negotiate with the CUs concerning the specific amount of relaying and transmission time, the CU is granted, which the CU will either accept or decline. The CUs may serve as relay nodes for relaying the signal received from the PUs to their destinations, while both the PUs' and the CUs' minimum rate requirements are satisfied. This will reduce the required transmission power and/or increase the transmission rate of the PU. Our results show that the proposed scheme performs better than the benchmarker, despite its significantly lower overhead and complexity. Moreover, we show that the cooperative spectral access based on our PDA reaches an equilibrium, when it is repeated for a sufficiently long duration. These benefits are achieved, because the PUs are motivated to cooperate by the incentive of achieving a higher PU rate, whilst non-cooperation can be discouraged with the aid of a limited-duration punishment. Furthermore, we invoke an attractive practical adaptive Turbo Trellis Coded Modulation (ATTCM) scheme, which appropriately adjusts the code rate and the modulation mode according to the near-instantaneous channel conditions. It was found that the joint design of coding, modulation and user-cooperation may lead to significant mutual benefits for all the PUs and the CUs.Index Terms-Cognitive radio network, cooperative communication, spectrum access strategy, matching algorithm, ATTCM.

show abstract

“…In line with [12], we consider an overlay cooperative CR scheme comprising L P U number of "PU transmitter (Pt) and PU receiver (Pr) pairs" 2 , namely (…”

Section: System Modelmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 2 more Smart Citations

Pragmatic Distributed Algorithm for Spectral Access in Cooperative Cognitive Radio Networks

Liang

Jiao

et al. 2014

IEEE Trans. Commun.

View full text Add to dashboard Cite

show abstract

“…Stable matching theory proposed by Gale-Shapley (5) has been applied recently to solve the resource allocation problems in wireless networks (8)(9)(10)(11) . The basic concept of stable matching theory is to introduce how the players form stable matched pairings with their preferences (6,7,9) .…”

Section: Introductionmentioning

confidence: 99%

Two-Layered Hierarchical Spectrum Sharing in Cooperative Cognitive Radio Networks: A Stable Matching with Peer Effects Approach

Chen

Chang

Chien

et al. 2015

The Proceedings of the 2nd International Conference on Industrial Application Engineering 2015

View full text Add to dashboard Cite

Abstract-In this paper, we mainly address the problem of two-layered spectrum sharing between primary users (PUs) and secondary users (SUs) in a multi-channel cooperative cognitive radio network (CCRN). In CCRN, PUs select SUs as relays to increase their transmission rates while SUs gain the spectrum usage opportunities for transmitting their own traffics. However, how to select appropriate SUs as relays for PUs is still an important research issue, particularly in such an environment of multi-channel with multiple PUs and multiple SUs. In this work, we propose an approach of stable matching with peer effects, in which the stable matching and the swap matching algorithms are proposed to form the matched pairings between PUs and SUs, such that the SU will relay its paired-PU's data in exchange for gaining the spectrum usage opportunities. Finally, the benefits of the stable matching and the swap matching approaches comparing to the ones of random matching and optimal allocation are demonstrated by the simulations.

show abstract

Secure routing and resource allocation based on game theory in cooperative cognitive radio networks

Fang

Xiao

2015

Concurrency and Computation

View full text Add to dashboard Cite

The era of big data is here now, and spectrum resources are increasingly scarce in heterogeneous network environment. The spectrum efficiency and secure transmission of big data are important issues. Cognitive radio has been proposed to address the issue of spectrum efficiency, and is a hot topic in the literatures. In multi-hop cooperative cognitive radio networks (CCRNs), secondary users need the primary users' authorization to be relays. Most existing centralized route selection schemes ignore the energy allocation, and thus are inefficient. Moreover, the incomplete of information in multi-hop network leads to many difficulties in cooperation. Inspired by the game theory, a novel strategy is proposed in this paper to defend against insider attacks based on trust. This strategy is denoted as secure routing and resource allocation based on game theory in CCRNs (SRGC). With a reputation updating process and distributed learning algorithm, the proposed strategy can find a 'best' route, which is relatively safe for each primary transmitter, and at the same time fully utilizes the spectrum and energy. Using NS2, simulations indicate that SRGC can well fit into CCRNs, improve the network performance and defend against the routing disruption attacks. Compared with other schemes, the SRGC results in a performance with better adaptability to the distributed environment. Moreover, SRGC can maximize the average throughput and minimize the data drop ratios. SECURE ROUTING AND POWER CONTROL BASED ON GAME THEORY 2959 of cooperative relaying has emerged as a powerful technique because of its ability to exploit user diversity and provide high reliability and capacity in wireless networks [5].On the other hand, with the pervasiveness of big data, touching on everything we do, our attack surface will be altered and expanded, and our risks will be magnified in ways we could not have imagined [6]. This is especially true in CCRNs. In the cooperative communication, SUs will be able to use networks' resources, but a legitimate SU may be selfish and misbehaves during cooperation when it is selected to be the relay. In order to pursue more self-benefits, a dishonest SU may not obey the cooperation rule during the transmission. In a word, without considering these security threats, the PUs may choose some untrustworthy SUs to be relays, which will cause the failure of the cooperation. Moreover, PUs in CCRNs have the priority to use the channels and the demand of relaying by SUs to reduce its own energy consumption. Besides, the relays obtain transmission opportunities from the PUs as rewards and need incentive for cooperation [7]. Hence, we formulate the interaction between PUs and SUs as a Stackelberg game.For multi-user cooperation, the issues of route selection and coordination need to be considered in CCRN [8]. When a PU wishes to send packets to its receiver, it will initiate route discovery. A transmitter may find several routes and can cache these routes in its route cache. It makes more difficult for a primary transmitter to ch...

show abstract

Cognitive Radio Relay Networks with Multiple Primary and Secondary Users: Distributed Stable Matching Algorithms for Spectrum Access

Cited by 41 publications

References 8 publications

Pragmatic Distributed Algorithm for Spectral Access in Cooperative Cognitive Radio Networks

Pragmatic Distributed Algorithm for Spectral Access in Cooperative Cognitive Radio Networks

Two-Layered Hierarchical Spectrum Sharing in Cooperative Cognitive Radio Networks: A Stable Matching with Peer Effects Approach

Secure routing and resource allocation based on game theory in cooperative cognitive radio networks

Contact Info

Product

Resources

About