Publications:Distributed Queue Random Multiple Access Algorithm for Centralized Data Networks

From CERES
Jump to: navigation, search

Do not edit this section

Keep all hand-made modifications below

Title Distributed Queue Random Multiple Access Algorithm for Centralized Data Networks
Author Vladimir Kobliakov and Andrey Turlikov and Alexey Vinel
Year 2006
PublicationType Conference Paper
Journal
HostPublication Consumer Electronics, 2006. ISCE '06. 2006 IEEE Tenth International Symposium on
DOI http://dx.doi.org/10.1109/ISCE.2006.1689519
Conference 10th IEEE International Symposium on Consumer Electronics (ISCE 2006), St Petersburg, RUSSIA, JUN 28-JUL 01, 2006
Diva url http://hh.diva-portal.org/smash/record.jsf?searchId=1&pid=diva2:587646
Abstract The development of efficient media access control protocols for new generation networks, such as IEEE 802.16 metropolitan wireless system, is a challenging task nowadays. The problem of designing an efficient random multiple access algorithm for centralized data network, where subscriber stations transmit bandwidth requests to the base station in an uplink channel, is a focus of the paper. For this purpose special model for a centralized network is considered and new random multiple access algorithm is developed and analyzed. This algorithm, further referred to as distributed queue algorithm (multi-FS-ALOHA), is shown to provide higher tenacity and lower mean delay for the request transmission in comparison to binary exponential backoff, standardized in IEEE 802.16, as well as FS-ALOHA it is based on. Optimization of parameters for the developed algorithm is fulfilled; impact of the noise on its performance is investigated. The analysis is conducted by means of both analytical techniques and simulations