Random access with adaptive packet aggregation in LTE/LTE-A

Zhou, Kaijie; Nikaein, Navid
EURASIP Journal on Wireless Communications and Networking 2016, 2016:36

While random access presents a promising solution for efficient uplink channel access, the preamble collision rate can significantly increase when massive number of devices simultaneously access the channel. To address this issue and improve the reliability of the random access, an adaptive packet aggregation method is proposed. With the proposed method, a device does not trigger a random access for every single packet. Instead, it starts a random access when the number of aggregated packets reaches a given threshold. This method reduces the packet collision rate at the expense of an extra latency, which is used to accumulate multiple packets into a single transmission unit. Therefore, the tradeoff between packet loss rate and channel access latency has to be carefully selected. We use semi-Markov model to derive the packet loss rate and channel access latency as functions of packet aggregation number. Hence, the optimal amount of aggregated packets can be found, which keeps the loss rate below the desired value while minimizing the access latency. We also apply for the idea of packet aggregation for power saving, where a device aggregates as many packets as possible until the latency constraint is reached. Simulations are carried out to evaluate our methods. We find that the packet loss rate and/or power consumption are significantly reduced with the proposed method.       


DOI
Type:
Journal
Date:
2016-02-03
Department:
Communication systems
Eurecom Ref:
4819
Copyright:
© EURASIP. Personal use of this material is permitted. The definitive version of this paper was published in EURASIP Journal on Wireless Communications and Networking 2016, 2016:36 and is available at : http://dx.doi.org/10.1186/s13638-016-0531-6

PERMALINK : https://www.eurecom.fr/publication/4819