HEAL DSpace

Efficient location and paging area planning in future cellular systems

Αποθετήριο DSpace/Manakin

Εμφάνιση απλής εγγραφής

dc.contributor.author Demestichas, PP en
dc.contributor.author Demesticha, VP en
dc.contributor.author Tzifa, EC en
dc.contributor.author Kazantzakis, MG en
dc.contributor.author Anagnostou, ME en
dc.date.accessioned 2014-03-01T01:15:34Z
dc.date.available 2014-03-01T01:15:34Z
dc.date.issued 2000 en
dc.identifier.issn 0929-6212 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/13604
dc.subject UMTS en
dc.subject location update en
dc.subject location area en
dc.subject paging en
dc.subject paging area en
dc.subject 0-1 programming en
dc.subject.classification Telecommunications en
dc.title Efficient location and paging area planning in future cellular systems en
heal.type journalArticle en
heal.identifier.primary 10.1023/A:1008821429788 en
heal.identifier.secondary http://dx.doi.org/10.1023/A:1008821429788 en
heal.language English en
heal.publicationDate 2000 en
heal.abstract Efficient resource utilisation in future cellular systems is partly related to the location update and paging operations, which rely on "proper" planning of location and paging areas, and the application of efficient paging schemes. Important is the design of low complexity planning algorithms that may enable the system to dynamically adapt to new traffic and mobility conditions. In this paper we define and solve versions of the location and paging area planning problems focusing also on algorithms that are applicable in real-time. Thus, they can be used to adapt location and paging areas to traffic and mobility conditions. Starting from a formal definition and an optimal formulation, we solve efficiently by means of a low complexity heuristic, a general version of the location area planning problem. Regarding paging area planning, we provide a low complexity algorithm, under the assumption that the scheme applied falls within the last interaction based paging (LIBP) category. The results presented, and the low cost and complexity induced by the proposed schemes, indicates that the real-time application of the schemes is feasible. en
heal.publisher KLUWER ACADEMIC PUBL en
heal.journalName WIRELESS PERSONAL COMMUNICATIONS en
dc.identifier.doi 10.1023/A:1008821429788 en
dc.identifier.isi ISI:000087154600006 en
dc.identifier.volume 12 en
dc.identifier.issue 1 en
dc.identifier.spage 83 en
dc.identifier.epage 109 en


Αρχεία σε αυτό το τεκμήριο

Αρχεία Μέγεθος Μορφότυπο Προβολή

Δεν υπάρχουν αρχεία που σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στην ακόλουθη συλλογή(ές)

Εμφάνιση απλής εγγραφής