Analytical approach for channel assignments in cellular networks

Vladimir V. Shakhov, Hyunseung Choo

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In the present paper channel assignments in cellular architectures are considered. This is quite important in cell and channel planning since reusing channels in cells allows to manage resources and to serve users effectively in the system. The optimal solution is offered here for the case of co-channel interference. Previous solutions on co-channel interference are based on regular hexagonal models for service areas. A novel technique is employed in this work that does not depend upon any geometric form of cells. It is obtained that the optimal number of channels equals the density of a special graph. Earlier analytical results on span minimization show lower bounds meanwhile we provide the upper bound in this paper.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsPeter M. A. Sloot, David Abramson, Alexander V. Bogdanov, Yuriy E. Gorbachev, Jack J. Dongarra, Albert Y. Zomaya
PublisherSpringer Verlag
Pages466-473
Number of pages8
ISBN (Print)9783540448600
DOIs
StatePublished - 2003

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2657
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'Analytical approach for channel assignments in cellular networks'. Together they form a unique fingerprint.

Cite this