2000 character limit reached
Sharing Channel In IEEE 802.16 Using The Cooperative Model Of Slotted ALOHA
Published 5 Jan 2015 in cs.IT, cs.NI, and math.IT | (1501.00923v1)
Abstract: One of the main problems in WIMAX is to share the medium by multiple users who compete for access. Various random access mechanisms, such as ALOHA and its corresponding variations have been widely studied as efficient methods to coordinate the medium access among competing users. In this paper the slotted ALOHA protocol is implemented as a two-state system. Using Markov Models, we evaluate the channel utilization and we analyze the throughput under different fairness conditions. The cooperative team problem is considered.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.