Steiner system-based topology-transparent priority scheduling for wireless ad hoc networks

Topology‐transparent scheduling (TTS) for wireless networks involves generation of schedules which do not need update even when the network topology is constantly changing. TTS schemes designed with Steiner systems support the largest number of nodes—among all cover‐free families—for a given frame length. In this paper, we propose a TTS scheme using Steiner systems for a network in which nodes are divided into multiple classes of different...