Throughput analysis for a contention-based dynamic spectrum sharing model

Abstract

In this paper we present throughput analysis for a contention-based dynamic spectrum sharing model. We consider two scenarios of allocating channels to primary users, fixed allocation and random allocation. In fixed allocation, the number of primary users allocated to a channel is fixed all the time, but the number of users in different channels may be different. In random allocation, each primary user dynamically and randomly selects a channel in each time slot. We assume that the spectrum band of primary users is divided into multiple channels and the time is slotted. Primary users allocated to a specific channel compete to access this channel in each time slot. Secondary users are able to dynamically detect the idle channels in each time slot, and compete to access these channels. We develop analytical models for the throughput of primary users and secondary users in both scenarios and examine the impact of the number of secondary users on the throughput of the system. For a given number of primary users, channels and traffic generation probability, we aim to find the number of secondary users to maximize the total throughput of both primary users and secondary users. Our solutions match closely with the numerical results.Index Terms-Dynamic spectrum access, spectrum management, cognitive radio network, throughput analysis.

Throughput maximization problem for random allocation of channels in a cognitive radio network

“…The transmission of data of an active secondary user would be successful if it selects an accessible channel that is not selected by any other secondary users. The probability of successful data transmission of an active secondary user which is called throughput is from [15]. If there are h accessible channels and k active secondary users, the throughput is…”

“…Through this model, we derive optimum number of secondary users that obtains maximum total throughput; wherein a Poisson probability law is applied considering large number of secondary users. In such a consideration, whenever throughput is plotted with fraction of primary users, skewness of the graph is reversed compared to the model discussed in [15]. As a future work, we desire to design a protocol for maximizing the throughput of both primary and secondary users.…”

“…al [14] discussed the problem of dynamic sharing of channels between primary and cognitive users . In [15] authors allow variable number of primary users in a channel. They derive throughput model for primary and secondary users and then calculate the optimal number of secondary users needed to maximize the throughput.…”

“…They derive throughput model for primary and secondary users and then calculate the optimal number of secondary users needed to maximize the throughput. In [15] researchers derive throughput for fixed and random allocation of channels. In [16] authors consider fixed allocation of channels in a cognitive radio network.…”

Resource control for cognitive multi-hop network in traffic cross environment

“…In a fixed frequency allocation policy, unused license bands remain because of their unutilized spectrum resource in the spatial and time domain. To overcome this problem, Cognitive Radio (CR) technology has been proposed [1] [2]. CR can adaptively change the communication parameters of a transmitter and a receiver according to the recognized surrounding environment of wireless communication.…”