Preview

Automatic Frequency Planning & Optimization

Powerful Essays
Open Document
Open Document
2913 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Automatic Frequency Planning & Optimization
Automatic Frequency Planning and Optimization
Algorithm for Cellular Networks
Muhammad Umair, Waleed Bin Shahid, Masab Javed Abbasi,
Department of Electrical Engineering
Royal Institute of Technology (KTH)
SE100-44 Stockholm, SWEDEN
E-mail: mumair@kth.se, waleed.shahid@mcs.edu.pk , masab.abbasi-pc@telenor.com.pk
Abstract— Frequency planning in ever growing cellular networks is an extremely arduous task. Any effort to lay down manual frequency plans promulgates inefficiency in the cellular radio systems. The extensive deployment and penetration of cellular networks necessitate the need to carry out automatic frequency planning. This paper presents a novel and ingenious algorithm for automatic generation and optimization of the frequency plan whereby curtailing the intra-system interference levels within the acceptable ranges of the key performance indicators (KPI’s) defined for any real time cellular network. The automatic frequency planning and optimization has been done using the concept of Inter-Cell
Dependency Matrix (ICDM) which contains cell correlations in terms of the affect one cell has on the other primarily with regards to the co-channel interference. The proposed algorithm was simulated in MATLAB. It has been set forth and tested using inputs from live network data. It has been found to satisfy the verifiable network performance metrics.
Index Terms—Automatic Frequency Planning, Inter Cell dependency matrix, Intra-system Interference, Co-channel
Interference, Traffic based ICDM.

I.

INTRODUCTION

Cellular telephony has rapidly evolved as the prime form of wireless communication over the last decade. The widespread deployments of cellular networks derive motivation from the need to provide mobile telephony service, so as to enhance the capacity in terms of the number of users. However, radio spectrum is a scarce resource, which inhibits the indefinite growth of user-based capacity [1]. As a consequence, the radio



References: Frequency Planning Algorithm in a Real Land Mobile Radio System Design”, IEEE MELECON 2002, May 7-9, 2002, Cairo, Egypt. 108–120, 2007, © Springer-Verlag Berlin Heidelberg 2007. Dependency Matrix in a GSM network”, Vehicular Technology Conference, 1999 Phone Networks”. July10, 1997. Cellular Communication System,” in IEEE International Conference on Communications (ICC), 2009. wireless mobile networks. IEEE Transactions on Vehicular Technology 54 (2005) 1887–1895. computing in telecommunication network design: A survey. In Revision (2006). [14] Lee, W.C.Y., Mobile Commnications Design Funbntals, John Wiley & Sons, inc, 1993. Conf. on Evolutionary Computation.(1995) 539–544 [16] Hale, W.K.: Frequency assignment: Theory and applications. Proceedings of the IEEE 68 (1980) 1497–1514 [17] Aardal, K.I., van Hoesen, S.P.M., Koster, A.M.C.A., Mannino, C., [18] Smith, D.H., Allen, S.M., Hurley, S.: Characteristics of good metaheuristics algorithms for the frequency assignment problem. Annals of Operations Research 107 (2001) 285–301 2G/2.5G/3G... Evolution to 4G. Wiley (2004) 21–54 [20] GAMST, A

