๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Graph Theoretic Approach for Channel Assignment in Cellular Networks

โœ Scribed by Mihaela Iridon; David Matula; Cheng Yang

Book ID
110312263
Publisher
Springer
Year
2001
Tongue
English
Weight
194 KB
Volume
7
Category
Article
ISSN
1022-0038

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On-line algorithms for the channel assig
On-line algorithms for the channel assignment problem in cellular networks
โœ Pilu Crescenzi; Giorgio Gambosi; Paolo Penna ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 364 KB

We consider the on-line channel assignment problem in the case of cellular networks and we formalize this problem as an on-line load balancing problem for temporary tasks with restricted assignment. For the latter problem, we provide a general solution (denoted as the cluster algorithm) and we chara

A channel assignment problem for optical
A channel assignment problem for optical networks modelled by Cayley graphs
โœ Sanming Zhou ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 239 KB

A problem arising from a recent study of scalability of optical networks seeks to assign channels to the vertices of a network so that vertices distance 2 apart receive distinct channels. In this paper we introduce a general channel assignment scheme for Cayley graphs on abelian groups, and derive u

An expanded maximum neural network algor
An expanded maximum neural network algorithm for a channel assignment problem in cellular radio networks
โœ Katsuyoshi Ikenaga; Yoichi Takenaka; Nobuo Funabiki ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 247 KB ๐Ÿ‘ 2 views

In this paper, we propose a neural network algorithm that uses the expanded maximum neuron model to solve the channel assignment problem of cellular radio networks, which is an NP-complete combinatorial optimization problem. The channel assignment problem demands minimizing the total interference be