A Framework of Topology-Transparent Scheduling Based on Polynomial Ring

Topology transparent scheduling (TTS) has been widely studied over the last two decades, which provides guaranteed throughput for each node in the network with only knowledge of global parameters. Leveraging different mathematical approaches, the existing TTSs briefly fall into three board categories: 1) the Galois field (GF)-based; 2) the combinatory-based; and 3) the number theory-based schemes. In this letter, a new scheme via the polynomial ring is proposed as a generalization of Chinese remainder theorem (CRT)-based TTS presented recently. It brings significant improvement over the theoretic bounds of both maximum nodal degree supported and frame length required. In addition, we prove that the proposed scheme is also a generic framework of both GF and CRT-based TTS.

[1]  Debarshi Kumar Sanyal,et al.  A Survey of Topology-Transparent Scheduling Schemes in Multi-Hop Packet Radio Networks , 2017, IEEE Communications Surveys & Tutorials.

[2]  Mi Lu,et al.  Topology-transparent time division multiple access broadcast scheduling in multihop packet radio networks , 2003, IEEE Trans. Veh. Technol..

[3]  I. Chlamtac,et al.  Making transmission schedules immune to topology changes in multi-hop packet radio networks , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.

[4]  Yi-Sheng Su,et al.  Topology-Transparent Scheduling via the Chinese Remainder Theorem , 2015, IEEE/ACM Transactions on Networking.

[5]  Lin Zhang,et al.  Is Topology-Transparent Scheduling Really Inefficient in Static Multihop Networks? , 2013, IEEE Wireless Communications Letters.

[6]  Victor O. K. Li,et al.  A Framework for Topology-Transparent Scheduling in Wireless Networks , 2010, 2010 IEEE 71st Vehicular Technology Conference.

[7]  Victor O. K. Li,et al.  An optimal topology-transparent scheduling method in multihop packet radio networks , 1998, TNET.

[8]  Yi-Sheng Su,et al.  A Note on Topology-Transparent Scheduling via the Chinese Remainder Theorem , 2016, IEEE Signal Processing Letters.

[9]  Victor O. K. Li,et al.  TDMA scheduling design of multihop packet radio networks based on latin squares , 1999, IEEE J. Sel. Areas Commun..

[10]  Laurenţiu Panaitopol,et al.  Inequalities concerning the function π(x): Applications , 2000 .

[11]  Charles J. Colbourn,et al.  Cover-Free Families and Topology-Transparent Scheduling for MANETs , 2004, Des. Codes Cryptogr..