A graph theoretic approach for channel assignment in cellular networks

Authors:
Mihaela Iridon;David Matula;Cheng Yang
Affiliations:
Southern Methodist University, Dallas, TX and Verizon, Call Center Services, Irving Texas;Southern Methodist University, Dallas, TX;Southern Methodist University, Dallas, TX
Venue:
Wireless Networks
Year:
2001

Citing 3
Cited 3

Graphical evolution: an introduction to the theory of random graphs

Graphical evolution: an introduction to the theory of random graphs
Performance Analysis of a Graph Model for Channel Assignment in a Cellular Network

COMPSAC '99 23rd International Computer Software and Applications Conference
Trends in handover design

IEEE Communications Magazine

On-line algorithms for the channel assignment problem in cellular networks

Discrete Applied Mathematics
Efficient channel assignment algorithms for infrastructure WLANs under dense deployment

Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Improving densely deployed wireless network performance in unlicensed spectrum through hidden-node aware channel assignment

Performance Evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a cellular assignment graph to model the channel assignment problem in a cellular network where overlapping cell segments are included in the model. Our main result is the Capacity-Demand Theorem which shows a channel assignment function is always possible unless there is a connected subregion of cells and overlap segments containing more channel requests then the total capacity of all transceivers within or on the boundary of the subregion and covering any part of the subregion with an overlapping segment. We further describe the simplicity and regularity of our proposed cellular assignment graphs and their accessibility for simulation and theoretical investigation without artifacts from the overall geographical region boundaries.