On transmission scheduling for wireless networks

Boztas, S 2006, 'On transmission scheduling for wireless networks', in Barg & Yeung (ed.) Proceedings of the 2006 IEEE International Symposium on Information Theory, Seattle, USA,, 6-12 July 2006.


Document type: Conference Paper
Collection: Conference Papers

Title On transmission scheduling for wireless networks
Author(s) Boztas, S
Year 2006
Conference name IEEE International Symposium on Information Theory
Conference location Seattle, USA,
Conference dates 6-12 July 2006
Proceedings title Proceedings of the 2006 IEEE International Symposium on Information Theory
Editor(s) Barg & Yeung
Publisher IEEE
Place of publication New Jersey, USA
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
Subjects Computer Communications Networks
DOI - identifier 10.1109/ISIT.2006.261563
Copyright notice © 2006 IEEE
Versions
Version Filter Type
Altmetric details:
Access Statistics: 164 Abstract Views  -  Detailed Statistics
Created: Wed, 08 Apr 2009, 09:42:32 EST by Catalyst Administrator
© 2014 RMIT Research Repository • Powered by Fez SoftwareContact us