Conference Paper
Genetic algorithms for optimal channel assignment in mobile communications
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
DOI: 10.1109/ICONIP.2002.1202815 Conference: Neural Information Processing, 2002. ICONIP '02. Proceedings of the 9th International Conference on, Volume: 3 Source: IEEE Xplore

Article: A neural network parallel algorithm for channel assignment problems in cellular radio networks
[Show abstract] [Hide abstract]
ABSTRACT: The channel assignment problem involves not only assigning channels or frequencies to each radio cell. but also satisfying frequency constraints given by a compatibility matrix. The proposed parallel algorithm is based on an artificial neural network composed of nm processing elements for an n cell m frequency problem. The algorithm runs not only on a sequential machine but also on a parallel machine with up to a maximum of nm processors. The algorithm was tested by solving eight benchmark problems where the total number of frequencies varied from 100 to 533. The algorithm found the solutions in nearly constant time with nm processors. The simulation results showed that the algorithm found better solutions than the existing algorithm in one out of eight problemsIEEE Transactions on Vehicular Technology 12/1992; · 2.06 Impact Factor  [Show abstract] [Hide abstract]
ABSTRACT: The growing communication demands of modern warfare must be met with the fixed resources of the electromagnetic spectrum. When an armed force is deployed, frequencies must be assigned, within a restricted bandwidth and in a short timescale, to its many (e.g. 400) radios so as to minimise the interference between them. There are too many ways in which a frequency allocation can be made for them all to be evaluated; instead the best assignment that can be discovered within a limited time must be chosen. This is typical of a class of problems known as combinatorial optimisation problems. This paper discusses some of the methods which can be used for solving such problems and presents results for a hybrid algorithm based on construction methods, tabu search and genetic algorithms which has been developed at DERAMalvernElectronics &Communications Engineering Journal 05/2000;  [Show abstract] [Hide abstract]
ABSTRACT: The problem of assigning appropriate channels to the individual members of a cellular network is one of the most important challenges facing network designers. Heuristics have been used to solve this problem, although in recent years parallel distributed methods have also been suggested. In this paper, we investigate how an evolutionary computing technique known as genetic algorithms (GAs) may be used. These global optimization techniques can avoid many of the shortcomings exhibited by local search methods on difficult search spaces. The approach is tested on a homogeneous cellular network consisting of 49 cells. The critical aspects of this technique and the additional improvements are also discussedIntelligent Information Systems,1994. Proceedings of the 1994 Second Australian and New Zealand Conference on; 01/1994
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.