Benefiting from an induced asynchronism in neighborhood discovery in opportunistic cognitive wireless networks

Authors:
Sylwia Romaszko;Wim Torfs;Petri Mähönen;Chris Blondia
Affiliations:
RWTH Aachen University, Aachen, Germany;University of Antwerp, Antwerpen, Belgium;RWTH Aachen University, Aachen, Germany;University of Antwerp, Antwerpen, Belgium
Venue:
Proceedings of the 11th ACM international symposium on Mobility management and wireless access
Year:
2013

Citing 6
Cited 0

Rendezvous for Cognitive Radios

IEEE Transactions on Mobile Computing
Ring-Walk Based Channel-Hopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks

GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
A multi-channel testbed for dynamic spectrum access (DSA) networks

Proceedings of the 6th ACM workshop on Wireless multimedia networking and computing
COGNITIVE RADIOS FOR DYNAMIC SPECTRUM ACCESS - Dynamic Frequency Hopping Communities for Efficient IEEE 802.22 Operation

IEEE Communications Magazine
Control Channel Establishment in Cognitive Radio Networks using Channel Hopping

IEEE Journal on Selected Areas in Communications
A rendezvous protocol with the heterogeneous spectrum availability analysis for cognitive radio ad hoc networks

Journal of Electrical and Computer Engineering - Special issue on Resource Allocation in Communications and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In opportunistic Cognitive Radio Networks (CRNs), which are characterized by changing network topology, the time and location varying spectrum availability, 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. Therefore, the neighborhood discovery phase, also referred to as a rendezvous (RDV) phase, is challenging due to the dynamics of such networks. Lately, there has been a proliferation of different rendezvous protocols. However, mostly the proposed protocols have had a narrow focus, which is usually a RDV guarantee in a single cycle. At times there is support for a RDV guarantee on every unoccupied channel in a single cycle, however, 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 asynchronism in neighborhood discovery protocols that already guarantee a RDV on each free channel. Thanks to induced asynchronism, the ranking of channels is introduced, allowing nodes to stay longer on better quality channels. We analyze the behavior of three different rendezvous protocols in terms of efficiency and time-to-rendezvous with the measured error margins for different asynchronous offsets. We show that an asynchronism significantly improves the efficiency of all the studied protocols. The goal of this paper is not to proof that one particular protocol is better than another, we aim only to show that the added asynchronism and induced ranking of channels can improve significantly the performance of different rendezvous protocols.