Agglomerative hierarchical approach for location area planning in a PCSN

Authors:
Subrata Nandi;Purna Ch. Mandal;Pranab Halder;Ananya Basu
Affiliations:
Department of Computer Science and Engineering, National Institute of Technology, Durgapur, WB, India;Department of Computer Science and Engineering, National Institute of Technology, Durgapur, WB, India;Department of Computer Science and Engineering, National Institute of Technology, Durgapur, WB, India;Department of Computer Science and Engineering, National Institute of Technology, Durgapur, WB, India
Venue:
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Year:
2005

Citing 5
Cited 0

Assignment of cells to switches in PCS networks

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Simple Heuristic for Assignment of Cells to Switches in a PCS Network

Wireless Personal Communications: An International Journal
An approach for location area planning in a personal communication services network (PCSN)

IEEE Transactions on Wireless Communications
Research note: Design of hierarchical communication networks under node/link failure constraints

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

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.