Title: How to be an efficient asynchronous neighbourhood discovery protocol in opportunistic cognitive wireless networks
Authors: Sylwia Romaszko; Wim Torfs; Petri Mähönen; Chris Blondia
Addresses: Institute for Networked Systems, RWTH Aachen University, Kackertstrasse 9, 52072 Aachen, Germany ' MOSAIC – University of Antwerp, iMinds, Middelheimlaan 1, 2020 Antwerpen, Belgium ' Institute for Networked Systems, RWTH Aachen University, Kackertstrasse 9, 52072 Aachen, Germany ' MOSAIC – University of Antwerp, iMinds, Middelheimlaan 1, 2020 Antwerpen, Belgium
Abstract: In opportunistic cognitive radio networks (CRNs) there is a need of on-demand searching for a control traffic channel by cognitive radio (CR) users in order to be able to initiate a communication. The neighbourhood discovery (ND) phase is challenging due to the dynamics of such networks. Lately, there has been a proliferation of different RDV protocols. However, most protocols have a narrow focus, which is usually a RDV guarantee in a single cycle. Very rarely asynchronism is exploited as a main factor, or considering channel heterogeneity in terms of quality. In this study we show how to add and benefit from an asynchronous RDV extension and its enhancement. Thanks to induced asynchronism, the ranking of channels is introduced, allowing nodes to stay longer on better quality channels. We analyse the behaviour of different selected ND protocols in terms of time-to-rendezvous and normalised RDV. We show that an asynchronism significantly improves the efficiency of the studied protocols.
Keywords: asynchronous; channel hopping; channel ranking; CRNs; cognitive radio networks; neighbourhood discovery; rendezvous; neighbourhood discovery protocol; opportunistic networks.
International Journal of Ad Hoc and Ubiquitous Computing, 2015 Vol.20 No.3, pp.199 - 209
Available online: 26 Nov 2015 *Full-text access for editors Access for subscribers Purchase this article Comment on this article