Further Comments on "An Optimal Solution for the Channel- Assignment Problem"
IEEE Transactions on Computers, 1981In 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
A hybrid method for channel assignment problems in cellular radio networks
IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006., 2006Because 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 +2 more sources
A new technique to the channel assignment problem in mobile communication networks
2008 IEEE 19th International Symposium on Personal, Indoor and Mobile Radio Communications, 2008Channel 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 +3 more
openaire +1 more source
A CHANNEL ASSIGNMENT PROBLEM IN MULTIHOP WIRELESS NETWORKS AND GRAPH THEORY
Journal of Circuits, Systems and Computers, 2004Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message and then send it to another terminal. In these networks, it is important to assign channels for communications to each terminal efficiently. There are some studies on this assignment problem using a conventional edge coloring
Hiroshi Tamura +3 more
openaire +2 more sources
Graph Coloring Algorithms and Applications to the Channel Assignment Problems
2012This 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 +2 more sources
On the Problem of Channel Assignment for Multi-NIC Multihop Wireless Networks
2005Multihop 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
1997Abstract 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
Channel Assignment Algorithms in Cognitive Radio Networks: Taxonomy, Open Issues, and Challenges
IEEE Communications Surveys and Tutorials, 2016Samee U Khan +2 more
exaly
Channel Assignment Schemes for Infrastructure-Based 802.11 WLANs: A Survey
IEEE Communications Surveys and Tutorials, 2010Ekram Hossain
exaly
On the Convergence and Optimality of Reweighted Message Passing for Channel Assignment Problems
IEEE Signal Processing Letters, 2014Marco Moretti +2 more
exaly