1,769 research outputs found
Throughput and Collision Analysis of Multi-Channel Multi-Stage Spectrum Sensing Algorithms
Multi-stage sensing is a novel concept that refers to a general class of
spectrum sensing algorithms that divide the sensing process into a number of
sequential stages. The number of sensing stages and the sensing technique per
stage can be used to optimize performance with respect to secondary user
throughput and the collision probability between primary and secondary users.
So far, the impact of multi-stage sensing on network throughput and collision
probability for a realistic network model is relatively unexplored. Therefore,
we present the first analytical framework which enables performance evaluation
of different multi-channel multi-stage spectrum sensing algorithms for
Opportunistic Spectrum Access networks. The contribution of our work lies in
studying the effect of the following parameters on performance: number of
sensing stages, physical layer sensing techniques and durations per each stage,
single and parallel channel sensing and access, number of available channels,
primary and secondary user traffic, buffering of incoming secondary user
traffic, as well as MAC layer sensing algorithms. Analyzed performance metrics
include the average secondary user throughput and the average collision
probability between primary and secondary users. Our results show that when the
probability of primary user mis-detection is constrained, the performance of
multi-stage sensing is, in most cases, superior to the single stage sensing
counterpart. Besides, prolonged channel observation at the first stage of
sensing decreases the collision probability considerably, while keeping the
throughput at an acceptable level. Finally, in realistic primary user traffic
scenarios, using two stages of sensing provides a good balance between
secondary users throughput and collision probability while meeting successful
detection constraints subjected by Opportunistic Spectrum Access communication
Dynamic Rate and Channel Selection in Cognitive Radio Systems
In this paper, we investigate dynamic channel and rate selection in cognitive
radio systems which exploit a large number of channels free from primary users.
In such systems, transmitters may rapidly change the selected (channel, rate)
pair to opportunistically learn and track the pair offering the highest
throughput. We formulate the problem of sequential channel and rate selection
as an online optimization problem, and show its equivalence to a {\it
structured} Multi-Armed Bandit problem. The structure stems from inherent
properties of the achieved throughput as a function of the selected channel and
rate. We derive fundamental performance limits satisfied by {\it any} channel
and rate adaptation algorithm, and propose algorithms that achieve (or
approach) these limits. In turn, the proposed algorithms optimally exploit the
inherent structure of the throughput. We illustrate the efficiency of our
algorithms using both test-bed and simulation experiments, in both stationary
and non-stationary radio environments. In stationary environments, the packet
successful transmission probabilities at the various channel and rate pairs do
not evolve over time, whereas in non-stationary environments, they may evolve.
In practical scenarios, the proposed algorithms are able to track the best
channel and rate quite accurately without the need of any explicit measurement
and feedback of the quality of the various channels.Comment: 19 page
Cache-Enabled in Cooperative Cognitive Radio Networks for Transmission Performance
The proliferation of mobile devices that support the acceleration of data services (especially smartphones) has resulted in a dramatic increase in mobile traffic. Mobile data also increased exponentially, already exceeding the throughput of the backhaul. To improve spectrum utilization and increase mobile network traffic, in combination with content caching, we study the cooperation between primary and secondary networks via content caching. We consider that the secondary base station assists the primary user by pre-caching some popular primary contents. Thus, the secondary base station can obtain more licensed bandwidth to serve its own user. We mainly focus on the time delay from the backhaul link to the secondary base station. First, in terms of the content caching and the transmission strategies, we provide a cooperation scheme to maximize the secondary user’s effective data transmission rates under the constraint of the primary users target rate. Then, we investigate the impact of the caching allocation and prove that the formulated problem is a concave problem with regard to the caching capacity allocation for any given power allocation. Furthermore, we obtain the joint caching and power allocation by an effective bisection search algorithm. Finally, our results show that the content caching cooperation scheme can achieve significant performance gain for the primary and secondary systems over the traditional two-hop relay cooperation without caching
- …