On channel assignment problem in cellular networks

Tom Roxborough, Sirisha Medidi, Arunabha Sen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

The channel assignment problem in a mobile cellular network is considered in this paper. The cellular network is most often modelled as a graph and the channel assignment problem is formulated as the coloring problem of that graph. The channel assignment problem in its most general form is NP-complete. Prior studies assume that the graph modelling the cellular network is an arbitrary graph. However, we show that the graph modelling the cellular network has a very regular structure and exploiting this regular structure, the channel assignment problem can be solved optimally in many cases. We also present an integer linear programming formulation of the channel assignment problem.

Original languageEnglish (US)
Title of host publicationConference Record of the Asilomar Conference on Signals, Systems and Computers
EditorsM.P. Farques, R.D. Hippenstiel
PublisherIEEE Comp Soc
Pages630-634
Number of pages5
Volume1
StatePublished - 1998
EventProceedings of the 1997 31st Asilomar Conference on Signals, Systems & Computers. Part 1 (of 2) - Pacific Grove, CA, USA
Duration: Nov 2 1997Nov 5 1997

Other

OtherProceedings of the 1997 31st Asilomar Conference on Signals, Systems & Computers. Part 1 (of 2)
CityPacific Grove, CA, USA
Period11/2/9711/5/97

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'On channel assignment problem in cellular networks'. Together they form a unique fingerprint.

Cite this