Highly Adaptive and scalable random access based on idle-time

Abstract

New idle-time based random access scheme, Adaptive p-persistent, is proposed for super dense wireless networks. By utilizing idle-time information, Adaptive p-persistent scheme is designed to be not only scalable to support massive number of devices but also adaptive to dynamically changing traffic load; each device updates its persistent level p every time it receives or overhears a new packet based on reference inter-arrival time and persistent level p of overhearing neighbors. We present the simulation results comparing Adaptive p-persistent scheme to the existing random access schemes, BEB, EIED and i-EIED. The simulation study confirms that both idle-time based random access schemes, Adaptive p-persistent and i-EIED, are highly scalable. Furthermore, it verifies that the newly proposed Adaptive p-persistent scheme is exceptionally adaptive. This adaptability of Adaptive p-persistent scheme comes from not only its instantaneous updating rule but also its prompt application to the current transmission.