A Note on Topology-Transparent Scheduling via the Chinese Remainder Theorem

Topology-transparent scheduling (TTS) via the Chinese remainder theorem (CRT) has succeeded in providing guaranteed collision-free transmissions in each schedule without the need to know the maximum nodal degree of the graph representing connectivity of a mobile ad hoc network. Its main limitation is due to the restriction on the moduli imposed by the CRT. To address the shortcoming, this letter proposes an application of the general Chinese remainder theorem (GCRT) to TTS, which provides a unified framework for TTS that is developed via the CRT. The proposed GCRT-based scheme not only employs integer sequences to form the moduli, but also repeats the moduli to enhance TTS via the CRT. To determine how to repeat moduli in a systematic way, this letter formulates an integer programming problem, which is solved by the branch-and-bound technique. Numerical results are presented, demonstrating that the proposed GCRT-based scheme outperforms earlier works with much shorter schedule lengths.