Cooperative Game and Relay Pairing in Cognitive Radio Networks
In this paper, we focus on cooperative spectrum access in a cognitive radio networks (CRN), where secondary users (SUs) serve as relays for primary users (PUs) to improve their throughput, and in return SUs can gain transmission opportunities. To optimize
- PDF / 1,297,423 Bytes
- 14 Pages / 439.37 x 666.142 pts Page_size
- 50 Downloads / 180 Views
Abstract. In this paper, we focus on cooperative spectrum access in a cognitive radio networks (CRN), where secondary users (SUs) serve as relays for primary users (PUs) to improve their throughput, and in return SUs can gain transmission opportunities. To optimize the overall utility of a cooperative CRN, we first investigate the cooperation between a single pair of PU and SU with Stackelberg game model, where PU determines access time allocation while SU determines relaying power for the PU. Based on the analytical results, cooperation pairing between multiple PUs and SUs is modeled as a bipartite matching problem and solved using Gale-Shapley algorithm. Numerical results demonstrate that, with the proposed schemes, overall utility for PUs and SUs can be balanced with low computational complexity. Keywords: Cognitive radio matching
1
·
Cooperative communications
·
Stable
Introduction
With the rapid development in wireless applications and services, the demand for radio spectrum resource has significantly increased. However, the radio spectrum is limited and much of it has already been licensed exclusively to existing services. What’s more, it is widely recognized that the licensed spectrum is in fact underutilized since licensed users typically do not fully utilize their allocated spectrum at most of the time. On the contrary, unlicensed users are starved for spectrum availability [1]. To cope with such a dilemma, a great number of solutions have been discussed and cognitive radio (CR) turns out to be the one with most potential by allowing secondary users (SUs) opportunistically to utilize the spectrum resource, which is found temporarily unused by primary (licensed) users (PUs) via spectrum sensing. However, due to PU’s dynamics and unreliability of spectrum sensing resulted from channel fading or shadowing, SUs are forced to terminate the ongoing transmission once it detects that the spectrum band is reoccupied by a PU, which making SU’s transmission highly unstable. This work is supported by the grant from the National Natural Science Foundation of China (No. 61372109 and No. 61401034). c ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2016 D. Noguet et al. (Eds.): CROWNCOM 2016, LNICST 172, pp. 53–66, 2016. DOI: 10.1007/978-3-319-40352-6 5
54
L. Hao et al.
Moreover, cooperative spectrum access has emerged as a powerful technique. In CR systems, instead of keeping silent when PUs are busy, SUs can actively relay PUs’ data and in return gain opportunities for its own transmission [2,3]. In [4], a scenario in which the SU acts as a relay for the packets that the SU can receive from the primary source but the primary destination can’t, is considered and the stable throughput of the SU under this model is derived. The authors in [5] propose that the PU has the possibility to lease the owned spectrum to an ad hoc network of secondary nodes in exchange for cooperation in the form of distributed space-time coding. In [6], the authors studied the optimal cooperat
Data Loading...
