A Simple Heuristic for Assignment of Cells to Switches in a PCS Network

  • Authors:
  • Debashis Saha;Amitava Mukherjee;Partha Sarathi Bhattacharya

  • Affiliations:
  • Department of Computer Science and Engineering, Jadavpur University, Calcutta 700 032, India E-mail: d.saha@computer.org;PricewaterhouseCoopers Ltd., Salt Lake City, Calcutta 700 091, India E-mail: amitava_mukherjee@india.notes.pwa.co.in;Department of Telecommunications, 2 Judges Court Road, Calcutta 700 027, India

  • Venue:
  • Wireless Personal Communications: An International Journal
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

This work deals with a design problemfor a network of Personal Communication Services(PCS). The goal is to assign cells to switches in aPCS Network (PCSN) in an optimum manner so as tominimize the total cost which includes two types ofcost, namely handoff cost between two adjacent cells,and cable cost between cells and switches. The designis to be optimized subject to the constraint that thecall volume of each switch must not exceed its callhandling capacity. In the literature, this problem hasbeen conventionally formulated as an integerprogramming problem. However, because of the timecomplexity of the problem, the solution procedures areusually heuristic when the number of cells andswitches are more. In this paper, we have proposed anassignment heuristic which is faster and much simplerthan the existing algorithms. Despite its simplicity,experimental results show that it performs equallywell in terms of solution quality, and, at the sametime, it is faster than its predecessors. We presentthe algorithm as well as comparative results tojustify our claim.