Optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids

Authors:
B. S. Panda;Mahesh Kumar;Sajal K. Das
Affiliations:
Department of Mathematics, Indian Institute of Technology, Delhi, New Delhi, India;Department of Mathematics, Indian Institute of Technology, Delhi, New Delhi, India;Department of Computer Science and Engineering, The University of Texas at Arlington, Arlington, TX
Venue:
IWDC'04 Proceedings of the 6th international conference on Distributed Computing
Year:
2004

Citing 6
Cited 0

A characterization of root lattices

Discrete Mathematics
Efficient use of radio spectrum in wireless networks with channel separation between close stations

DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
On the Radiocoloring Problem

IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
Channel Assignment for Wireless Networks Modelled as d-Dimensional Square Grids

IWDC '02 Proceedings of the 4th International Workshop on Distributed Computing, Mobile and Wireless Computing
lambda-Coloring of Graphs

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

IEEE Communications Surveys & Tutorials

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents optimal schemes for channel assignment problem in wireless networks modeled as 2-dimensional square grids. Given the reuse distance σ (an integer ≥ 5 ), using minimum number of colors, our algorithm assigns colors(channels) to the vertices (radio stations) in such a way that the color difference between the adjacent vertices is at least 2, and two vertices x and y receive the same color only when the distance between x and y is at least σ.