Channel-Hopping Sequences for Small-Cell Cognitive-Radio Wireless Networks

In this paper, an algebraic construction of channel-hopping (CH) sequences for "small-cell" cognitive-radio wireless networks (CRWNs) is introduced. By applying linear- and quadratic-congruence operators in the finite field, multiple sets of CH sequences can be created quickly without complex algorithms or exhaustive computer searches. Every set carries desired properties, such as enlarged cardinality, full degree-of-rendezvous, and short maximum-time-to-rendezvous, that can enhance spectral efficiency and spectrum utilization. Thus, they can be used to support many Internet-of-thing (IoT) devices with good media-access latency and fairness in small-cell CRWNs. The studies of rendezvous-success rate and throughput show that this algebraic construction carries the best balance between the desired properties and performance than other constructions.