A Hierarchical Time-Slot-Preamble Table Method for Random Access

Due to massive concurrent access requests generated by the continually growing number of devices, the existing contention-based random access (RA) technology suffer from the severe problem of random access channel (RACH) congestion in wireless network. In some situation, the devices receive some messages collected by sensors. If the message contains data which exceeds the threshold value, the devices must send them in time. We refer to the devices requiring emergency transmission as high-priority devices. In this paper, we proposes hierarchical time-slot-preamble table method (called hierarchical L method for convenience) to guarantee the successful access rate of high-priority devices in random access of wireless communication networks. The special need of high-priority device is fully considered in hierarchical L method. By improving the access process, it reduces the waiting time and cumbersome operation steps for high-priority devices, effectively enhancing access efficiency. Meanwhile, we have strengthened technical support and safeguard measures for high-priority devices to ensure that high-priority information (emergency information) can be sent smoothly and efficiently. These improvement measures not only enhance user experience but also provide strong support for information transmission in wireless communication networks in emergency situations.