Results 231 to 240 of about 17,802 (254)

A hybrid method for channel assignment problems in cellular radio networks

IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006., 2006
Because of the limited frequency spectrum and an increasing demand for cellular radio communication services, the problem of channel assignment becomes increasingly important. The channel assignment problem is to assign frequencies to requested calls in a cellular radio network subject to electromagnetic compatibility constraints such that required ...
S. Alireza, G. Shirazi, H. Amindavar
openaire   +1 more source

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

IEEE Transactions on Computers, 1981
In the above paper1Gupta, Lee, and Leung present a new algorithm for making an optimal assignment of wire segments to channels on a PC board. The new algorithm has a running time of 0(N log N) in the general case, but can be executed in 0(N) time if the wire segment endpoints are close to uniformly distributed.
openaire   +1 more source

Approximation Algorithms for Minimum Span Channel Assignment Problems

2006
We propose polynomial time approximation algorithms for minimum span channel (frequency) assignment problems, which is known to be NP-hard. Let α be the approximation ratio of our algorithm and W ≥2 be the maximum of numbers of channels required in vertices. If an instance is defined on a perfect graph G, then $\alpha \leq 1+(1+\frac{1}{W-1})\text{H}_{\
Yuichiro Miyamoto, Tomomi Matsui
openaire   +1 more source

A new technique to the channel assignment problem in mobile communication networks

2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, 2008
Channel allocation has been considered a NP-complete problem, and involves a very important issue for the adequate dimensioning of wireless communication networks. One of the possibilities for its solution involves the utilization of heuristics, able to produce near optimal solutions in an acceptable computational time. In this paper, a hybrid of GRASP
Carlos E. C. Vieira, Paulo R. L. Gondim, Carino A. Rodrigues, Jacir Luiz Bordim   +3 more
openaire   +1 more source

Channel assignment problem and relaxed 2-distant coloring of graphs

Discrete Applied Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Graph Coloring Algorithms and Applications to the Channel Assignment Problems

2012
This paper presents graph coloring algorithms and their applications to the channel assignment problems. Two application problems of frequency assignment of low power FM broadcasting and reader collision problem of RFID system are modeled as graph coloring problems.
openaire   +1 more source

On the Problem of Channel Assignment for Multi-NIC Multihop Wireless Networks

2005
Multihop wireless networks in which each node is equipped with multiple wireless NICs can utilize multiple wireless channels to improve performance. But how to assign wireless channels to interfaces to avoid collisions extremely while the network keeps a good topology is a problem not well solved for such a multi-NIC multihop wireless network.
Leiming Xu, Yong Xiang, Meilin Shi
openaire   +1 more source

A Unifled Approach to Problems in Radio Channel Assignment

1997
Abstract Many problems of resource allocation can be thought of in terms of constrained combinatorial optimization. The purpose of this paper is to apply such techniques to radio channel assignment, where constraints arise from the need to avoid excessive interference levels between different signals.
openaire   +1 more source

A new strategy for the application of genetic algorithms to the channel-assignment problem

IEEE Transactions on Vehicular Technology, 1999
exaly  

Tight Lower Bound for the Channel Assignment Problem

ACM Transactions on Algorithms, 2016
exaly