Results 241 to 250 of about 7,174,260 (287)

A chromatic approach to the fixed channel assignment problem

5th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications, Wireless Networks - Catching the Mobile Future., 2002
A cellular network with base stations forming a rectangular lattice is considered. Frequency band utilization depends on the chosen spatial frequency reuse scheme. Two fixed channel assignment schemes are suggested for the network under consideration. Characterization and comparison of the schemes are made.
S. P. Fedortsov, Boris S. Tsybakov
openaire   +2 more sources

A multi-objective approach to the Channel Assignment Problem

2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), 2008
With the rapid growth of mobile communications, solving the channel assignment problem has now become a new challenge in research. In this paper, we present the channel assignment problem (CAP) from a multi-objective approach. From this new idea, the communication system can be easily managed in case of an unexpected rise in demand in some particular ...
Jayrani Cheeneebash, José Antonio Lozano 0001, Harry C. S. Rughooputh   +2 more
openaire   +1 more source

Comments on "An Optimal Solution for the Channel-Assignment Problem"

IEEE Transactions on Computers, 1981
The main thrust of the above paper1appears to be a detailed restatement of the "left-edge algorithm" [1], [2] for channel routing. This algorithm is almost a decade old and is now quite familiar to most workers in the field of LSI design automation. That the authors did not reference this earlier work, and devoted much of their paper to a reexposition ...
G. Persky, Bou Nin Tien, B. S. Ting
openaire   +2 more sources

An analysis of channel assignment problems based on tours

Proceedings of ICC'97 - International Conference on Communications, 2002
A key to spectrum efficiency is the channel assignment problem (CAP), where frequency channels must be assigned to transmitters while minimizing bandwidth and keeping interference at acceptable levels. A method for obtaining lower bounds for the CAP is presented, which is based on representation of channel assignment as a tour through the network.
Jeannette C. M. Janssen, Kyriakos Kilakos   +1 more
openaire   +1 more source

Frequency Insertion Strategy for Channel Assignment Problem

Wireless Networks, 2006
This paper presents a new heuristic method for quickly finding a good feasible solution to the channel assignment problem (CAP). Like many other greedy-type heuristics for CAP, the proposed method also assigns a frequency to a call, one at a time. Hence, the method requires computational time that increases only linear to the number of calls.
Shin, WY, Chang, SY, Lee, J, Jun, CH
openaire   +2 more sources

The Channel Assignment Problem with Variable Weights

SIAM Journal on Discrete Mathematics, 2006
A l-graph $G$ is a (finite or infinite) graph with $k$ types of edges, $x_1$-edges,…, $x_k$-edges. A labeling $c$ of the vertices of $G$ by nonnegative reals is proper with respect to reals $x_1,\ldots,x_k$ if the labels of the end-vertices of an $x_i$-edge differ by at least $x_i$. The span of the labeling $c$ is the supremum of the labels used by $c$.
openaire   +1 more source

A genetic algorithm for channel assignment problems

European Transactions on Telecommunications, 1994
AbstractChannel assignment problems are NP‐complete optimization problems occurring during design of cellular radio systems. So far, these problems have been treated by sequential graph coloring algorithms [1, 2] and by heuristic techniques [3, 4]. On the other hand, genetic algorithms (GAs) were successfully applied to other NP‐complete problems.
openaire   +2 more sources

On channel assignment problem in cellular networks

Conference Record of the Thirty-First Asilomar Conference on Signals, Systems and Computers (Cat. No.97CB36136), 2002
The channel assignment problem in a mobile cellular network is considered in this paper. The cellular network is most often modelled as a graph and the channel assignment problem is formulated as the coloring problem of that graph. The channel assignment problem in its most general form is NP-complete.
T. Roxborough, S. Medidi, A. Sen
openaire   +1 more source

Genetic Modeling: Solution to Channel Assignment Problem

2005
Interference in wireless/mobile communications can be reduced by deploying efficient radio subsystems and by making use of channel assignment techniques. The number of frequencies assigned to each base station must be chosen large enough to satisfy the given demand in the corresponding cell.
Preeti R. Bajaj, Avinash G. Keskar, Amol Y. Deshmukh, Sanjay S. Dorle, Dinesh Padole   +4 more
openaire   +2 more sources

Channel Assignment Problem: A Fuzzy-Based Hybrid Approach

2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010
The increased usage of mobile devices and the scarce, regulated radio resources in wireless networks present a challenge to efficiently allocate channels to users. Existing algorithms designed to assign channels in a network range from dynamic channel allocation (DCA) algorithms to fixed channel allocation (FCA) algorithms - each with their own ...
Olufisayo Ekpenyong, Yasmin Hovakeemian, Kshirasagar Naik, Mohammad Towhidul Islam   +3 more
openaire   +1 more source