Probability criterion paging area planning in future mobile communications systems

Kazantzakis, MG; Koukoutsidis, IZ; Demestichas, PP; Theologou, ME

dc.contributor.author	Kazantzakis, MG	en
dc.contributor.author	Koukoutsidis, IZ	en
dc.contributor.author	Demestichas, PP	en
dc.contributor.author	Theologou, ME	en
dc.date.accessioned	2014-03-01T01:21:15Z
dc.date.available	2014-03-01T01:21:15Z
dc.date.issued	2004	en
dc.identifier.issn	0140-3664	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/16160
dc.subject	Mobile network	en
dc.subject	Paging areas	en
dc.subject	Planning algorithm	en
dc.subject	Probability of location	en
dc.subject	Signaling load decrease	en
dc.subject.classification	Computer Science, Information Systems	en
dc.subject.classification	Engineering, Electrical & Electronic	en
dc.subject.classification	Telecommunications	en
dc.subject.other	Algorithms	en
dc.subject.other	Channel capacity	en
dc.subject.other	Multimedia systems	en
dc.subject.other	Problem solving	en
dc.subject.other	Telecommunication networks	en
dc.subject.other	Virtual storage	en
dc.subject.other	Mobile networks	en
dc.subject.other	Paging areas	en
dc.subject.other	Planning algorithms	en
dc.subject.other	Probability of location	en
dc.subject.other	Signaling load decrease	en
dc.subject.other	Mobile telecommunication systems	en
dc.title	Probability criterion paging area planning in future mobile communications systems	en
heal.type	journalArticle	en
heal.identifier.primary	10.1016/j.comcom.2003.12.003	en
heal.identifier.secondary	http://dx.doi.org/10.1016/j.comcom.2003.12.003	en
heal.language	English	en
heal.publicationDate	2004	en
heal.abstract	Future mobile telecommunications systems are obligated to offer advanced multimedia services to a huge number of users. The burden imposed by the signaling operations supporting these services can severely degrade the system performance and lead to congestion problems in network equipment (switches, databases, gateways, etc.). Paging operations in a mobile cellular network are responsible for a large part of the signaling load and, therefore, the issue of how to efficiently conduct them becomes of critical importance. The key to its solution lies on the application of multiple step paging schemes and on the 'proper' planning of paging areas (PAs). In this paper, we devise and solve a version of the PA-planning problem. In particular, we provide a low complexity probabilistic algorithm capable of reducing paging costs. To improve performance, the algorithm uses additional information regarding the locations of last user-network interactions. Numerical results show that significant savings can be achieved compared to a conventional paging scheme. (C) 2004 Elsevier B.V. All rights reserved.	en
heal.publisher	ELSEVIER SCIENCE BV	en
heal.journalName	Computer Communications	en
dc.identifier.doi	10.1016/j.comcom.2003.12.003	en
dc.identifier.isi	ISI:000220680300002	en
dc.identifier.volume	27	en
dc.identifier.issue	7	en
dc.identifier.spage	581	en
dc.identifier.epage	588	en