Abstract
In this paper, the network expanded problem (NEP) which optimally assigns new adding and splitting cells in PCS (Personal Communication Service) network to switches in an ATM (Asynchronous Transfer Mode) network is studied. In NEP, the locations of all cells (or Base Station, BS) in PCS network are fixed and known, but new switches should be installed to ATM network and the topology of the backbone network may be changed. Given some potential sites of new switches, the problem is to determine how many switches should be added to the backbone network, the locations of new switches, the topology of the new backbone network, and the assignments of new adding and splitting cells in the PCS to switches on the new ATM backbone network in an optimum manner. The goal is to do the expansion in as attempt to minimize the total communication cost under budget and capacity constraints. The NEP is modeled as a complex integer programming problem and finding an optimal solution to this problem is NP-hard. A heuristic algorithm is proposed to solve this problem. The proposed heuristic algorithm consists of four phases: Remaining Capacities Pre-assigning Phase (RCPP), Cell Clustering Phase (CCP), Switch Selection Phase (SSP), and Backbone Design Phase (BDP). Experimental results indicate that the proposed algorithm can find good solution.
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
Cheng, M., Rajagopalan, S., Chang, L.F., Pollini, G.P., Barton, M.: PCS mobility support over fixed ATM networks. IEEE Communication Magazine 35(11), 82–91 (1997)
Rappaport, T.S.: Cellular radio and personal communications, vol. 1. IEEE Computer Society Press, Los Alamitos (1995)
Merchant, A., Sengupta, B.: Assignment of cells to switches in PCS networks. IEEE/ACM Trans. on Networking 3(5), 521–526 (1995)
Din, D.R., Tseng, S.S.: Simulated annealing algorithms for optimal design of two–level wireless ATM network. Proceeding of NSC 25(3), 151–162 (2001)
Din, D.R., Tseng, S.S.: Heuristic algorithm for optimal design of two-level wireless ATM network. Journal of Information Science Engineering 17(4), 665–674 (2001)
Din, D.R., Tseng, S.S.: Heuristic and simulated annealing algorithms for solving extended cell assignment problem in wireless ATM network. International Journal of Communication Systems 15(1), 47–65 (2002)
Din, D.R., Tseng, S.S.: A solution model for optimal design of two-level wireless ATM network. IEICE Transactions on Communications, IEICE Trans. Commun. E85-B(8), 1533–1541 (2002)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistics Quarterly 2, 83–97 (1955)
Lieshout, P.M.D., Volgenant, A.: A branch-and-bound algorithm for the singly constrained assignment problem. European Journal of Operational Research 176, 151–164 (2007)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, San Francisco (1979)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Din, DR. (2007). A Heuristic Algorithm for Solving the Network Expanded Problem on Wireless ATM Environment. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74472-6_69
Download citation
DOI: https://doi.org/10.1007/978-3-540-74472-6_69
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74468-9
Online ISBN: 978-3-540-74472-6
eBook Packages: Computer ScienceComputer Science (R0)