You May Also Find These Documents Helpful

  • Good Essays

    The problem basically consists of finding the optimum set of routes that represent the lowest possible total cost and/or total travel time. The plant is dealing with the repositioning of trucks to serve its supply demand and determining a number of transportation units that optimally balance supply requirements against the cost of maintaining the transportation units. In order to increase truck utilization and achieve better performance, the plant has to adequately and efficiently ensure the scheduling of a steady supply of hogs.…

    • 1274 Words
    • 6 Pages
    Good Essays
  • Good Essays

    In this way, the assignment algorithm will converge faster without affecting the network performance. The edgetrimming strategy must follow these design objectives:…

    • 8009 Words
    • 33 Pages
    Good Essays
  • Satisfactory Essays

    system planning

    • 426 Words
    • 2 Pages

    The total cash flow of option C is $4.0 million instead of $1.0 million because on December 31, 2011, Smooth Sailing will turn the cruise ship back to the lender while the estimated fair value of the ship is $3.0 million. The book value of the asset group (cruise ship + working capital) is…

    • 426 Words
    • 2 Pages
    Satisfactory Essays
  • Good Essays

    The Maze Runner By: James Dashner Thomas is a boy that woke up and found himself alone in a dark box. He shouts and yells for help until the box opens. He looks up and sees a bunch of other boys looking back at him. He doesn't remember anything about his life and he's very confused about where he is. The leader named Alby comes over and tells him that they call this place the glade but in his sentences he says thing "Shank" "Shuck" "Keeper" "Slopper.…

    • 1317 Words
    • 6 Pages
    Good Essays
  • Good Essays

    Many questions arise when we think about optimization problem in healthcare industry. Like how to decide the best location for OPD and emergency vehicles…

    • 523 Words
    • 3 Pages
    Good Essays
  • Satisfactory Essays

    Biology Test

    • 837 Words
    • 4 Pages

    4) The transportation algorithm can be used to solve both minimization problems and maximization problems.…

    • 837 Words
    • 4 Pages
    Satisfactory Essays
  • Powerful Essays

    * Even when this search approach works, the problems are often resolved with a suboptimal solution due to the limited search of solution space.…

    • 1623 Words
    • 7 Pages
    Powerful Essays
  • Powerful Essays

    [8] Companys, R., Mateo, M., "Different Behaviour of a Double Branch-and-Bound Algorithm on Fm|Prmu|Cmax and Fm|Block|Cmax Problems", Computers and Operations Research, Vol. 34, 2007, pp. 938-953. [9] Wang, L., Pan, Q.K., Tasgetiren, M.F., "Minimizing the Total Flow Time in a Flow Shop with Blocking by using Hybrid Harmony Search Algorithms", Expert Systems with Applications, Vol. 37, 2010, pp. 7929-7936. [10] Nawaz, M., Enscore Jr, E.E., Ham, I., "A Heuristic Algorithm for the m-Machine, n-Job Flow-Shop Sequencing Problem", Omega, Vol. 11, 1983, pp. 91-95. [11] Caraffa, V., Ianes, S., Bagchi, T.P., Sriskandarajah, C., "Minimizing Makespan in a Blocking Flow Shop using Genetic Algorithms", International Journal of Production Economics, Vol. 70, 2001, pp. 101-115. [12] Ribas, I., Companys, R., Tort-Martorell, X., "An Iterated Greedy Algorithm for the Flow Shop Scheduling Problem with Blocking", Omega, Vol. 39, 2011, pp. 293-301. [13] Wang, L., Pan, Q.K., Tasgetiren, M.F., "A Hybrid Harmony Search Algorithm for the Blocking Permutation Flow Shop Scheduling Problem", Computers & Industrial Engineering, Vol. 61, 2011, pp. 76-83. [14] Ruiz, R., & Stutzle, T., "A Simple and Efective Iterated Greedy Algorithm for the Permutation Flow Shop Scheduling Problem", European Journal of Operational Research, Vol. 177, 2007, pp. 2033-2049. [15] Ronconi, D.P., Henriques, L.R.S., "Some Heuristic Algorithms for Total Tardiness Minimization in a Flowshop with Blocking", Omega, Vol. 37, 2009, pp. 272-281. [16] Framinan, J.M., Leisten, R., "An Eficient Constructive Heuristic for Flowtime Minimisation in Permutation Flow Shops", Omega, Vol. 31, 2003, pp. 311-317. [17] Kalczynski, P.J., Kamburowski, J., "An Improved NEH Heuristic to Minimize Makespan in Permutation Flow Shops", Computers and Operations Research, Vol. 35, 2008, pp. 3001-3008. [18] Taillard, E., "Benchmarks for Basic Scheduling Problems", European Journal of Operational Research, Vol. 64, 1993, pp. 278-285.…

    • 6346 Words
    • 26 Pages
    Powerful Essays
  • Powerful Essays

    Capacity Planning

    • 1371 Words
    • 6 Pages

    In today’s competitive economic environment, customers do not just prefer but demand manufacturers to provide quality products in a timely fashion at competitive prices. To satisfy this requirement, manufacturers need to plan necessary and sufficient capacity to meet market demands. However, capacity planning is a very challenging task for many manufacturers. In Bangladesh now as well as the other industries ceramic industries need to compete to make better place in the market. Understanding and then building the infrastructure that provides the needed flexibility and speed requires an in-depth understanding of how capacity impacts your business. The impact of capacity management is felt throughout the organization, within every element of the supply chain. Supplier capacity can bring production to a standstill. Production capacity is equally important if the capacity is not great enough to meet peak demand periods and inventory building is not properly planned, customer demand will go unfilled. Distribution capacity, both storage and throughput, ensures delivery of the right product at the right time. Transportation connects all elements of the supply chain; as such its capacity issues are key influencing service levels and on-time delivery performance.…

    • 1371 Words
    • 6 Pages
    Powerful Essays
  • Good Essays

    7,200 seconds for each instance. When running instances with CPLEX it was possible to obtain results to measure the quality of the RAS metaheuristic solution. RAS was developed in C language and run on the same computer described before with a runtime limited to 7,200 seconds. RAS metaheuristic was run 10 times for each analyzed instance to obtain the deviation from the best solution found.…

    • 1753 Words
    • 8 Pages
    Good Essays
  • Powerful Essays

    In hierarchical approach, the problem is converted into two sub-problems: Allocation problem and scheduling problem [2]. This separation will reduce complexity; nevertheless, the obtained results are also far from the optimal solutions. In integrated approach, allocation and scheduling are done simultaneously; also, compared to hierarchical method, in this approach better answers will result and also the necessary time for acquiring the solutions is longer. In the following, initially we review on some of the conducted studies with hierarchical approach and then, we will explore the conducted studies with integrated…

    • 1862 Words
    • 8 Pages
    Powerful Essays
  • Good Essays

    Group Technology

    • 7755 Words
    • 32 Pages

    References: Askin, R.G., Standridge, C.R.: Modeling & Analysis Of Manufacturing Systems, John Wiley & Sons, 1993. B. Kernighan and S. Lin (1970): An Efficient Heuristic Procedure for Partitioning of Electrical Circuits, Bell System Technical Journal, 291-307. Internet sources on Opiz, KK3 und some methods, e.g.: • • • http://www.ielm.ust.hk/dfaculty/ajay/courses/ieem513/GT/GT.html Examples for metaheuristics: T.L. James, E.C. Brown, K.B. Keeling (2007): A hybrid grouping genetic algorithm for the cell formation problem, Computers and Operations Research, Volume 34 (7, July) 2059-2079 . Mahdavi, M.M. Paydar, M. Solimanpur, A. Heidarzade (2009): Genetic algorithm approach for solving a cell formation problem in cellular manufacturing, Expert Systems with Applications: An International Journal, Volume 36 (3, April) 6598-6604. T. Tunnukij, C. Hicks (2009): An Enhanced Grouping Genetic Algorithm for solving the cell formation problem, International Journal of Production Research, Volume 47 (7, Jan.) 1989 – 2007. D. Cao and M. Chen (2004): Using penalty function and Tabu search to solve cell formation problems with fixed cell cost, Computers & Operations Research, Volume 31 (1, Jan.) 21-37. J. Schaller (2005): Tabu search procedures for the cell formation problem with intra-cell transfer costs as a function of cell size, Computers and Industrial Engineering, Volume 49 (3, Nov.), 449 – 462.…

    • 7755 Words
    • 32 Pages
    Good Essays
  • Good Essays

    General method • Useful technique for optimizing search under some constraints • Express the desired solution as an n-tuple (x1 , . . . , xn ) where each xi ∈ Si , Si being a finite set • The solution is based on finding one or more vectors that maximize, minimize, or satisfy a criterion function P (x1 , . . . , xn ) • Sorting an array a[n] – Find an n-tuple where the element xi is the index of ith smallest element in a – Criterion function is given by a[xi ] ≤ a[xi+1 ] for 1 ≤ i < n – Set Si is a finite set of integers in the range [1,n] • Brute force approach – Let the size of set Si be mi – There are m = m1 m2 · · · mn n-tuples that satisfy the criterion function P – In brute force algorithm, you have to form all the m n-tuples to determine the optimal solutions • Backtrack approach – Requires less than m trials to determine the solution – Form a solution (partial vector) and check at every step if this has any chance of success – If the solution at any point seems not-promising, ignore it – If the partial vector (x1 , x2 , . . . , xi ) does not yield an optimal solution, ignore mi+1 · · · mn possible test vectors even without looking at them • All the solutions require a set of constraints divided into two categories: explicit and implicit constraints Definition 1 Explicit constraints are rules that restrict each xi to take on values only from a given set. – Explicit constraints depend on the particular instance I of problem being solved – All tuples that satisfy the explicit constraints define a possible solution space for I – Examples of explicit constraints ∗ xi ≥ 0, or all nonnegative real numbers ∗ xi = {0, 1} ∗ li ≤ xi ≤ ui Definition 2 Implicit constraints are rules that determine which of the tuples in the solution space of I satisfy the criterion function. – Implicit constraints describe the way in which the xi s must relate to each other. • Determine problem solution by systematically searching the solution space for the given problem instance…

    • 1196 Words
    • 5 Pages
    Good Essays
  • Powerful Essays

    4. A. Aho, J. Hoperoft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. 143…

    • 27400 Words
    • 141 Pages
    Powerful Essays
  • Satisfactory Essays

    in the matrix below. Determine the optimal assignment. Which operator will have no assignment? Operators Jobs 1 2 3 4 5 6 2 5 2 6 1 2 5 8 7 7 2 7 8 6 9 8 3 6 2 3 4 5 4 9 3 8 9 7 5 4 7 4 6 8 6…

    • 405 Words
    • 2 Pages
    Satisfactory Essays