Spectrum sensing plays a critical role in cognitive radio networks (CRNs). The majority of spectrum sensing algorithms aim to detect the existence of a signal on a channel, i.e., they classify a channel into either busy or idle state, referred to as a two-state sensing model in this paper. While this model works properly when there is only one CRN accessing a channel, it significantly limits the potential and fairness of spectrum access when there are multiple co-existing CRNs. This is because if the secondary users (SUs) from one CRN are accessing a channel, SUs from other CRNs would detect the channel as busy and hence be starved. In this paper, we propose a three-state sensing model that distinguishes the channel into three states: idle, occupied by a primary user, or occupied by a secondary user. This model effectively addresses the fairness concern of the two-state sensing model, and resolves the starvation problem of multiple co-existing CRNs. To accurately detect each state of the three, we develop a two-stage detection procedure. In the first stage, energy detection is employed to identify whether a channel is idle or occupied. If the channel is occupied, the received signal is further analyzed at the second stage to determine whether the signal originates from a primary user or an SU. For the second stage, we design a statistical model and use it for distance estimation. For detection performance, false alarm and miss detection probabilities are theoretically analyzed. Furthermore, we thoroughly analyze the performance of throughput and fairness for the three-state sensing model compared with the two-state sensing model. In terms of fairness, we define a novel performance metric called all-level fairness for all(ALFA) to characterize fairness among CRNs. Extensive simulations are carried out under various scenarios to evaluate the three-state sensing model and verify the aforementioned theoretical analysis.

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.

No abstract

No abstract

No abstract