Abstract

Group paging is a baseline solution proposed by the long-term evolution (LTE) standardization body for supporting machine-to-machine (M2M) communications in the current-generation and the next-generation cellular networks. Yet, in conventional group paging scheme, upon the reception of paging message, all machine-type devices (MTDs) in a group will simultaneously access the base station, leading to severe network congestion and intolerably low access efficiency. To handle this issue, in this article, we propose a dynamic group paging mechanism, where only the MTDs with packets to send will join the contention process, and the collisions in the random access channel are addressed by the contention resolution scheme. Explicit expressions of key performance measures including the mean access delay of each MTD are derived as functions of the length of waiting period (interval between two consecutive paging periods) $T_{W}$ , where a smaller $T_{W}$ indicates a higher frequency of group paging. It is shown that $T_{W}$ is a key system parameter that determines the crucial tradeoff between the signaling overheads of the system during the paging period and the access delay performance of each MTD. To study how to properly tune the waiting period length, a utility-based analytical framework is established by taking the aforementioned tradeoff into consideration. The optimal waiting period length for maximizing the network utility is derived and verified by simulation results. The analysis in this article reveals that the network should increase the group paging frequency as the traffic becomes heavier or the number of preambles decreases. Providing more preambles can indeed improve the delay performance, while the gain becomes marginal if the number of preambles is large.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.