Ring-Walk Based Channel-Hopping Algorithms with Guaranteed Rendezvous for Cognitive Radio Networks

Authors:
Hai Liu;Zhiyong Lin;Xiaowen Chu;Yiu-Wing Leung
Affiliations:
-;-;-;-
Venue:
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
Year:
2010

Citing 8
Cited 3

DIMSUMNet: New Directions in Wireless Networking Using Coordinated Dynamic Spectrum Access

WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
A quorum-based framework for establishing control channels in dynamic spectrum access networks

Proceedings of the 15th annual international conference on Mobile computing and networking
Distributed Coordination Protocol for Common Control Channel Selection in Multichannel Ad-Hoc Cognitive Radio Networks

WIMOB '09 Proceedings of the 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Spectrum opportunity-based control channel assignment in cognitive radio networks

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Common control channel design for cognitive radio wireless ad hoc networks using adaptive frequency hopping

Ad Hoc Networks
Rendezvous for Cognitive Radios

IEEE Transactions on Mobile Computing
HC-MAC: A Hardware-Constrained Cognitive MAC for Efficient Spectrum Management

IEEE Journal on Selected Areas in Communications

Quorum-based channel allocation with asymmetric channel view in cognitive radio networks

Proceedings of the 6th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
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
Benefiting from an induced asynchronism in neighborhood discovery in opportunistic cognitive wireless networks

Proceedings of the 11th ACM international symposium on Mobility management and wireless access

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rendezvous is a fundamental and essential operation for users of cognitive radio networks (CRNs) to meet and establish a link on a common channel, so that information exchange and data communication can be carried on. This work addresses the problem of blind rendezvous, i.e., rendezvous without the help of any central controller and dedicated common control channel. We propose two ring-walk (RW) based channel-hopping (CH) algorithms. The basic idea is to represent each channel as a vertex in a ring. Users "walk" on the ring by visiting vertices of channels with different velocities. Rendezvous is achievable since the user with lower velocity will eventually be "caught" by the user with higher velocity. Compared with the existing solutions, our algorithms achieve the following advances: i) guaranteed rendezvous without the need of time-synchronization, ii) applicability to rendezvous of multi-user and multi-hop scenarios. We derive the maximum time-to-rendezvous (TTR) and the expected TTR of our algorithms in both 2-user and multi-user scenarios (shown in Table I). Simulation results show superior performance of our algorithms.