A characterisation of optimal channel assignments for cellular and square grid wireless networks

Authors:
M. V. S. Shashanka;Amrita Pati;Anil M. Shende
Affiliations:
Boston University, Boston, MA;Virginia Polytechnic Institute and State University, Blacksburg, VA;221 College Lane, Roanoke College, Salem, VA
Venue:
Mobile Networks and Applications
Year:
2005

Citing 6
Cited 0

Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups
Labelling graphs with a condition at distance 2

SIAM Journal on Discrete Mathematics
A characterization of root lattices

Discrete Mathematics
Assigning codes in wireless networks: bounds and scaling properties

Wireless Networks
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
Channel Assignment with Separation for Special Classes of Wireless Networks: Grids and Rings

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we first present a uniformity property that characterises optimal channel assignments for networks arranged as cellular or square grids. Then, we present optimal channel assignments for cellular and square grids; these assignments exhibit a high value for δ1 - the separation between channels assigned to adjacent stations. We prove an upper bound on δ1 for such optimal channel assignments. This upper bound is greater than the value of δ1 exhibited by our assignments. Based on empirical evidence, we conjecture that the value our assignments exhibit is a tight upper bound on δ1.