scispace - formally typeset
Journal ArticleDOI

Assignment of cells to switches in PCS networks

Arif Merchant, +1 more
- 01 Oct 1995 - 
- Vol. 3, Iss: 5, pp 521-526
TLDR
The authors formulate the problem exactly as an integer programming problem and propose a heuristic solution for this problem and show that it performs extremely well.
Abstract
Considers a problem of network design of personal communication services (PCS). The problem is to assign cells to the switches of a PCS network in an optimum manner. The authors consider two types of costs. One is the cost of handoffs between cells. The other is the cost of cabling (or trunking) between a cell site and its associated switch. The problem is constrained by the call volume that each switch can handle. The authors formulate the problem exactly as an integer programming problem. They also propose a heuristic solution for this problem and show that it performs extremely well. >

read more

Citations
More filters
Journal ArticleDOI

A survey of routing techniques for mobile communications networks

TL;DR: The impact of node mobility and wireless communication on routing system design is discussed, and the set of techniques employed in or proposed for routing in mobile wireless networks is surveyed.
Journal ArticleDOI

Handoffs in Cellular Wireless Networks: The Daedalus Implementation and Experience

TL;DR: In this paper, the authors describe a multicast-based protocol that eliminates data loss and incurs negligible delays during a handoff in cellular wireless data networks, where the basic technique of the algorithm is to anticipate a handover using wireless network information in the form of received signal strengths and to multicast data destined for the mobile host to nearby base stations in advance.
Journal ArticleDOI

A hybrid Hopfield network-genetic algorithm approach for the terminal assignment problem

TL;DR: This paper presents a hybrid Hopfield network-genetic algorithm (GA) approach to tackle the terminal assignment (TA) problem which involves a Hopfield neural network (HNN) which manages the problem's constraints, whereas a GA searches for high quality solutions with the minimum possible cost.
Journal ArticleDOI

Location area planning and cell-to-switch assignment in cellular networks

TL;DR: This paper uses the available network information to formulate a realistic optimization problem, and proposes an algorithm based on simulated annealing (SA) for its solution, and investigates the quality of the SA-based technique by comparing it to greedy search, random generation methods, and a heuristic algorithm.
Journal ArticleDOI

A tabu search approach for assigning cells to switches in cellular mobile networks

TL;DR: In this article, a tabu search approach for assigning cells to switches in wireless cellular networks is proposed, where a new mathematical equivalence between the assignment problem and the well-known p-fixed hub location problem is established.
References
More filters
Book

Computers and Intractability: A Guide to the Theory of NP-Completeness

TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Book

Integer and Combinatorial Optimization

TL;DR: This chapter discusses the Scope of Integer and Combinatorial Optimization, as well as applications of Special-Purpose Algorithms and Matching.
Journal ArticleDOI

An efficient heuristic procedure for partitioning graphs

TL;DR: A heuristic method for partitioning arbitrary graphs which is both effective in finding optimal partitions, and fast enough to be practical in solving large problems is presented.
Related Papers (5)