Abstract

The problem of resource allocation in a spectrum leasing scenario in cooperative cognitive radio networks is addressed. The system model consists of a number of primary user (PU) pairs and a secondary user (SU) pair. The SU pair allocates the whole its transmission power in a portion of transmission frame to relay the primary signals. In return, the PU pairs lease their unused portion of transmission frame to the SU pair. In this way, the PU pairs take advantage of their unused portion of time to gain savings in their transmission power. However, a few important questions must be answered: When to lease and how much to be leased. We determine when is beneficial for PUs to lease their unused spectrum portion to the SU and how much of PUs' resources is optimum to be leased. An efficient auction mechanism is proposed and the existence and uniqueness of the Nash Equilibrium (NE) for the proposed auction game is proved. Since the NE is the solution of a set of fixed point problems, two iterative algorithms, synchronous and asynchronous schemes, are proposed to reach the NE in an iterative manner and their convergence to the fixed point is also proved. Finally, the proposed auction is extended to a network with multiple secondary user pairs. Simulation results acknowledge the more efficient utilization of resources as a result of implementing the proposed auction based resource allocation.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.