Abstract
Location area (LA) planning in PCSN is a NP-hard problem. In this paper we modeled it as a clustering problem where each LA is considered to be a cluster. Agglomerative Hierarchical Algorithm (AHA) is applied to form the cell clusters. The algorithm starts assuming each cell as a separate cluster. In successive iterations the clusters are merged randomly in a bottom up fashion based on a total cost function (TCF) till the desired numbers of clusters are obtained. Total Cost Evaluation Metric (TCEM) is proposedto compare AHA with other schemes. Experimental results show that AHA provides better results in most of the cases compared to Greedy Heuristic based approach.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Merchant, A., Sengupta, B.: Assignment of cells to switches in PCS networks. IEEE/ACM Trans. Networking 3(5), 521–526 (1995)
Saraydar, C.U., Kelly, O., Rose, C.: One-dimensional location area design. IEEE Trans. Vehicular Technology 49, 1626–1632 (2000)
Gary, M.R., Johnson, D.S.: Computers and Intractability. In: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Bhattacharjee, P.S., Saha, D., Mukherjee, A.: Heuristics for assignment of cells to switches in a PCSN: A comparative study. In: Proc. IEEE Int. Conf. Personal Communication, Jaipur, India, Febuary 17–19, pp. 331–334 (1999)
Bhattacharjee, P.S., Saha, D., Mukherjee, A.: An Approach for Location area Planning in a Personal communication service Network (PCSN). IEEE Transactions on Wireless Communications 3(4), 1176–1187 (2004)
Saha, D., Mukherjee, A., Bhattacharjee, P.S.: A simple heuristic for assignment of cells to switches in a PCS network. In: Wireless Personal Communication, vol. 12, pp. 209–224. Kluwer Academic, Amsterdam (2000)
Saha, D., Mukherjee, A.: Design of hierarchical communication network under node/ link failure constraints. Computer Communication 18(5), 378–383 (1995)
Gondim, P.: Genetic algorithms and location area partitioning problem in cellular net-works. In: Proc. IEEE Vehicular Technology Conference, Atlanta, GA (April 1996)
Mandal, S., Saha, D., Mahanti, A.: A heuristic search for generalized cellular network planning. In: Proc. IEEE Int. Conf. Personal Communication, New Delhi, India, December 2002, pp. 105–109 (2002)
http://www2.cs.uregina.ca/~hamilton/courses/831/notes/itemsets/itemset_prog2.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nandi, S., Mandal, P.C., Halder, P., Basu, A. (2005). Agglomerative Hierarchical Approach for Location Area Planning in a PCSN. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_40
Download citation
DOI: https://doi.org/10.1007/11603771_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30959-8
Online ISBN: 978-3-540-32428-7
eBook Packages: Computer ScienceComputer Science (R0)