On the Upper Bound for the Time to Rendezvous in Multi-hop Cognitive Radio Networks

Alfonso Reguera Vitalio, Erik Ortiz Guerra, Carlos Manuel García Algora, Ann Nowe, Kris Steenhaut

Onderzoeksoutput: Conference paper

6 Citaten (Scopus)

Samenvatting

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.
Originele taal-2English
Titel2016 IEEE 21st International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)
Plaats van productieToronto, ON, Canada
UitgeverijIEEE Explore
Pagina's31-36
Aantal pagina's7
VolumeI
Uitgave2016
ISBN van elektronische versie978-1-5090-2558-9
ISBN van geprinte versie978-1-5090-2559-6
StatusPublished - 24 okt 2016
Evenement2016 IEEE 21st International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD) - Ryerson University, Toronto, Canada
Duur: 23 okt 201625 okt 2016
Congresnummer: 21
https://edas.info/web/ieeecamad2016/index.html

Conference

Conference2016 IEEE 21st International Workshop on Computer Aided Modelling and Design of Communication Links and Networks (CAMAD)
Verkorte titelCAMAD
Land/RegioCanada
StadToronto
Periode23/10/1625/10/16
Internet adres

Vingerafdruk

Duik in de onderzoeksthema's van 'On the Upper Bound for the Time to Rendezvous in Multi-hop Cognitive Radio Networks'. Samen vormen ze een unieke vingerafdruk.

Citeer dit