Blind rendezvous strategies for dynamic spectrum access in multi-channel ad-hoc networks have recently attracted the attention of many researchers. Their work has mostly focused on the design of rendezvous strategies between two network devices which actively try to establish communication. In this paper, we extend the analysis of pair-wise strategies to multi-hop ad-hoc networks and propose strategies to implement rendezvous process in these scenarios. The upper bound of time to rendezvous for multiple users is computationally derived for different network topologies. Analytic results are validated through extensive simulations using state-of-the-art channel hopping sequences.
Vitalio, AR, Ortiz Guerra, E, García Algora, CM, Nowe, A & Steenhaut, K 2016, On the Upper Bound for the Time to Rendezvous in Multi-hop Cognitive Radio Networks. in 2016 IEEE 21st International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD). 2016 edn, vol. I, 10.1109/CAMAD.2016.7790326, IEEE Explore, Toronto, ON, Canada, pp. 31-36, 2016 IEEE 21st International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD), Toronto, Canada, 23/10/16.
Vitalio, A. R., Ortiz Guerra, E., García Algora, C. M., Nowe, A., & Steenhaut, K. (2016). On the Upper Bound for the Time to Rendezvous in Multi-hop Cognitive Radio Networks. In 2016 IEEE 21st International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD) (2016 ed., Vol. I, pp. 31-36). Article 10.1109/CAMAD.2016.7790326 IEEE Explore.
@inproceedings{b365997a1ef042149e99ae1d722d26b9,
title = "On the Upper Bound for the Time to Rendezvous in Multi-hop Cognitive Radio Networks",
abstract = "Blind rendezvous strategies for dynamic spectrum access in multi-channel ad-hoc networks have recently attracted the attention of many researchers. Their work has mostly focused on the design of rendezvous strategies between two network devices which actively try to establish communication. In this paper, we extend the analysis of pair-wise strategies to multi-hop ad-hoc networks and propose strategies to implement rendezvous process in these scenarios. The upper bound of time to rendezvous for multiple users is computationally derived for different network topologies. Analytic results are validated through extensive simulations using state-of-the-art channel hopping sequences.",
keywords = "Cognitive radio networks, blind rendezvous, channel hopping sequences, multi-hop networks",
author = "Vitalio, {Alfonso Reguera} and {Ortiz Guerra}, Erik and {Garc{\'i}a Algora}, {Carlos Manuel} and Ann Nowe and Kris Steenhaut",
year = "2016",
month = oct,
day = "24",
language = "English",
isbn = "978-1-5090-2559-6",
volume = "I",
pages = "31--36",
booktitle = "2016 IEEE 21st International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)",
publisher = "IEEE Explore",
edition = "2016",
note = "2016 IEEE 21st International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD), CAMAD ; Conference date: 23-10-2016 Through 25-10-2016",
url = "https://edas.info/web/ieeecamad2016/index.html",
}