Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Enhancing Cellular M2M Random Access with Binary Countdown Contention Resolution (1708.02808v2)

Published 9 Aug 2017 in cs.NI, cs.IT, and math.IT

Abstract: Accommodating Machine-to-Machine applications and their requirements is one of the challenges on the way from LTE towards 5G networks. The envisioned high density of devices, alongside with their sporadic and synchronized transmission patterns, might create signaling storms and overload in the current LTE network. Here, we address the notorious random access (RA) challenge, namely, scalability of the radio link connection establishment protocol in LTE networks. We revisit the binary countdown technique for contention resolution (BCCR), and apply it to the LTE RA procedure. We analytically investigate the performance gains and trade-offs of applying BCCR in LTE. We further simulatively compare BCCR RA with the state-of-the-art RA techniques, and demonstrate its advantages in terms of delay and throughput.

Citations (8)

Summary

We haven't generated a summary for this paper yet.