A channel rendezvous scheme for cognitive radio networks

Authors:
Jongmin Shin;Dongmin Yang;Cheeha Kim
Affiliations:
Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Korea;Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Korea;Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Korea
Venue:
IEEE Communications Letters
Year:
2010

Citing 5
Cited 2

SSCH: slotted seeded channel hopping for capacity improvement in IEEE 802.11 ad-hoc wireless networks

Proceedings of the 10th annual international conference on Mobile computing and networking
Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks

Mobile Networks and Applications
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
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

Neighbor discovery for cognitive radio ad hoc networks

Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Slow hopping based cooperative sensing MAC protocol for cognitive radio networks

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cognitive radio networks need to utilize available spectrum in a dynamic and opportunistic fashion without causing interference to co-located primary nodes. Before data transmission begins, secondary nodes must establish a link on a channel which is not occupied by primary nodes. Unfortunately, in cognitive radio networks, the set of available channels can be different for each node, since it is determined by the relative locations of nodes to primary nodes. We are the first to present a distributed channel rendezvous scheme which finds a commonly available channel between any two nodes in a bounded time without synchronization. Our scheme determines the order, in which two nodes visit channels to find a common channel, if any, within a bounded time.