Computationally efficient algorithms for location area planning in future cellular systems

Efficient resource utilisation in future cellular systems is related to the control of the signalling load imposed by the location update and paging operations. Important means for controlling this load is the “proper” planning of location areas. In this paper we define and solve a version of the lo...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computer communications 2000-07, Vol.23 (13), p.1263-1280
Hauptverfasser: Demestichas, P., Georgantas, N., Tzifa, E., Demesticha, V., Striki, M., Kilanioti, M., Theologou, M.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1280
container_issue 13
container_start_page 1263
container_title Computer communications
container_volume 23
creator Demestichas, P.
Georgantas, N.
Tzifa, E.
Demesticha, V.
Striki, M.
Kilanioti, M.
Theologou, M.
description Efficient resource utilisation in future cellular systems is related to the control of the signalling load imposed by the location update and paging operations. Important means for controlling this load is the “proper” planning of location areas. In this paper we define and solve a version of the location area planning problem. Starting from a formal definition and an optimal formulation of the problem, three computationally efficient algorithms, adhering to simulated annealing, taboo search, and genetic algorithm paradigm, are presented.
doi_str_mv 10.1016/S0140-3664(00)00194-8
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_57463989</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0140366400001948</els_id><sourcerecordid>57463989</sourcerecordid><originalsourceid>FETCH-LOGICAL-c338t-3eb18c61e7fd45e8cf1489763e440377805d5a85580c8dcdd5c60a6c19b586653</originalsourceid><addsrcrecordid>eNqFkE1rGzEURUVpoa6bnxDQKjSLSZ_Q56xCME1bMHSRBEo3Qta8cRQ0I0fSBPzv47FLtlm9zbmX-w4h5wyuGDD1_Q6YgIYrJb4BXAKwVjTmA1kwo3mjgf_9SBZvyGfypZQnABBa8wX5t0rDbqquhjS6GPcU-z74gGOlLm5TDvVxKLRPmcbkjxR1GR3dRTeOYdzSMNJ-qlNG6jHGKbpMy75UHMpX8ql3seDZ_7skD7c_7le_mvWfn79XN-vGc25qw3HDjFcMdd8Jicb3TJhWK45CANfagOykM1Ia8KbzXSe9Aqc8azfSKCX5klycenc5PU9Yqh1Cmce4EdNUrNRC8da0B1CeQJ9TKRl7u8thcHlvGdjZpD2atLMmC2CPJq055K5POTx88RIw2zIb8tiFjL7aLoV3Gl4BXhJ8Yg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>57463989</pqid></control><display><type>article</type><title>Computationally efficient algorithms for location area planning in future cellular systems</title><source>ScienceDirect Journals (5 years ago - present)</source><creator>Demestichas, P. ; Georgantas, N. ; Tzifa, E. ; Demesticha, V. ; Striki, M. ; Kilanioti, M. ; Theologou, M.</creator><creatorcontrib>Demestichas, P. ; Georgantas, N. ; Tzifa, E. ; Demesticha, V. ; Striki, M. ; Kilanioti, M. ; Theologou, M.</creatorcontrib><description>Efficient resource utilisation in future cellular systems is related to the control of the signalling load imposed by the location update and paging operations. Important means for controlling this load is the “proper” planning of location areas. In this paper we define and solve a version of the location area planning problem. Starting from a formal definition and an optimal formulation of the problem, three computationally efficient algorithms, adhering to simulated annealing, taboo search, and genetic algorithm paradigm, are presented.</description><identifier>ISSN: 0140-3664</identifier><identifier>EISSN: 1873-703X</identifier><identifier>DOI: 10.1016/S0140-3664(00)00194-8</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Algorithms ; Genetic algorithm paradigm ; Networks ; Simulated annealing ; Taboo search</subject><ispartof>Computer communications, 2000-07, Vol.23 (13), p.1263-1280</ispartof><rights>2000 Elsevier Science B.V.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c338t-3eb18c61e7fd45e8cf1489763e440377805d5a85580c8dcdd5c60a6c19b586653</citedby><cites>FETCH-LOGICAL-c338t-3eb18c61e7fd45e8cf1489763e440377805d5a85580c8dcdd5c60a6c19b586653</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0140-3664(00)00194-8$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3548,27923,27924,45994</link.rule.ids></links><search><creatorcontrib>Demestichas, P.</creatorcontrib><creatorcontrib>Georgantas, N.</creatorcontrib><creatorcontrib>Tzifa, E.</creatorcontrib><creatorcontrib>Demesticha, V.</creatorcontrib><creatorcontrib>Striki, M.</creatorcontrib><creatorcontrib>Kilanioti, M.</creatorcontrib><creatorcontrib>Theologou, M.</creatorcontrib><title>Computationally efficient algorithms for location area planning in future cellular systems</title><title>Computer communications</title><description>Efficient resource utilisation in future cellular systems is related to the control of the signalling load imposed by the location update and paging operations. Important means for controlling this load is the “proper” planning of location areas. In this paper we define and solve a version of the location area planning problem. Starting from a formal definition and an optimal formulation of the problem, three computationally efficient algorithms, adhering to simulated annealing, taboo search, and genetic algorithm paradigm, are presented.</description><subject>Algorithms</subject><subject>Genetic algorithm paradigm</subject><subject>Networks</subject><subject>Simulated annealing</subject><subject>Taboo search</subject><issn>0140-3664</issn><issn>1873-703X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2000</creationdate><recordtype>article</recordtype><recordid>eNqFkE1rGzEURUVpoa6bnxDQKjSLSZ_Q56xCME1bMHSRBEo3Qta8cRQ0I0fSBPzv47FLtlm9zbmX-w4h5wyuGDD1_Q6YgIYrJb4BXAKwVjTmA1kwo3mjgf_9SBZvyGfypZQnABBa8wX5t0rDbqquhjS6GPcU-z74gGOlLm5TDvVxKLRPmcbkjxR1GR3dRTeOYdzSMNJ-qlNG6jHGKbpMy75UHMpX8ql3seDZ_7skD7c_7le_mvWfn79XN-vGc25qw3HDjFcMdd8Jicb3TJhWK45CANfagOykM1Ia8KbzXSe9Aqc8azfSKCX5klycenc5PU9Yqh1Cmce4EdNUrNRC8da0B1CeQJ9TKRl7u8thcHlvGdjZpD2atLMmC2CPJq055K5POTx88RIw2zIb8tiFjL7aLoV3Gl4BXhJ8Yg</recordid><startdate>20000715</startdate><enddate>20000715</enddate><creator>Demestichas, P.</creator><creator>Georgantas, N.</creator><creator>Tzifa, E.</creator><creator>Demesticha, V.</creator><creator>Striki, M.</creator><creator>Kilanioti, M.</creator><creator>Theologou, M.</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>E3H</scope><scope>F2A</scope></search><sort><creationdate>20000715</creationdate><title>Computationally efficient algorithms for location area planning in future cellular systems</title><author>Demestichas, P. ; Georgantas, N. ; Tzifa, E. ; Demesticha, V. ; Striki, M. ; Kilanioti, M. ; Theologou, M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c338t-3eb18c61e7fd45e8cf1489763e440377805d5a85580c8dcdd5c60a6c19b586653</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2000</creationdate><topic>Algorithms</topic><topic>Genetic algorithm paradigm</topic><topic>Networks</topic><topic>Simulated annealing</topic><topic>Taboo search</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Demestichas, P.</creatorcontrib><creatorcontrib>Georgantas, N.</creatorcontrib><creatorcontrib>Tzifa, E.</creatorcontrib><creatorcontrib>Demesticha, V.</creatorcontrib><creatorcontrib>Striki, M.</creatorcontrib><creatorcontrib>Kilanioti, M.</creatorcontrib><creatorcontrib>Theologou, M.</creatorcontrib><collection>CrossRef</collection><collection>Library &amp; Information Sciences Abstracts (LISA)</collection><collection>Library &amp; Information Science Abstracts (LISA)</collection><jtitle>Computer communications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Demestichas, P.</au><au>Georgantas, N.</au><au>Tzifa, E.</au><au>Demesticha, V.</au><au>Striki, M.</au><au>Kilanioti, M.</au><au>Theologou, M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Computationally efficient algorithms for location area planning in future cellular systems</atitle><jtitle>Computer communications</jtitle><date>2000-07-15</date><risdate>2000</risdate><volume>23</volume><issue>13</issue><spage>1263</spage><epage>1280</epage><pages>1263-1280</pages><issn>0140-3664</issn><eissn>1873-703X</eissn><abstract>Efficient resource utilisation in future cellular systems is related to the control of the signalling load imposed by the location update and paging operations. Important means for controlling this load is the “proper” planning of location areas. In this paper we define and solve a version of the location area planning problem. Starting from a formal definition and an optimal formulation of the problem, three computationally efficient algorithms, adhering to simulated annealing, taboo search, and genetic algorithm paradigm, are presented.</abstract><pub>Elsevier B.V</pub><doi>10.1016/S0140-3664(00)00194-8</doi><tpages>18</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0140-3664
ispartof Computer communications, 2000-07, Vol.23 (13), p.1263-1280
issn 0140-3664
1873-703X
language eng
recordid cdi_proquest_miscellaneous_57463989
source ScienceDirect Journals (5 years ago - present)
subjects Algorithms
Genetic algorithm paradigm
Networks
Simulated annealing
Taboo search
title Computationally efficient algorithms for location area planning in future cellular systems
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T14%3A05%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Computationally%20efficient%20algorithms%20for%20location%20area%20planning%20in%20future%20cellular%20systems&rft.jtitle=Computer%20communications&rft.au=Demestichas,%20P.&rft.date=2000-07-15&rft.volume=23&rft.issue=13&rft.spage=1263&rft.epage=1280&rft.pages=1263-1280&rft.issn=0140-3664&rft.eissn=1873-703X&rft_id=info:doi/10.1016/S0140-3664(00)00194-8&rft_dat=%3Cproquest_cross%3E57463989%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=57463989&rft_id=info:pmid/&rft_els_id=S0140366400001948&rfr_iscdi=true