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

Authors:
Alan A. Bertossi;Cristina M. Pinotti;Richard B. Tan
Affiliations:
Department of Mathematics, University of Trento, 38050 Povo (Trento), Italy;IEI-CNR, 56100 Pisa, Italy;Dept. of Computer Science, University of Sciences & Arts of Oklahoma
Venue:
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
Year:
2000

Citing 7
Cited 8

Distributed Nodes Organization Algorithm for Channel Access in a Multihop Dynamic Radio Network

IEEE Transactions on Computers
Labelling graphs with a condition at distance 2

SIAM Journal on Discrete Mathematics
Labeling Chordal Graphs: Distance Two Condition

SIAM Journal on Discrete Mathematics
Code assignment for hidden terminal interference avoidance in multihop packet radio networks

IEEE/ACM Transactions on Networking (TON)
The $L(2,1)$-Labeling Problem on Graphs

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

Wireless Networks
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey

IEEE Communications Surveys & Tutorials

Channel assignment and graph labeling

Handbook of wireless networks and mobile computing
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
Channel Assignment with Separation for Interference Avoidance in Wireless Networks

IEEE Transactions on Parallel and Distributed Systems
L(h,1)-labeling subclasses of planar graphs

Journal of Parallel and Distributed Computing
A characterisation of optimal channel assignments for cellular and square grid wireless networks

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

IWDC'04 Proceedings of the 6th international conference on Distributed Computing
L(2,1)-labeling of dually chordal graphs and strongly orderable graphs

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates the problem of assigning channels to the stations of a wireless network so that interfering transmitters are assigned channels with a given separation and the number of channels used is minimized. Two versions of the channel assignment problem are considered which are equivalent to two specific coloring problems — called L(2, 1) and L (2, 1, 1) — of the graph representing the network topology. In these problems, channels assigned to adjacent vertices must be at least 2 apart, while the same channel can be reused only at vertices whose distance is at least 3 or 4, respectively. Efficient channel assignment algorithms using the minimum number of channels are provided for specific, but realistic, network topologies, including buses, rings, hexagonal grids, bidimensional grids, cellular grids, and complete binary trees.