Experimental comparison of blind rendezvous algorithms for tactical networks

Robertson, Andrew; Tran, Lan; Molnár, Joséph; Fu, Er-Hsien Frank

doi:10.1109/wowmom.2012.6263760

Cited by 15 publications

(9 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yang et al have proposed an algorithm based on the k-shift-invariant concept that guarantees rendezvous [15]. Evaluations of the modular clock and random algorithms have been conducted by Robertson et al using the GNU radio framework [16].…”

Section: B Related Workmentioning

confidence: 99%

A new analysis of the cognitive radio jump-stay algorithm under the asymmetric model

Barbeau

Cervera

García-Alfaro

et al. 2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

International audienceUnder use of the regulated radio spectrum is being addressed using a cognitive radio network approach termed dynamic spectrum access. Primary users have priority over the regulated radio spectrum. Secondary users may use the residual air time. We focus on the problem of meeting on a common channel by a group of secondary users. Under the asymmetric model, the secondary users have different sets of available channels. If the sets are not disjoint, they can eventually make rendezvous. The goal is to make the secondary users rendezvous on a common channel in a minimum amount of time. The jump-stay rendezvous algorithm has been created by Lin et al. to solve this problem. We develop a new analysis for the two-user expected time to rendezvous in the jump-stay rendezvous algorithm, under the asymmetric model, that better reflects its performanc

show abstract

Section: B Related Workmentioning

confidence: 99%

A new analysis of the cognitive radio jump-stay algorithm under the asymmetric model

Barbeau

Cervera

García-Alfaro

et al. 2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

show abstract

“…In both cases, the generated sequences of p channels share the same aforementioned mathematical properties. Practical evaluations of the modular clock and random algorithms have been conducted by Robertson et al using the GNU radio framework [15].…”

Section: Related Workmentioning

confidence: 99%

Revisiting the Performance of the Modular Clock Algorithm for Distributed Blind Rendezvous in Cognitive Radio Networks

Barbeau

Cervera

García-Alfaro

et al. 2014

Ad-Hoc, Mobile, and Wireless Networks

View full text Add to dashboard Cite

Abstract. We reexamine the modular clock algorithm for distributed blind rendezvous in cognitive radio networks. It proceeds in rounds. Each round consists of scanning twice a block of generated channels. The modular clock algorithm inspired the creation of the jump-stay rendezvous algorithm. It augments the modular clock with a stay-on-onechannel pattern. This enhancement guarantees rendezvous in one round. We make the observation that as the number of channels increases, the significance of the stay-on-one-channel pattern decreases. We revisit the performance analysis of the two-user symmetric case of the modular clock algorithm. We compare its performance with a random and the jump-stay rendezvous algorithms. Let m be the number of channels. Let p be the smallest prime number greater than m. The expected timeto-rendezvous of the random and jump-stay algorithms are m and p, respectively. Theis et al.'s analysis of the modular clock algorithm concludes a maximum expected time-to-rendezvous slightly larger than 2p time slots. Our analysis shows that the expected time-to-rendezvous of the modular clock algorithm is no more than 3p/4 time slots.

show abstract

“…The CR nodes continuously "jump" on available channels during the jump-pattern and "stay" on a specific channel during the stay-pattern. In the recent study on the blind rendezvous for tactical networks [17], the performances of the MMC [6] and Random Channel Access (RA) [18] algorithms are compared on a testbed using USRP [19]. It is found out that added asynchronization can have a large beneficial effects reducing time to rendezvous.…”

Section: Related Workmentioning

confidence: 99%

Asynchronous Rendezvous Protocol for Cognitive Radio Ad Hoc Networks

et al. 2013

View full text Add to dashboard Cite

Abstract. This paper proposes a rendezvous protocol for Cognitive Radio Ad Hoc Networks, RAC 2 E-gQS, which (1) utilizes the asynchronous and randomness properties of the RAC 2 E protocol and (2) grid Quorum System-based channel mapping (gQ-RDV) protocol taking into account channel heterogeneity. We show that the combination of the RAC 2 E protocol with the grid-quorum based channel mapping can yield a powerful RAC 2 E-gQS rendezvous protocol for asynchronous operation in a distributed environment assuring a rapid rendezvous between the cognitive radio nodes.

show abstract

Experimental comparison of blind rendezvous algorithms for tactical networks

Cited by 15 publications

References 13 publications

A new analysis of the cognitive radio jump-stay algorithm under the asymmetric model

A new analysis of the cognitive radio jump-stay algorithm under the asymmetric model

Revisiting the Performance of the Modular Clock Algorithm for Distributed Blind Rendezvous in Cognitive Radio Networks

Asynchronous Rendezvous Protocol for Cognitive Radio Ad Hoc Networks

Contact Info

Product

Resources

About