✦ LIBER ✦

Graph labeling and radio channel assignment

✍ Scribed by van den Heuvel, J.; Leese, R. A.; Shepherd, M. A.

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 438 KB
Volume: 29
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199812)29:4<263::aid-jgt5>3.0.co;2-v

No coin nor oath required. For personal study only.

✦ Synopsis

The vertex-labeling of graphs with nonnegative integers provides a natural setting in which to study problems of radio channel assignment. Vertices correspond to transmitter locations and their labels to radio channels. As a model for the way in which interference is avoided in real radio systems, each pair of vertices has, depending on their separation, a constraint on the difference between the labels that can be assigned. We consider the question of finding labelings of minimum span, given a graph and a set of constraints. The focus is on the infinite triangular lattice, infinite square lattice, and infinite line lattice, and optimal labelings for up to three levels of constraint are obtained. We highlight how accepted practice can lead to suboptimal channel assignments.

📜 SIMILAR VOLUMES

Channel assignment on Cayley graphs

✍ Patrick Bahls 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

We address various channel assignment problems on the Cayley graphs of certain groups, computing the frequency spans by applying group theoretic techniques. In particular, we show that if G is the Cayley graph of an n-generated group with a certain kind of presentation, then (G; k, 1) ≤ 2(k +n-1). F

Power control supported dynamic channel

Power control supported dynamic channel assignment in cellular radio systems

✍ L. Cong; E. Gunawan; B. H. Soong; C. B. Soh 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 2 views

Transmitter power control is an effective technique to reduce co-channel interference and increase system capacity for cellular radio networks. Dynamic channel assignment can also be used to improve spectrum efficiency and thus increases the system capacity. This paper investigates channel assignmen

Graph distance-dependent labeling relate

Graph distance-dependent labeling related to code assignment in computer networks

✍ Xiaohua Teresa Jin; Roger K. Yeh 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

Optimal radio channel assignment through

Optimal radio channel assignment through a new binary dynamic simulated annealing algorithm

✍ Fahad S. Al-Khaled 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 427 KB

The radio channel assignment problem (CAP) is classified as an NP-complete binary optimization problem, which creates the need for faster, yet optimal optimization algorithms to reduce the time of computation when solving such a complex problem. Simulated annealing (SA), a powerful optimal combinato

Channel assignment and weighted coloring

✍ Colin McDiarmid; Bruce Reed 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB

A compact dynamic channel assignment sch

A compact dynamic channel assignment scheme based on Hopfield networks for cellular radio systems

✍ A. Dang; S. Zhu 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 193 KB

## Abstract In this paper, a new channel assignment strategy named compact dynamic channel assignment (CDCA) is proposed. The CDCA differs from other strategies by consistently keeping the system in the utmost optimal state, and thus the scheme allows to determine a call succeeding or failing by lo