Rendezvous mac protocols for use in cognitive radio networks

Silvius, Mark D.; MacKenzie, Allen B.; Bostian, C.W.

doi:10.1109/milcom.2009.5380124

Cited by 9 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Instead, we aimed to evaluate the behavior of two representative algorithms under random primary user activity, a topic which does not show up too often in the literature. For example, neither of the experimental comparisons reported in [17] and [16] accounts for the presence of primary user activity. A comparative analysis that does include primary user activity was presented in [3], where conclusions similar to ours were reached on the basis of simulations, but without a theoretical model.…”

Section: Discussionmentioning

confidence: 99%

The impact of primary user activity on the performance of sequence-based rendezvous

Mišić¹,

Rahman²,

Mišić³

2013

2013 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

Rendezvous in cognitive networks is often conducted using a predefined or adaptive channel hopping sequence, due to the fact that the time to rendezvous in such cases has a finite upper bound. However, random activity of primary users on any of the channels used can destroy a rendezvous. We show that, in the presence of random primary user activity, the time to rendezvous of sequence-based rendezvous techniques becomes a random variable without a finite upper bound.

show abstract

Section: Discussionmentioning

confidence: 99%

The impact of primary user activity on the performance of sequence-based rendezvous

Mišić¹,

Rahman²,

Mišić³

2013

2013 IEEE Global Communications Conference (GLOBECOM)

View full text Add to dashboard Cite

show abstract

“…A similar experiment has been carried out in [15] with a set of four USRP nodes and GNU Radio. The conclusion that has been drawn was that rendezvous was never successful without sending multiple beacons within one slot, no matter how many channels or which transmit probability was used.…”

Section: B Time To Rendezvousmentioning

confidence: 99%

A component-based approach for constructing flexible link-layer protocols

Puschmann

Kalil²,

Mitschele‐Thiel

2013

8th International Conference on Cognitive Radio Oriented Wireless Networks

View full text Add to dashboard Cite

In this paper, we propose a novel approach for constructing flexible link-layer protocols which separate their functionality into multiple components. Our work is motivated by the fact that link-layer protocols are usually implemented as monolithic blocks. This approach limits the possibility of reusing common functions in multiple protocols and also narrows the flexibility of combining existing blocks for creating new protocols. Through flexibly interchangeable components, the proposed architecture addresses these issues. We discuss the design of the architecture and evaluate a prototype that demonstrates cognitive radio functionality such as autonomous link establishment, high-performance spectrum access and selforganized link maintenance after the unexpected arrival of a primary user.Index Terms-Link-layer protocols, component-based design, CR, SDR

show abstract

“…In [56], the multi-channel, asynchronous rendezvous problem is addressed analytically and experimentally with four cognitive radio nodes. The conclusion has been drawn that RDV does not occur for multi-channel cases without slot repetitions for any value of a transmit probability.…”

Section: Channel Hopping Requirements In Crnsmentioning

confidence: 99%

Quorum Systems towards an Asynchronous Communication in Cognitive Radio Networks

Romaszko

Mähönen

2012

Journal of Electrical and Computer Engineering

View full text Add to dashboard Cite

This paper reviews quorum systems (QS) from the perspective of cognitive radio networks. Quorum systems were originally developed for and widely used in the scope of operating systems. Recently, quorum systems have been also started to be applied to wireless communications. The objective of this paper is threefold. First, the paper provides survey and guidance on the use of quorum systems. Second, it shows that QS properties provide an interesting alternative towards an asynchronous communication in cognitive radio ad hoc networks (CRANs). Due to properties of quorum systems it is possible to establish CRANs without employing a common control channel (CCC), perfect synchronization, or central controller architecture. QS properties can be efficiently utilized to handle the rendezvous (RDV) problem in CRANs. New RDV protocols must be designed in such a way that there is a guarantee that all nodes meet periodically within reasonable periods of time. Since pseudorandom solutions do not provide this guarantee, systematic approaches are needed such as QSs. Third, we also propose a novel distributed RDV protocol, MtQS-DSrdv, which is based on mirror torus QS and difference set concepts. The proposed protocol guarantees RDVs on all available channels while CR nodes have the same channel set.

show abstract

Rendezvous mac protocols for use in cognitive radio networks

Cited by 9 publications

References 12 publications

The impact of primary user activity on the performance of sequence-based rendezvous

The impact of primary user activity on the performance of sequence-based rendezvous

A component-based approach for constructing flexible link-layer protocols

Quorum Systems towards an Asynchronous Communication in Cognitive Radio Networks

Contact Info

Product

Resources

About