Results 221 to 230 of about 17,802 (254)
Some of the next articles are maybe not open access.
Channel Assignment Problem: A Fuzzy-Based Hybrid Approach
2010 IEEE Global Telecommunications Conference GLOBECOM 2010, 2010The 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 +3 more
openaire +1 more source
A fast constructive algorithm for fixed channel assignment problem
ISCAS 2001. The 2001 IEEE International Symposium on Circuits and Systems (Cat. No.01CH37196), 2002With limited frequency spectrum and an increasing demand for mobile communication services, the problem of channel assignment becomes increasingly important. It has been shown that this problem is equivalent to the graph-coloring problem, which is an NP-hard problem. In this work, a fast constructive algorithm is introduced to solve the problem.
Junaid A. Khan +2 more
openaire +1 more source
Genetic Modeling: Solution to Channel Assignment Problem
2005Interference 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 +4 more
openaire +1 more source
A permutation based technique for channel assignment problem
2010 IEEE Student Conference on Research and Development (SCOReD), 2010Channel assignment problem is an example of NP-complete problem in which the complexity and level of difficulty depends on the input parameters of a particular condition. Therefore, a good technique with an efficient optimization approach will produce a good assignment if not optimum.
Saiful Izwan Suliman +3 more
openaire +1 more source
A genetic algorithm for the channel assignment problem
IEEE GLOBECOM 1998 (Cat. NO. 98CH36250), 2002This paper considers a genetic algorithm approach to the channel or frequency assignment problem in cellular telephone networks. This NP-hard problem is commonly solved using heuristics such as simulated annealing, neural networks and genetic algorithms.
openaire +1 more source
An optimal solution to the "Philadelphia" channel assignment problem
IEEE Transactions on Vehicular Technology, 1999The Philadelphia problem is often used as a test problem in channel assignment research. Given a cellular network, the demand in each cell, and a number of interference constraints, the question is to determine the minimum span (number of consecutive channels) of any valid channel assignment.
J.C.M. Janssen, K. Kilakos
openaire +1 more source
Additional Comments on "An Optimal Solution for the Channel- Assignment Problem"
IEEE Transactions on Computers, 1981The problem stated and solved in the above paper1has been solved before with essentially the same algorithm by Hashimoto and Stevens.
openaire +1 more source
A set theory approach to the channel assignment problem
1994 IEEE GLOBECOM. Communications: The Global Bridge, 2002A set-theory framework on the channel assignment problem is presented in this paper. This framework provides a uniform interpretation for the two classes of channel assignment approaches: (1) the centralized assignment based on a predetermined "channel separation matrix", being employed in cellular frequency planning, and (2) the distributed assignment
null Xi-Ren Cao, J.C.-I. Chuang
openaire +1 more source
A competitive scheduling problem and its relevance to UMTS channel assignment
Networks, 2004AbstractThis article investigates a two‐user competitive scheduling problem. The problem arises in a Universal Mobile Telecommunication System (UMTS) developed within the European IST project FUTURE: given two mobile terminals, one wants to maximize the on‐time data packets transmitted to one user, while guaranteeing a certain amount of on‐time data ...
ARBIB, CLAUDIO +2 more
openaire +1 more source
A Recurrent Neural Network for Channel Assignment Problems in Mobiles
2010The Channel Assignment Problem (CAP) is an NP-complete problem. Different algorithms have been proposed based on techniques of combinatorial optimization. In this paper, the problem is formulated as a minimizing problem of a quadratic function with quadratic restrictions and binary variables. To solve this problem a binary recurrent neural network (RNN)
Gracián Triviño +2 more
openaire +1 more source