Abstract
AbstractThis paper is concerned with the backoff algorithm for a random access system on the basis of slotted ALOHA. The performance of the algorithm in which the backoff counter is reset after the packet transmission success (conventional scheme), and the performance of the algorithm in which the backoff counter is successively decremented (modified scheme), are analyzed for the unsaturated condition. Based on the concept of equilibrium point analysis, the packet transmission failure probability, the throughput, the average transmission delay, and the uniformity of the transmission delay variation are evaluated. It is shown by a numerical example that the modified scheme exhibits better performance than the conventional scheme, even in the unsaturated condition, as well as in the saturated condition, with appropriate setting of the backoff window width. In addition, the modified scheme is shown to be better from the viewpoint of uniformity, in the sense that the packet transmission delay variation is smaller, even if the parameters are set to values that degrade the throughput. © 2004 Wiley Periodicals, Inc. Electron Comm Jpn Pt 1, 88(4): 32–43, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecja.20176
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Electronics and Communications in Japan (Part I: Communications)
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
