Abstract
Group paging (GP) is an effective way to solve the serious congestion problem. Congestion problem usually is caused by lots of machine-type communication (MTC) devices communicating at the same time. A certain number of MTC devices in each time slot is been activated, and the number of MTC devices can achieve the maximum of resource utilization. First of all, the total number of MTC devices in each time slot should be calculated according to the different new arrivals in each time slot. By making the resources utilization maximum, the optimal number of total MTC devices can be obtained, from which the optimal number of arriving MTC devices in each time slot will be get. To estimate the total number of MTC devices for traffic scattering GP, a Fast Group Paging Algorithm (FGPA) is proposed, which aims to improve the performance of GP under the condition of massive MTC devices. FGPA is an iterative algorithm that converges fast and has low arithmetic complexity. The corresponding simulation results demonstrate that the proposed FGPA requires less number of iterations under the condition of the same estimation results of total number of MTC devices compared with the existing iterative algorithm.
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 callDisclaimer: 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.
