On Transmission Scheduling in Wireless Networks

Author

Boztas, Serdar

Author_Institution

Sch. of Math. & Geospatial Sci., RMIT Univ., Melbourne, Vic.

fYear

2006

fDate

9-14 July 2006

Firstpage

2754

Lastpage

2758

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 framelength

Keywords

Galois fields; protocols; radio networks; scheduling; telecommunication network topology; time division multiple access; Galois fields; TDMA protocols; network topology; proper robust scheduling; time spread multiple access protocols; transmission scheduling; wireless networks; Access protocols; Australia; Broadcasting; Galois fields; Network topology; Robustness; Scheduling algorithm; USA Councils; Wireless application protocol; Wireless networks;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 2006 IEEE International Symposium on

Conference_Location

Seattle, WA

Print_ISBN

1-4244-0505-X

Electronic_ISBN

1-4244-0504-1

Type

conf

DOI

10.1109/ISIT.2006.261563

Filename

4036474