On transmission scheduling for wireless networks

Abstract

In the 1990s Chlamtac and Farago introduced a transmission scheduling (TS) algorithm for wireless networks, called the (proper robust scheduling) PRS algorithm, later generalized to ML-PRS by Boztas to support a set of multipriority users, each with different transmission characteristics. More recently, this concept has been extended to TSMA (time spread multiple access) protocols-TDMA style protocols which are independent of network topology, subject to some global constraints, such as number of users, and maximum degree of the graph representing connectivity of the wireless network. We propose two improvements to TSMA protocols in this paper. The first one uses constant weight codes to reduce PRS framelength. The second one uses the coset structure of Galois fields to improve the ML-PRS algorithm by supporting more lower priority users for roughly comparable framelengt