Game Theoretic Study of Cooperative Spectrum Leasing in Cognitive Radio Networks

Game Theoretic Study of Cooperative Spectrum Leasing in Cognitive Radio Networks

Fatemeh Afghah (Electrical and Computer Engineering Department, North Carolina A&T State University, Greensboro, NC, USA) and Abolfazl Razi (Electrical and Computer Engineering Department, Duke University, Durham, NC, USA)
Copyright: © 2014 |Pages: 14
DOI: 10.4018/ijhcr.2014040104
OnDemand PDF Download:
List Price: $37.50


In this paper, a novel property-right spectrum leasing solution based on Stackelberg game is proposed for Cognitive Radio Networks (CRN), where part of the secondary users present probabilistic dishonest behavior. In this model, the Primary User (PU) as the spectrum owner allows the Secondary User (SU) to access the shared spectrum for a fraction of time in exchange for providing cooperative relaying service by the SU. A reputation based mechanism is proposed that enables the PU to monitor the cooperative behavior of the SUs and restrict its search space at each time slot to the secondary users that do not present dishonest behavior in the proceeding time slots. The proposed reputation-based solution outperforms the classical Stackelberg games from both primary and reliable secondary users' perspectives. This novel method of filtering out unreliable users increases the PU's expected utility over consecutive time slots and also encourages the SUs to follow the game rule.
Article Preview

1. Introduction

Due to the increasing number of users in contemporary communication systems, the demand for spectrum is growing very fast. However, the Federal Communications Commission's (FCC) technical report ((FCC), 2002) reveals that a considerable portion of spectrum remains unused over time. This suggests that the traditional fixed spectrum allocation techniques are not efficient. Thereby, the concept of cognitive networking is recognized as a promising solution to provide the chance of access to the licensed spectrum by the unlicensed users, while the spectrum is not occupied by the Primary Users (PU) (Mitola, J., & Maguire, J.G.Q., 1999).

Two general approaches to cognitive radio networks are common models and property-right models. In common models, the Primary User (PU) is oblivious to the existence of the Secondary Users (SUs). The SUs monitor the licensed band to capture the holes (idle frequency bands) in the spectrum which are not utilized by the PUs. This method is sensitive to the utilized spectrum sensing technique, since an untimely spectrum access by the secondary users may deteriorate the underlying interference management scheme and severely impact the PU operation. Therefore, this approach is not suitable for practical coexistence of networks.

On the other hand, in the property-right models, the PU willingly allocates some part of the licensed spectrum to the SUs in exchange for their relaying service (Simeone, O., Gambini, J., Bar-Ness, Y., & Spagnolini, U., 2007). This technique brings about the efficient spectrum utilization which benefits both the primary and secondary users. The cooperative packet transmission enhances the PU's throughput, especially when there is no reliable direct link between the primary transmitter and its target receiver. In return, the SUs obtain the chance to access to a part of the spectrum.

A spectrum leasing scheme is proposed in (Simeone, O., Stanojev, I., Savazzi, S., Bar-Ness, Y., Spagnolini, U., & Pickholtz, R., 2008), where a PU allocates the channel to the users of a secondary ad hoc network for a fraction of time, and the secondary network in return cooperates in forwarding the PU's packets using distributed space-time coding technique. A Stackelberg game model is used in this model, where the PU selects the fractions of time to be used for transmissions of the primary and network of the secondary users as well as the time for cooperative services, with the objective of maximizing its own transmission rate. In the next stage, the SUs that all transmit simultaneously compete with one another to set the optimal power allocation which results in a highest transmission rate.

A priced-based game model for spectrum leasing is proposed in (Wang, X., Ma, K., Han, Q., Liu, Z., & Guan, X., 2012), where time allocation parameters as well as the price of spectrum are set by the PU, while the selected SU may increase its transmission rate by optimizing its transmission power. In (Afghah, F., Costa, M., Razi, A., Abedi, A., & Ephremides, A., 2013), a cognitive radio network consisting of a single primary and a single secondary nodes is considered and a reputation-based Stackelberg game model is proposed, where the primary and secondary jointly decide about the time allocation of the spectrum. This model accounts for energy efficiency and fairness to optimally split the time into three phases: i) PU transmission, ii) cooperative relaying, and iii) SU transmission.

In the previous reported work, it is assumed that the SUs are trustable in the sense that they use the same power for transmissions of their own packets as well as cooperative packet transmission for the PU ((Simeone, O., Stanojev, I., Savazzi, S., Bar-Ness, Y., Spagnolini, U., & Pickholtz, R., 2008), (Wang, X., Ma, K., Han, Q., Liu, Z., & Guan, X., 2012), (Simeone, O., Gambini, J., Bar-Ness, Y., & Spagnolini, U., 2007), (Hao, X., Cheung, M.H., Wong, V., Leung, V.C.M., 2011)). However, this assumption may be violated in reality as cooperation is not an inherent characteristic of the cognitive users and they may prefer to save their limited available resources for their own packet transmission. In other words, although after granting the spectrum access, the SUs are supposed to treat the received packets from the primary similar to their own packets and forward them with an acceptable power, they may deviate from this rule and assign a low power to relay the PU's packet and reserve the remaining power for their individual transmission.

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 8: 4 Issues (2017): 3 Released, 1 Forthcoming
Volume 7: 4 Issues (2016)
Volume 6: 4 Issues (2015)
Volume 5: 4 Issues (2014)
Volume 4: 4 Issues (2013)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing