Upper and lower bounds of a class of channel assignment problems in cellular networks

Arunabha Sen, Tom Roxborough, Sirisha Medidi

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

30 Scopus citations

Abstract

A cellular network is often modelled as a graph and the channel assignment problem is formulated as a coloring problem of the graph. In this paper, we introduce the notion of cellular graphs that models the hexagonal cell structures of a cellular network. Exploiting the regular structure of the cellular graphs we compute the upper and the lower bounds for a class of channel assignment problems. Assuming a k - band buffering system where the interference does not extend beyond k cells away from the call originating cell, we provide two different formulations of the channel assignment problem - Distance-k Chromatic Number problem and k-Band Chromatic Bandwidth problem. We give one algorithm for the first problem and two for the second, with all three algorithms assigning channels to the cells. The complexity of the algorithm for the first problem is O(p), where p is the number of cells. For the second problem, the complexity of the first algorithm is O(p) and the complexity of the second algorithm is O(k 5log k). All the algorithms are asymptotically optimal, in the sense that the order of the upper bound of the number of channels required is the same as the order of the lower bound.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
PublisherIEEE
Pages1284-1291
Number of pages8
Volume3
StatePublished - 1998
EventProceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3) - San Francisco, CA, USA
Duration: Mar 29 1998Apr 2 1998

Other

OtherProceedings of the 1998 17th Annual IEEE Conference on Computer Communications, INFOCOM. Part 1 (of 3)
CitySan Francisco, CA, USA
Period3/29/984/2/98

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Upper and lower bounds of a class of channel assignment problems in cellular networks'. Together they form a unique fingerprint.

  • Cite this

    Sen, A., Roxborough, T., & Medidi, S. (1998). Upper and lower bounds of a class of channel assignment problems in cellular networks. In Proceedings - IEEE INFOCOM (Vol. 3, pp. 1284-1291). IEEE.