Discrete Mathematics and Radio Channel Assignment

2003 ◽  
pp. 27-63 ◽  
Author(s):  
C. McDiarmid
Keyword(s):  
Channel Assignment ◽  
Radio Channel ◽  
Discrete Mathematics

A Framework for External Interference-Aware Distributed Channel Assignment

2013 ◽  
pp. 293-307
Author(s):  
Felix Juraschek ◽  
Mesut Günes ◽  
Bastian Blywis
Keyword(s):  
Channel Assignment ◽  
Network Performance ◽  
Mesh Networks ◽  
Radio Channel ◽  
Radio Spectrum ◽  
Mesh Network ◽  
Wireless Devices ◽  
External Interference ◽  
Wireless Mesh ◽  
Assignment Algorithm

DES-Chan is a framework for experimentally driven research on distributed channel assignment algorithms in wireless mesh networks. DES-Chan eases the development process by providing a set of common services required by distributed channel assignment algorithms. A new challenge for channel assignment algorithms are sources of external interferences. With the increasing number of wireless devices in the unlicensed radio spectrum, co-located devices that share the same radio channel may have a severe impact on the network performance. DES-Chan provides a sensing component to detect such external devices and predict their future activity. As a proof of concept, the authors present a reference implementation of a distributed greedy channel assignment algorithm. The authors evaluate its performance in the DES-Testbed, a multi-transceiver wireless mesh network with 128 nodes at the Freie Universität Berlin.

Graph labeling and radio channel assignment

1998 ◽  
Vol 29 (4) ◽  
pp. 263-283 ◽  
Author(s):  
J. van den Heuvel ◽  
R. A. Leese ◽  
M. A. Shepherd
Keyword(s):  
Channel Assignment ◽  
Radio Channel ◽  
Graph Labeling

Cellular radio channel assignment using a modified Hopfield network

1997 ◽  
Vol 46 (4) ◽  
pp. 957-967 ◽  
Author(s):  
Jae-Soo Kim ◽  
Sahng Ho Park ◽  
P.W. Dowd ◽  
N.M. Nasrabadi
Keyword(s):  
Channel Assignment ◽  
Radio Channel ◽  
Hopfield Network ◽  
Cellular Radio

scholarly journals Radio Mean Labeling Of Paths And Its Total Graph

2021 ◽  
Vol 12 (1S) ◽  
pp. 343-350
Author(s):  
Meera Saraswathi, Et. al.
Keyword(s):  
Channel Assignment ◽  
Radio Channel ◽  
Graph Labeling ◽  
Total Graph ◽  
Mathematical Condition ◽  
Significant Application

A graph labeling problem is an assignment of labels to the vertices or edges (or both) of a graph G satisfying some mathematical condition. Radio Mean Labeling, a vertex-labeling of graphs with non-negative integers has a significant application in the study of problems related to radio channel assignment. The maximum label used in a radio mean labeling is called its span, and the lowest possible span of a radio mean labeling is called the radio mean number of a graph. In this paper, we obtain the radio mean number of paths and total graph of paths.

scholarly journals Cyclic Labellings with Constraints at Two Distances

10.37236/1769 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
R. A. Leese ◽  
S. D. Noble
Keyword(s):  
Linear Function ◽  
Channel Assignment ◽  
Radio Channel ◽  
Piecewise Linear ◽  
Piecewise Linear Function ◽  
Graph Distances ◽  
Complete Specification

Motivated by problems in radio channel assignment, we consider the vertex-labelling of graphs with nonnegative integers. The objective is to minimize the span of the labelling, subject to constraints imposed at graph distances one and two. We show that the minimum span is (up to rounding) a piecewise linear function of the constraints, and give a complete specification, together with the associated optimal assignments, for trees and cycles.

Sign in / Sign up

Export Citation Format

Share Document