In this letter, we construct an asynchronous channel hopping sequence set with new parameters based on disjoint relaxed difference sets. Our proposed design attains the shortest maximum-time-to-rendezvous and maximum-first-time-to-rendezvous in asynchronous cognitive radio wireless networks. Moreover, the channel hopping sequences, with varied lengths, can be tailored to diverse scenarios. The innovative construction ensures rendezvous formation among any sequences, featuring uneven and unexpected rendezvous times. This characteristic contributes to memory conservation in small mobile devices over short durations. In fact, the new construction utilizes fewer licensed channels, enhancing both throughput and reliability.
As a key communication technology in IEEE 802.15.4, Time Slot Channel Hopping (TSCH) enhances transmission reliability and interference immunity by scheduling of time slots and channel assignments. This paper presents a TSCH framework designed to improve packet delivery ratio and anti-interference performance by generating optimal channel hopping sequences that achieve the Lempel-Greenberger bound. The framework employs the Proximal Policy Optimization (PPO) algorithm to predict channel quality, thereby facilitating the selection of higher quality channels in response the dynamic interference changes. Simulation results demonstrate a 7.9% improvement in packet delivery ratio performance compared to previous studies.
The channel-hopping-based rendezvous is essential to alleviate the problem of under-utilization and scarcity of the spectrum in cognitive radio networks. It dynamically allows unlicensed secondary users to schedule rendezvous channels using the assigned hopping sequence to guarantee the self-organization property in a limited time. In this paper, we use the interleaving technique to cleverly construct a set of asynchronous channel-hopping sequences consisting of d sequences of period with flexible parameters, which can generate sequences of different lengths. By this advantage, the new designed CHSs can be used to adapt to the demands of various communication scenarios. Furthermore, we focus on the improved maximum-time-to-rendezvous and maximum-first-time-to-rendezvous performance of the new construction compared to the prior research at the same sequence length. The new channel-hopping sequences ensure that rendezvous occurs between any two sequences and the rendezvous times are random and unpredictable when using licensed channels under asynchronous access, although the full degree-of-rendezvous is not satisfied. Our simulation results show that the new construction is more balanced and unpredictable between the maximum-time-to-rendezvous and the mean and variance of time-to-rendezvous.
16 December 2025 in IEEE Wireless Communications Letters
With the development of the Low-Altitude Aerial Intelligent Network (LAIN), the network imposes stringent demands in terms of spectrum-efficient operation, ultra-low power consumption, enhanced node flexibility, and rapid access latency. The improved channel-hopping-based rendezvous techniques can effectively meet these demands. In this letter, we construct a new class of Asynchronous Asymmetric Channel Hopping Sequence sets with Flexible Lengths (AACHSs-FL). The AACHSs-FL can generate sequences of different lengths to adapt to various network scenarios. Additionally, the AACHSs-FL satisfy even channel use and full Degree-of-Rendezvous, while improving the performance of Maximum Time-to-Rendezvous (MTTR) and Maximum First-Time-to-Rendezvous (MFTTR), thereby enhancing rendezvous efficiency among users. Simulation results show that the MTTR, MFTTR and the TTR variance of the AACHSs-FL outperform most of the existing sequences, thereby significantly improving rendezvous efficiency and better meeting the new requirements of the LAIN.