Last interaction based paging in mobile cellular networks

Koukoutsidis, IZ; Theologou, ME

dc.contributor.author	Koukoutsidis, IZ	en
dc.contributor.author	Theologou, ME	en
dc.date.accessioned	2014-03-01T01:19:06Z
dc.date.available	2014-03-01T01:19:06Z
dc.date.issued	2003	en
dc.identifier.issn	0302-9743	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/15378
dc.subject	Cellular Network	en
dc.subject	Cost Effectiveness	en
dc.subject	Delay Bound	en
dc.subject	Location Area	en
dc.subject	Mobile Environment	en
dc.subject	Mobile Network	en
dc.subject.classification	Computer Science, Theory & Methods	en
dc.title	Last interaction based paging in mobile cellular networks	en
heal.type	journalArticle	en
heal.identifier.primary	10.1007/978-3-540-39867-7_52	en
heal.identifier.secondary	http://dx.doi.org/10.1007/978-3-540-39867-7_52	en
heal.language	English	en
heal.publicationDate	2003	en
heal.abstract	In a mobile network, the paging operation is used to indicate the subscriber's position in order to establish a connection with another user, calling from a fixed or mobile environment. The currently employed scheme, blanket paging, incurs a significant cost in radio bandwidth utilization and is cost-effective only in small networks. In this paper, we introduce a new strategy that combines an optimal partitioning of the location area with a model to predict user movements, based on the additional information of the cell where the last interaction between the network and the terminal took place. We study the performance of the strategy under delay bounds and different mobility and call arrival characteristics. It is found that the new scheme further minimizes signaling costs and enhances previous sequential paging algorithms. © IFIP International Federation for Information Processing 2003.	en
heal.publisher	SPRINGER-VERLAG BERLIN	en
heal.journalName	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)	en
heal.bookName	LECTURE NOTES IN COMPUTER SCIENCE	en
dc.identifier.doi	10.1007/978-3-540-39867-7_52	en
dc.identifier.isi	ISI:000187294600052	en
dc.identifier.volume	2775	en
dc.identifier.spage	526	en
dc.identifier.epage	540	en