Revisiting the performance of the modular clock algorithm for distributed blind rendezvous in cognitive radio networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Revisiting the performance of the modular clock algorithm for distributed blind rendezvous in cognitive radio networks

Résumé

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-one-channel 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 time-to-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
Fichier principal
Vignette du fichier
preprint_adhocnow14.pdf (490.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01264803 , version 1 (29-01-2016)

Identifiants

Citer

Michel Barbeau, Gimer Cervera, Joaquin Garcia-Alfaro, Evangelos Kranakis. Revisiting the performance of the modular clock algorithm for distributed blind rendezvous in cognitive radio networks. ADHOC-NOW 2014 : 13th International Conference on Ad-Hoc Networks and Wireless , Jun 2014, Benidorm, Spain. pp.197 - 208, ⟨10.1007/978-3-319-07425-2_15⟩. ⟨hal-01264803⟩
84 Consultations
87 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More