User Informatics Optimized Search and Retrieval-Congestion Avoidance Scheme for 4G Networks


The objective of 4G network is to provide best services to the users which in turn made the performance of existing network more critical. Further, the large traffic generated in such networks creates congestion resulting in overloading of the system. Frequent delays, loss of packets, and in addition the number of retransmission/paging also increases the computational cost of the system. This paper proposes a novel way to reduce overloading and retrieval mechanism for VLR through optimized search, based on the information of users mobility pattern (User profiles based (UPB)) to track the user. This not only improves the overall performance of the system, especially in the events when the visitor location register (VLR) is overloaded due to heavy traffic and congestion of the network. It was also established through simulation studies that the proposed UPB scheme optimizes the search and reduces the average waiting time in a queue. In addition, the provision of VLRW (waiting visitor location register) avoids the overloading of main VLR and provides a recovery/retrieval mechanism for VLR failure.

Share and Cite:

P. Pushpa, S. Sneha and R. Agrawal, "User Informatics Optimized Search and Retrieval-Congestion Avoidance Scheme for 4G Networks," Communications and Network, Vol. 4 No. 3, 2012, pp. 219-226. doi: 10.4236/cn.2012.43026.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] Y.-B. Lin and I. Climatic, “Wireless and Mobile Network Architecture,” John Wiley& Sons, New York, 2000.
[2] W. Stallings, “Wireless Communications and Networks,” Prentice Hall, Upper Saddle River, 2001, pp. 291-297.
[3] A. Sehgal and R. Agrawal, “QoS Based Network Selection Scheme for 4G Systems,” IEEE Transactions on Consumer Electronics, Vol. 56, No. 2, 2010, pp. 560-565. doi:10.1109/TCE.2010.5505970
[4] M. L. Roberts, et al., “Evolution of the Air Interface of Cellular Communications Systems toward 4G Realization,” IEEE Communications Surveys and Tutorials, Vol. 8, No. 1, 2006, pp. 2-23. doi:10.1109/COMST.2006.323439
[5] H. Abu-Ghazaleh and A. S. Alfa, “Application of Mobility Prediction in Wireless Networks Using Markov Renewal Theory,” IEEE Transactions on Vehicular Technology, Vol. 59, No. 2, 2010, pp. 788-802. doi:10.1109/TVT.2009.2037507
[6] M.-H. Jin, J.-T. Horng, M.-F. Tsai, E. H.-K. Wu and Eric H.-K. Wu, “Location Query Based on Moving Behaviors,” Information Systems, Vol. 32, No. 3, 2007, pp. 385-401. doi:10.1016/
[7] J.-W. Lin and M.-F. Yang, “Dependable Public Wireless LANs without Hardware Support,” Fourth Annual ACIS International Conference on Computer and Information Science, Washington DC, 2005, pp. 628-633.
[8] M. H. Sun and D. M. Blough, “Mobility Prediction Using Future Knowledge,” Proceedings of the 10th ACM Symposium on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, New York, 2007, pp. 235-239.
[9] V. Bharghavan and M. Jayanth, “Profile Based Next-Cell Prediction in Indoor Wireless LAN,” Proceedings of IEEE SICON’97, April 1997.
[10] R. Vaidya, C. Yadav, J. Kunkumath and P. Yadati, “Network Congestion Control: Mechanisms for Congestion Avoidance and Recovery,” Proceedings of the 1st International Conference on Wireless Technologies for Humanitarian Relief, New York, 2011, pp. 199-207.
[11] K. S. Trivedi, “Probability & Statistics with Reliability, Queuing and Computer Science Applications,” 8th Edition, John Wiley& Sons, New York, 1999, pp. 309-359.
[12] Pushpa, A. Sehgal and R. Agrawal, “New Handover Scheme Based on User Profile: A Comparative Study,” Second International Conference on Communication Software and Networks, 26-28 February 2010, pp. 18-21. doi:10.1109/ICCSN.2010.102
[13] J.-W. Lee, “Broadcasting Scheme for Location Management in Mobile Networks,” International Journal of Software Engineering and Its Application, Vol. 2, No. 1, 2010, pp. 11-20.

Copyright © 2023 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.