A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Advanced Concepts in Operating Systems
Advanced Concepts in Operating Systems
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Quorum-based asynchronous power-saving protocols for IEEE 802.11 ad hoc networks
Mobile Networks and Applications
An Adaptive Quorum-Based Energy Conserving Protocol for IEEE 802.11 Ad Hoc Networks
IEEE Transactions on Mobile Computing
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
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
Journal of Electrical and Computer Engineering - Special issue on Resource Allocation in Communications and Computing
Hi-index | 0.00 |
In this paper we study a novel distributed rendezvous protocol for cognitive radio networks (CRNs), which is based on a grid quorum system, hence we call it the gQ-RDV protocol. A paper tackles with an asymmetric channel view problem rarely investigated due to its complexity. Hence, the objective of the paper is twofold. Different grid-based quorum arrangements are proposed and investigated in order to find the best approach to ensure a very high probability of nodes' rendezvous, while having a different number of available channels in the list. Second, we propose channel mapping methods based on a grid quorum and sub-grids dealing with the asymmetric channel view. Each node visits channels according to its channel map and without exchange of any information, which reduces signaling overhead.