Genetic search for optimal personalized location areas for future PCS networks

• Autorzy: Varadarajan R. , Zheng J. , Regentova E. E.
• Języki publikacji: EN

Abstrakty

EN

In Personal Communication Services (PCS) networks, mobile terminals (MT) are communicating frequently using a variety of services. A high-quality framework is needed for tracking consistently MTs in the system and delivering the services timely. Future PCS networks are expected to have smaller cells to address the transmission power concerns and reuse frequencies efficiently. Thus, MTs are expected to signal even more frequently under always update (AU) strategy adopted in current PCS networks, such as GSM . One pathway for solving the problem is the consideration of Location Areas (LA). The location update takes place only when the MT moves off the area. For call delivery the area is paged. Thus, another signaling component is introduced. In this paper, we propose the design of personalized LA's (PLAs) per an individual user. The model we use takes into account the MT's behavior in the network and the system parameters. The problem is known to be NP-complete of a high computational complexity. We provide a proof of the complexity and solve the problem by using the genetic search for finding a sub-optimal solution. It is shown that the cost of location management under the model and the designed search algorithm can be significantly lower than that consumed by AU mechanism.

Słowa kluczowe

EN

personalized location areas; genetic search; continuous time Markov chain

• Wydawca: Oficyna Wydawnicza Politechniki Wrocławskiej
• Czasopismo: Systems Science
• Rocznik: 2009
• Tom: Vol. 35, no 2
• Strony: 81--88
• Opis fizyczny: Bibliogr. 14 poz., rys., wykr.

Twórcy

autor

Varadarajan R.

autor

Zheng J.

autor

Regentova E. E.

• University of Nevada, Department of Electrical and Computer Engineering, NV 89154 Las Vegas, USA,

Bibliografia

• [1] Abutaleb A., Li V.O.K., Location update optimization in personal communication systems, Wireless Networks, Vol. 3, 1997, pp. 205-216.
• [2] Akyildiz I.F., Ho J.S.M., Lin Y.-B., Movement-based location update and selective paging for PCS networks, IEEE/ACM Trans, on Networking, Vol. 4, 1996, pp. 629-638.
• [3] Bar-Noy A, Kessler I., Sidi M., Mobile users, to update or not to update?, Wireless Networks, Vol. 1,1995, pp. 175-185.
• [4] Blum A.L., Rivest R.L., Training a 3-node neural networks is NP-complete, Neural Networks, Vol. 5, 1992, pp. 117-127.
• [5] Demestichas P., Georgantas N., Tzifa E., Computationally efficient algorithms for location area planning in future cellular systems, Computer Communications, Vol. 23, 2000, pp. 1263-1280.
• [6] John G.H., Kohavi R., Pfleger K., Irrelevant features and the subset selection problem, Proceedings of the Eleventh Inter-national Conference on Machine Learning, 1994, pp. 121-129.
• [7] Lee G., Chen A.L.P., The design of location regions using user movement behaviors in PCS systems, Multimedia Tools and Applications, Vol. 15, 2001, pp. 187-202.
• [8] Reeves C.R., Modern heuristic techniques for combinatorial problems, John Wiley & Sons, INC, 1993.
• [9] Rose C., Minimizing the average cost of paging and registration: a timer-based method, Wireless Networks, Vol. 2, 1996, pp. 109-116.
• [10] Sen S., Bhattacharya A., Das S.K., A selective location update strategy for PCS users, Wireless Networks, Vol. 5, 1999, pp. 313-326.
• [11] Scourias J., Kunz T., A dynamic individual location management algorithm, Proceedings of IEEE International Symposium on Personal, Indoor and Mobile Radio Communications Technical Program, 1997.
• [12] Subrata R., Zomaya A.Y., Dynamic location management for mobile computing, Telecommunication Systems, Vol. 22, 2003, pp. 169-187.
• [13] Tabbane S., Location management methods for third generation mobile systems, IEEE Communication Mag., Vol. 35, 1997, pp. 72-78, 83-84.
• [14] Wong V., Leung V.C.M., An adaptive distance-based location update algorithm for next-generation PCS networks, IEEE Journal on Select. Areas Commun., Vol. 19, 2001, pp. 1942-1952.