Ant Colony Optimization to Minimize Call Routing Cost with Assigned Cell in Wireless Network
In this paper we have proposed a technique to minimize the cost of call routing with assigned cell in wireless network using Ant Colony Optimization (ACO). The two components that are considered for optimizing the call routing cost with assigned cell in wireless network are paging cost and handoff cost. It is assumed that the total network is divided into some location areas which are already known. When a terminal wants to set up a connection with another terminal, it will first search for the location of that. If the destination terminal is in the same location area it resembles to paging cost only, otherwise it resembles to both paging and handoff cost. Connection between two terminals in a wireless network can be established in a number of ways via different terminals. In this paper we have applied Ant Colony Optimization technique and other different algorithm to minimize the call routing cost. A comparative assessment of the execution time has been made among different call routing algorithm.
KeywordsCell assignment Ant Colony Optimization Wireless Network Call Routing Cost Handoff Cost Paging Cost
Unable to display preview. Download preview PDF.
- 2.Kim, S.S., Kim, I.-H., Mani, V., Kim, H.J., Agrawal, D.P.: Partitioning of Mobile Network into location areas using Ant Colony Optimization. ICIC International ICIC Ex-press Letters Part B: Applications ICIC 1(1), 39–44 (2010)Google Scholar
- 3.Dorigo, M., Stutzle, T.: The ant colony optimization metaheuristic: Algorithms, applica-tions, and advances. In: Glover, F.W., Kochenberger, G.A. (eds.) Handbook of Metaheuristics, vol. 4(3), pp. 29–41. Kluwer Academic Publishers, MA (2002)Google Scholar
- 5.Yoshikawa, M., Otani, K.: Ant Colony Optimization Routing Algorithm with Tabu Search. Proceedings of the International Multi Conference of Engineers and Computer Scientists 3(2), 301–304 (2010)Google Scholar