@inproceedings{bca25a8a23fe4223a3caca01c08d7292,
title = "Revisiting the performance of the modular clock algorithm for distributed blind rendezvous in cognitive radio networks",
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-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.",
author = "Michel Barbeau and Gimer Cervera and Joaquin Garcia-Alfaro and Evangelos Kranakis",
year = "2014",
month = jan,
day = "1",
doi = "10.1007/978-3-319-07425-2\_15",
language = "English",
isbn = "9783319074245",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "197--208",
booktitle = "Ad-hoc, Mobile, and Wireless Networks - 13th International Conference, ADHOC-NOW 2014, Proceedings",
note = "13th International Conference on Ad-Hoc Networks and Wireless, ADHOC-NOW 2014 ; Conference date: 22-06-2014 Through 27-06-2014",
}