查看文章

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 priorities. Our proposed scheme called “Steiner system‐based Topology‐transparent Priority Scheduling” (STPS) produces priority‐sensitive schedules using different Steiner systems for the different priority classes. We explain our proposed method through illustrative examples and show its superiority over a competitive scheme in the literature with respect to the frame length.