341 research outputs found
Optimizing Average-Maximum TTR Trade-off for Cognitive Radio Rendezvous
In cognitive radio (CR) networks, "TTR", a.k.a. time-to-rendezvous, is one of
the most important metrics for evaluating the performance of a channel hopping
(CH) rendezvous protocol, and it characterizes the rendezvous delay when two
CRs perform channel hopping. There exists a trade-off of optimizing the average
or maximum TTR in the CH rendezvous protocol design. On one hand, the random CH
protocol leads to the best "average" TTR without ensuring a finite "maximum"
TTR (two CRs may never rendezvous in the worst case), or a high rendezvous
diversity (multiple rendezvous channels). On the other hand, many
sequence-based CH protocols ensure a finite maximum TTR (upper bound of TTR)
and a high rendezvous diversity, while they inevitably yield a larger average
TTR. In this paper, we strike a balance in the average-maximum TTR trade-off
for CR rendezvous by leveraging the advantages of both random and
sequence-based CH protocols. Inspired by the neighbor discovery problem, we
establish a design framework of creating a wake-up schedule whereby every CR
follows the sequence-based (or random) CH protocol in the awake (or asleep)
mode. Analytical and simulation results show that the hybrid CH protocols under
this framework are able to achieve a greatly improved average TTR as well as a
low upper-bound of TTR, without sacrificing the rendezvous diversity.Comment: Accepted by IEEE International Conference on Communications (ICC
2015, http://icc2015.ieee-icc.org/
A survey on MAC protocols for complex self-organizing cognitive radio networks
Complex self-organizing cognitive radio (CR) networks serve as a framework for accessing the spectrum allocation dynamically where the vacant channels can be used by CR nodes opportunistically. CR devices must be capable of exploiting spectrum opportunities and exchanging control information over a control channel. Moreover, CR nodes should intelligently coordinate their access between different cognitive radios to avoid collisions on the available spectrum channels and to vacate the channel for the licensed user in timely manner. Since inception of CR technology, several MAC protocols have been designed and developed. This paper surveys the state of the art on tools, technologies and taxonomy of complex self-organizing CR networks. A detailed analysis on CR MAC protocols form part of this paper. We group existing approaches for development of CR MAC protocols and classify them into different categories and provide performance analysis and comparison of different protocols. With our categorization, an easy and concise view of underlying models for development of a CR MAC protocol is provided
Guaranteed Rendezvous for Cognitive Radio Networks Based on Cycle Length
Rendezvous is a fundamental process establishing a communication link on common channel between a pair of nodes in the cognitive radio networks. How to reach rendezvous efficiently and effectively is still an open problem. In this work, we propose a guaranteed cycle lengths based rendezvous (CLR) algorithm for cognitive radio networks. When the cycle lengths of the two nodes are coprime, the rendezvous is guaranteed within one rendezvous period considering the time skew between the two nodes. When Ti and Tj are not coprime, i.e., Ti=Tj, the deadlock checking and node IDs are combined to decide the time point and the way to independently change the cycle length on each node to guarantee rendezvous. In detail, as long as the deadlock situation is detected based on the threshold, each node can independently change its cycle length be based on the current checking bit of the node ID. The threshold used for deadlock checking is defined as the length of the maximum possible rendezvous period between the two nodes. As long as the current checking bits between the two nodes are different, the rendezvous will be reached in the following rendezvous period, The theoretical analysis also proves the guarantee of the CLR algorithm under both the two cases. We use three metrics: success rate of rendezvous, expected time to rendezvous and channel load to conduct simulation studies. The simulation results show that the CLR algorithm always has higher successful rendezvous rate of 100%, and stable and low expected time to rendezvous compared to the HH algorithm. In addition, the channel loads are smoothly distributed on all channels with CLR, while HH algorithm depends on the channels with smaller IDs
ETCH: Efficient Channel Hopping for Communication Rendezvous in Dynamic Spectrum Access Networks
In a dynamic spectrum access (DSA) network, communication rendezvous is the first step for two secondary users to be able to communicate with each other. In this step, the pair of secondary users meet on the same channel, over which they negotiate on the communication parameters, to establish the communication link. This paper presents ETCH, Efficient Channel Hopping based MAC-layer protocols for communication rendezvous in DSA networks. We propose two protocols, SYNC-ETCH and ASYNC-ETCH. Both protocols achieve better time-to-rendezvous and throughput compared to previous work
- …