The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Combinatorial Designs: Constructions and Analysis
Combinatorial Designs: Constructions and Analysis
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
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
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Handbook of Combinatorial Designs, Second Edition (Discrete Mathematics and Its Applications)
Comparison of Multichannel MAC Protocols
IEEE Transactions on Mobile Computing
Design and performance of an enhanced IEEE 802.11 MAC protocol for multihop coverage extension
IEEE Wireless Communications
Toward secure distributed spectrum sensing in cognitive radio networks
IEEE Communications Magazine
HC-MAC: A Hardware-Constrained Cognitive MAC for Efficient Spectrum Management
IEEE Journal on Selected Areas in Communications
A channel rendezvous scheme for cognitive radio networks
IEEE Communications Letters
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
Thwarting inside jamming attacks on wireless broadcast communications
Proceedings of the fourth ACM conference on Wireless network security
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 survey of common control channel design in cognitive radio networks
Physical Communication
A Cluster-Based MAC Protocol for Cognitive Radio Ad Hoc Networks
Wireless Personal Communications: An International Journal
Neighbor discovery for cognitive radio ad hoc networks
Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication
Journal of Electrical and Computer Engineering - Special issue on Resource Allocation in Communications and Computing
Fast Primary User Detection during Ongoing Opportunistic Transmission in OFDM-based Cognitive Radio
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
Establishing a control channel for medium access control is a challenging problem in multi-channel and dynamic spectrum access (DSA) networks. In the design of multi-channel MAC protocols, the use of channel (or frequency) hopping techniques (a.k.a. parallel rendezvous) have been proposed to avoid the bottleneck of a single control channel. In DSA networks, the dynamic and opportunistic use of the available spectrum requires that the radios are able to "rendezvous" -- i.e., find each other to establish a link. The use of a dedicated global control channel simplifies the rendezvous process but may not be feasible in many opportunistic spectrum sharing scenarios due to the dynamically changing availability of all the channels, including the control channel. To address this problem, researchers have proposed the use of channel hopping protocols for enabling rendezvous in DSA networks. This paper presents a systematic approach, based on quorum systems, for designing and analyzing channel hopping protocols for the purpose of control channel establishment. The proposed approach, called Quorum-based Channel Hopping (QCH) system, can be used for implementing rendezvous protocols in DSA networks that are robust against link breakage caused by the appearance of incumbent user signals. We describe two optimal QCH systems under the assumption of global clock synchronization: the first system is optimal in the sense that it minimizes the time-to-rendezvous between any two channel hopping sequences; the second system is optimal in the sense that it guarantees the even distribution of the rendezvous points in terms of both time and channel, thus solving the \emph{rendezvous convergence} problem. We also propose an asynchronous QCH system that does not require global clock synchronization. Our analytical and simulation results show that the channel hopping schemes designed using our framework outperform existing schemes under various network conditions.