Results 211 to 220 of about 17,802 (254)

Lower Bounds from Tile Covers for the Channel Assignment Problem

SIAM Journal on Discrete Mathematics, 2005
Summary: A method to generate lower bounds for the channel assignment problem is given. The method is based on the reduction of the channel assignment problem to a problem of covering the demand in a cellular network by preassigned blocks of cells called tiles.
Jeannette Cm Janssen
exaly   +3 more sources

The Channel Assignment Problem

1983 IEEE Symposium on Security and Privacy, 1983
An optimization problem exists in the context of local area network security. The network provides a number of physical or logical "channels", each carrying a set of levels or compartments of information. A channel is accessible to users cleared for all the levels it carries.
Bahaa W. Fam, Jonathan K. Millen
openaire   +1 more source

A new lower bound for the channel assignment problem

IEEE Transactions on Vehicular Technology, 2000
The strength of lower bounds for the span in channel assignment problems is discussed with reference to standard benchmark problems. It is shown that in some circumstances current bounds are capable of very significant improvement. The use of methods from mathematical programming is outlined and a new lower bound applicable to cellular problems is ...
Derek H. Smith, Stephen Hurley, Stuart M. Allen   +2 more
openaire   +1 more source

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   +1 more source

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

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   +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   +1 more source

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