Adaptive Hybrid Channel Assignment in Wireless Mobile Network via Genetic Algorithm
|
|
- Gillian Waters
- 5 years ago
- Views:
Transcription
1 Adaptive Hybrid Channel Assignment in Wireless Mobile Network via Genetic Algorithm Y.S. Chia Z.W. Siew A. Kiring S.S. Yang K.T.K. Teo Modelling, Simulation and Computing Laboratory School of Engineering and Information Technology Universiti Malaysia Sabah Kota Kinabalu, Malaysia Abstract In wireless mobile network, the challenge is to assign appropriate frequency spectrum channels to requested calls while maintaining a desirable level of electromagnetic compatibility (EMC) constraint. An effective channel assignment technique is important to improve the system capacity and to reduce the effect of the interference. Most of the existing channel assignment approaches are based on deterministic methods. In this paper, an adaptive hybrid channel assignment (HCA) technique based on genetic algorithm (GA) is proposed. The proposed GA based optimization in HCA scheme is capable to adapt the population size to the number of eligible channels for a particular cell upon new call arrivals in order to achieve faster convergence speed. Besides, the proposed approach can handle both the reassignment of existing calls as well as the allocation of channel to a new call in an adaptive process to maximize the utility of the limited frequency spectrum. The simulation for both uniform and nonuniform traffic distributions on a 49- cells network model show that the average new incoming call blocking or call dropping probability for the proposed hybrid channel optimization method is lower than the deterministic HCA methods. Keywords - evolutionary optimization; genetic algorithm; hybrid channel assignment; wireless mobile network I. INTRODUCTION The extraordinary development and rapid growth of cellular radio network results in the expansion of wireless mobile communications. The rapid growing in the number of users requires a major effort to enhance the performance of wireless communication system. Due to the current development in the communication system is extremely limited by the capacity constraints of the available frequency spectrum, proper utilization of channel allocation techniques which are capable of ensuring efficient channel allocation is essential in solving the channel assignment problem. The channel assignment problem is classified as two types, one of the earlier aims is to assign the required number of channels to each cell in such a way that interference has been precluded and it aims to use the frequency spectrum more efficiently. This problem is called CAP1 and it is NPhard. Another type of channel assignment problem is minimizing the interference while satisfying the demand for channel upon call requests, where this type of problem is called CAP2. CAP2 assumes that interference-free channel assignments do not exist for a given range of frequency spectrums [1]. In general, the channel assignment approaches can be classified into fixed and dynamic. In fixed channel assignment (FCA), the set of channels are permanently allocated to each cell in advance according to predetermined traffic demand. On the other hand, dynamic channel assignment (DCA) refers to the set of available channels assigned dynamically to each cell upon request. The FCA system does not adapt to the change of traffic loads although it is simpler. Therefore DCA surpass FCA in dealing with changing traffic demands, however it has the drawback of consuming more computational effort under heavy traffic load [2]. In order to overcome the drawbacks of the FCA and DCA, a few combinations of the above methods are introduced, for instance the hybrid channel assignment (HCA) and the borrowing channel assignment (BCA). HCA combines the features of both the FCA and DCA schemes. In HCA, the set of available channels is divided onto two subsets, where one set of channels is allocated as the FCA scheme, while the other set is allocated as the DCA scheme. In BCA scheme, the channel assignment is initially fixed as FCA. However the cell will attempt to borrow channel from its neighboring cells when the corresponding cell s channels are fully occupied upon incoming call request to prevent call blocking [3]. Most of the existing channel allocation methods are based on the deterministic methods. These methods require a set of known input parameters and rules to predict the channel assignment results. However, the channel assignment becomes difficult to be solved by the deterministic methods due to its complexity and computational time issues [3]. Technique of frequency reuse has been proposed to maximize the frequency spectrum capacity in cellular network. Frequency reuse concept comprises of using the same frequency channel simultaneously with other cells subject to the base transceiver station (BTS) distance. However this technique would lead to EMC interferences. Hence an efficient frequency reuse pattern is necessary to /11/$26.00 c 2011 IEEE 511
2 minimize the interferences. There are numbers of heuristics approaches being suggested to overcome the channel assignment problems based on fixed reuse distance concept such as neural networks (NNs) in [1], simulated annealing (SA) in [4], Tabu search (TS) in [5] and genetic algorithm (GA). The evolutionary algorithm (EA) approaches such as GA outperforms other methods such as NNs, SA and TS, in terms of the ability to explore information over search spaces [6]. This type of algorithm can be used to solve complicated optimization task, such as optimal-local, multi-constrained and NP-complete problems [7]. GA originates from the principal of natural selection and survival of the fittest. The algorithm is capable to obtain solutions in highly-nonlinear problems, which are characterized by multimodal solution space [8]. GA can be defined as highly parallel mathematics algorithm by [9] which transforming the population, each with an associated fitness value, into a new generation using operations based on the theories of evolution. Several GA-based approaches have been used to solve the channel assignment problem. For instance, [10] defined an asexual crossover and a special mutation to solve the channel assignment problem. However such crossover will easily destroy the structure of current solution and thus, causing the algorithm difficult to converge. In addition, [11] represented the channel assignment solution as a string of channel numbers which are grouped in such a way that each cell has a specified number of channels rather than using binary string. The results satisfied the traffic requirement. The evolution is then advanced with a partially matched crossover operator (PMX) and basic mutation. In this paper, HCA optimization algorithm based on GA will be presented to solve the channel assignment problem which is categorized as CAP1. The population size of this algorithm is designed to adapt to the number of eligible channels upon new call request for a particular cell, instead of maintaining a fixed population size throughout the simulation. This would ensure that a more reasonable convergence speed can be achieved compared to the fixed population size. II. OVERVIEW OF CHANNEL ASSIGNMENT PROBLEM A. Channel Assignment Constraints The frequency reuse concept in a channel would cause EMC constraint interferences with other channels, which may degrade the quality of the service. There are three types of interference namely co-channel constraint (CCC), adjacent channel constraint (ACC), and co-site channel constraint (CSC). CCC is due to the allocation of the same channel to certain pair of the cells within the BTS distance or reuse distance simultaneously. ACC is caused by the allocation of the adjacent channels to certain pairs of the cells simultaneously and CSC is due to the separation is less than some minimum spectral distance when channels are allocated in the same cell. These EMC constraints are known as hard constraints. There are soft constraints to help in reducing the call blocking probabilities besides the hard constraints. They are the resonance condition, packing condition, and the limitation of reallocation. The resonance condition maximizes the use of channels within the same reuse scheme by allowing the same channels to be assigned to cells that belong to the same reuse scheme. This would greatly reduce the call blocking probabilities. On the other hand, the packing condition allows the use of minimum number of channels each time upon new call requests. Hence it permits the repeated selection of the channels used in other cells as long as the CCC interference is maintained. In DCA, the reallocation process upon a new call arrival will reduce the call blocking probability, but it consumes more time and computation effort. Therefore the limitation of reallocation limits this process being applied only to the cells which involved in new call arrival. This could reduce the situation of excessive reassignment in a cell by attempting to assign the channels which are already assigned before. B. Frequency Reuse Scheme The reuse of channels would cause CCC interference depends on the reuse distance. The channels assigned in different cells need to be separated by a reuse distance which is sufficient enough to reduce the CCC interference to a tolerable level. This ensures that each channel can be reused many times without affected by the CCC interference. The reuse distance is the minimum distance required between the centers of two cells which are using the same channel to maintain the desired signal quality. The distance between the centers of two adjacent cells is considered as a unit distance. The cells with center-to-center distance equals to or multiple of reuse distance belong to the same reuse scheme. Cells may use the same channels within the same reuse scheme. The total number of channel sets that can be formed from the whole frequency spectrum is determined by the number of cells per reuse scheme. Longer reuse distance causes smaller CCC interference level. However, this results in smaller reuse efficiency. Thus the reuse patterns need to be designed by maintaining both the CCC interference level and the reuse efficiency. In this proposed scheme, the co-channel cells are located with a reuse distance of 3 units. This divides the network topology model of 49-cells into seven different reuse schemes. The co-channel cell matrix for reuse scheme is shown in Table I. According to Table I, the co-channel cell matrix consists of a 7 7 matrix with rows represent the y coordinate of the cells and columns represent the x coordinate of the cells. Each cell in the same reuse scheme can be determined with Manhattan distance, where horizontal path length is 2, and vertical path length is 1, means x coordinate moves two units distance and y coordinate moves one unit distance to obtain the required three unit of the reuse distance. In Table I, the two cells belong to the same reuse scheme if the i th row and th International Conference on Hybrid Intelligent Systems (HIS)
3 column of the co-channel matrix contains the same number for the two cells. C. Cellular Traffic Model Assumption The proposed cellular traffic model is simulated based on blocked-calls-cleared principle. It means if the entire set of channels in the cellular network is in use in cell involved in new call request and its neighborhood within reuse distance, the call is blocked and dropped with no queuing of the blocked calls. There are 70 channels available in this model to be allocated for incoming calls. The cellular topological model consists of 49 hexagonal cells to form a parallelogram structure, with equal number of cells along both axes. The simulation call traffic distribution can be either uniform or nonuniform distribution. Uniform cellular traffic distribution indicates that every cell has the same traffic load or demand. On the other hand, nonuniform cellular traffic distribution indicates that there is different traffic load in each cell. The nonuniform traffic patterns implemented in this model is shown in Table II. This pattern is used as the initial call rate for simulation. Each of the value represents the average call arrival rate per minute for the corresponding cell. In this case, the average call holding time is 180 seconds. j th III. PROBLEM REPRESENTATION IN HCA SCHEME The channel assignment problem comprises of the assignment of the required channel number to each cell where the interference is avoided. The frequency spectrum is used efficiently with possible reassignment of channel to the ongoing calls in the cell. Assume that a new call arrives in cell k with t 1 existing calls. Then a potential solution vector, V k represents the possible allocation of channels to ongoing calls and the new call at cell k. A chromosome in the genetic representation is expressed as the solution vector of length t, where each gene is a channel number being assigned to a call in cell k. The advantage of this representation is that it consumes shorter computational time to manipulate the vector due to the length of this solution vector is short. In HCA scheme, the whole set of available channels in the system is divided into two sets, which are the fixed set and the dynamic set. When a new call arrives in a cell, the scheme first attempts to serve the call from the fixed set of channels. When all the channels in the fixed set are in use, the system would serve the call with the DCA scheme which is optimized by GA. The simulation of the call arrival event for HCA scheme is shown in Fig. 1. IV. GENETIC REPRESENTATION GA is a useful approach in searching for an optimum solution in the channel assignment problem. It is different Call arrival in cell k y- coordinate TABLE I. CO-CHANNEL CELL MATRIX x-coordinate Yes Free channel in fixed set of cell k? No FCA Update FCA allocation matrix No Call blocking Free channel in dynamic set of cell k? Yes TABLE II. y- coordinate NONUNIFORM TRAFFIC DISTRIBUTION (SIMULATION CALLS/MINUTE) x-coordinate Yes Allocate the only channel and update the DCA allocation matrix Is only one channel free? No Call arrival process completed DCA optimized with GA Figure 1. Simulation of call arrival event in HCA scheme optimized with GA strategy th International Conference on Hybrid Intelligent Systems (HIS) 513
4 from deterministic methods because GA uses randomization. The generic GA which consists of initial population, selection, crossover and mutation, is modified to be implemented with the DCA optimization scheme. A. Initial Population The generation of the initial population for possible channel allocation solutions, V k is the initial stage of the GA algorithm. Upon a new call requests in cell k, a set of eligible channels E(k) is determined in order to assign a possible channel to the new call. In this case E( k) = S ( O( k) P( k)), where S is the entire set of available channels, O(k) is the set of channels allocated to the existing calls in cell k, and P(k) is the set of channels used in the neighboring cells which less than the reuse distance with cell k. All the information related to channel usage can be obtained from the channels allocation matrix A. The initial population consists of the solution vectors with length equals to the magnitude of vector E(k), where each solution contains a unique integer chosen from E(k). Then the remaining (t 1) integers in all the solution vectors are the channels allocated to the ongoing calls in cell k. B. Fitness Function After the generation of the population, a quality measure is necessary to decide the fitness value of each individual among the population, which is called fitness function. As mentioned before, there are soft constraints such as packing condition, the resonance condition and the limitation of reassignment which further reduce the call dropping probabilities besides the hard constraints. These soft constraints are modeled as the fitness function as shown in (1). t F = C. reuse( i, k) Ai, V k, j j = 1i= 1i k k t C k Ai, V k k j j= i= i k dis i k A,, 1 1 (, ) j= 1 k 1 t. (1) where k defines the cell coordinates when a call arrives; t k defines the total number of channels allocated to cell k; C defines the total number of cells in the network model; V k defines the solution vector for cell k with dimension t k ; V k,j defines the j th element of vector V k ; A i,vk,j defines the element at i th row and V k,j -th column of the channels allocation matrix A; dis(i,k) defines the distance between cells i and k; reuse(i,k) defines a function that returns a value of 0 if the cells i and k belong to the same reuse scheme, otherwise return as 1. In (1), the first term represents the resonance condition, where the fitness value increases if the j th element of vector V k, j V k is used in cell i where cells i and k does not belong to the same reuse scheme. The second term represents the packing condition where the fitness value decreases if the j th element of vector V k is used in cell i, and cells i and k are free from CCC interference. The fitness value decreases with the distance between cells i and k. On the other hand, the last term represents the limiting reassignment condition, where the fitness value decreases if the new allocation for the ongoing calls in cell k is the same as the previous allocation. The minimization of (1) determines the fittest individual in order to find the optimal channel allocation solution. C. Mutation A mutation rate is selected in order to indicate the probability for a gene in the chromosome to mutate. A low mutation rate is sufficient to prevent any gene in the chromosome to remain fixed to a single value in the population. On the other hand, a high mutation rate will result in random global search for optimal solution. Therefore a moderated value needs to be selected to maintain a balance between such extremes. The parent chromosome is iterated through and randomly determines whether the gene will mutate according to the mutation rate. When the gene which is represented by the channel number is decided to undergo mutation, it will swap the value with the corresponding vector of eligible channels. This process can always produce feasible child chromosome since it does not affect the length of the parent chromosome and does not produce any duplicated channel number. D. Crossover A crossover rate is selected to indicate the probability for parents vectors to crossover to produce a better child chromosome which takes the best characteristics from each of the parents. The proposed crossover strategy is one-point crossover to reduce the computational cost. A single crossover point is selected for both parents vectors. Then the channel numbers which are beyond the crossover point in both vectors are swapped, and results in the child chromosome. V. SIMULATION RESULTS AND DISCUSSIONS In the simulation, the performance of the proposed GA based algorithm for the HCA scheme is evaluated in terms of the blocking probability or dropping probability for the incoming calls. The call blocking probability is calculated by the ratio of the total number of new call blocked and the total number of call arrived in the cellular network system. The performance of the proposed algorithm is compared with HCA scheme which is based on deterministic method, where the channel allocation results are always the same at each simulation without the optimization by GA. The HCA scheme with deterministic method is based on channelordering property, where the first channel in the set of eligible channels is given the highest priority to be assigned to new call request. The representative ratios applied in the algorithm are 21:49 (21 channels in fixed set and 49 channels in the th International Conference on Hybrid Intelligent Systems (HIS)
5 dynamic set), 35:35, and 49:21. An example of a valid assignment of channels which fulfills the EMC constraints for the 21:49 representative ratio of the HCA scheme is shown in Fig. 2. This simulation result is optimized by GA and run under nonuniform call traffic distribution using Table II as the initial rate. Fig. 3 shows the call blocking probability result under nonuniform call traffic distribution according to Table II as the initial traffic rates. On the other hand, Fig. 4 shows the call blocking probability performance under uniform traffic distribution with average 15 calls per minute as the initial traffic rate. In the simulation results, the percentage increase of traffic load implies that the traffic rates for each of the cell increased by a percentage with respect to the initial traffic rates. The increase is ranging from a percentage of 0 to 60, with respect to the initial traffic rates. According to Fig. 3, under nonuniform traffic distribution, the lowest call blocking probability is obtained by the 21:49 HCA-GA scheme compared with the other representative ratios as well as the HCA scheme based on deterministic method without GA optimization. The same observation can be obtained from Fig. 4, where the lowest blocking probability is obtained by the 21:49 HCA-GA scheme under uniform traffic distribution. However the 49:21 HCA-GA consumes the shortest running time due to most of its channels are allocated permanently and hence save the time on searching for global minimum on the dynamic set of the channels. Besides that, the characteristics of the GA-based HCA scheme is illustrated in Fig. 5 for the representative ratios of 49:21, 35:35 and 21:49 respectively. According to Fig. 5, the smallest average number of generations required to converge refer to 49:21, which is approximately 5 generations as compared to the 35:35 and 21:49 schemes which require approximately 6 and 7 generations respectively. Therefore the 35:35 HCA-GA scheme can be used to maintain a balance between the extremes of call blocking probability and computational effort. Channel Number Call Blocking Probability :49 HCA-GA 35:35 HCA-GA 49:21 HCA-GA 21:49 HCA 35:35 HCA 49:21 HCA Cell Number Figure 2. A channel assignment result for the DCA allocation matrix with 21:49 representative ratio under nonuniform traffic distribution at iteration= Percentage Increase of Traffic Load Figure 4. Call blocking performance of HCA-GA for the cellular network with uniform traffic distribution and comparison with the deterministic channel allocation schemes. Call Blocking Probability :49 HCA-GA 35:35 HCA-GA 49:21 HCA-GA 21:49 HCA 35:35 HCA 49:21 HCA Fitness function :21 HCA-GA 35:35 HCA-GA 21:49 HCA-GA Percentage Increase of Traffic Load Figure 3. Call blocking performance of HCA-GA for the cellular network with nonuniform traffic distribution and comparison with the deterministic channel allocation schemes Number of generations Figure 5. Characteristics of GA-based HCA scheme for the representative ratios of 49:21, 35:35 and 21: th International Conference on Hybrid Intelligent Systems (HIS) 515
6 It can be concluded that when the proposed GA based approach is applied to the HCA scheme, the simulation results in Fig. 3 and Fig. 4 show that for all the representative ratios, GA-based HCA scheme always shows better performance in terms of call blocking probability, under both uniform and nonuniform traffic distribution conditions. Among all the representative ratios, the best performance in terms of call blocking is obtained by the 21:49 HCA-GA scheme. However, in terms of the performance of computation time, HCA-GA scheme is faster. VI. CONCLUSION An optimization algorithm based on GA is proposed to solve the NP-completed CAP1 in a cellular mobile network, with better performance in terms of call blocking probability compared to the other HCA scheme based on deterministic method. It can mimic the evolutionary process in nature to optimize the channel assignment problem. GA consists characteristics to evolve through generations and to select the fittest chromosome ensure that it can be self-optimized. The concept of channel reuse scheme avoids the allocation of channels which would cause CCC interference. Hence the computation time to determine this type of interference in the process of channel allocation is reduced. Besides, the combination of the integer genetic representation, the mutation operator and the crossover operator guarantees that the optimum solution can always be found. In addition, the proposed HCA scheme which consists the fixed set of channels is created by equally distributing the channels to all the cells at different reuse scheme. In future, an evolutionary optimization method can be used to assign the channels from the fixed set based on the call traffic load of the cell. REFERENCES [1] K.A. Smith, and M. Palaniswami, Static and dynamic channel assignment using neural networks, IEEE J. Select. Areas Commun, vol. 15, pp , [2] G. Vidyarthi, A. Ngom, and I. Stojmenovic, A hybrid channel assignment approach using an efficient evolutionary strategy in wireless mobile network, IEEE Trans. Veh. Techno, vol. 54, pp , [3] H.G. Sansalidis, P.P. Stavroulakis, and J. Rodriguez-Tellez, An efficient evolutionary algorithm for channel resource management in cellular mobile systems, IEEE Trans. Evol. Comput, vol. 2, pp , [4] J. Chen, S. Olafsson, and X. Gu, Observation on using simulated annealing for dynamic channel allocation in WLANs, Proc. VTC Spring, pp , [5] C.Y. Lee, and H.G. Kang, Cell planning with capacity extension in mobile communications: a tabu search approach, IEEE Trans. Veh. Technol., vol. 49, pp , [6] M.A. C. Lima, A.F.R. Araujo, and A.C. Cesar, Dynamic channel assignment in mobile communications based on genetic algorithms, 13th IEEE International Symposium on Personal, Indoor and Mobile Radio Communication, vol. 5, pp , [7] J. Yoshino, and I. Othomo, Study on efficient channel assignment method using the genetic algorithm for mobile communication systems, Journal Soft Computing A Fusion of Foundation, Methodologies and Applications, vol. 9, pp , [8] L.M. San Jose-Reveuelta, A new adaptive genetic algorithm for fixed channel assignment, Journal Information Sciences, vol. 177, pp , [9] S.C. Ghosh, B.P. Sinha, and N. Das, Channel assignment using genetic algorithm based on geometric symmetry, IEEE Trans. Veh. Techno., vol. 52, pp , [10] M. Cuppini, A genetic algorithm for channel assignment problems, European Trans. Telecom. Rel. Techn., vol. 5, pp , [11] W.K. Lai, and G.C. Coghill, Channel assignment through evolutionary optimization, European Trans. Telecom. Rel. Techn., vol. 45, pp , ACKNOWLEDGMENT The authors would like to acknowledge the financial assistance of the Ministry of Higher Education of Malaysia (MoHE) under Fundamental Research Grant Schemes (FRGS) no. FRG0104-TK-1/ th International Conference on Hybrid Intelligent Systems (HIS)
Evolutionary Optimization for the Channel Assignment Problem in Wireless Mobile Network
(649 -- 917) Evolutionary Optimization for the Channel Assignment Problem in Wireless Mobile Network Y.S. Chia, Z.W. Siew, S.S. Yang, H.T. Yew, K.T.K. Teo Modelling, Simulation and Computing Laboratory
More informationAN EVOLUTIONARY ALGORITHM FOR CHANNEL ASSIGNMENT PROBLEM IN WIRELESS MOBILE NETWORKS
ISSN: 2229-6948(ONLINE) DOI: 10.21917/ict.2012.0087 ICTACT JOURNAL ON COMMUNICATION TECHNOLOGY, DECEMBER 2012, VOLUME: 03, ISSUE: 04 AN EVOLUTIONARY ALGORITHM FOR CHANNEL ASSIGNMENT PROBLEM IN WIRELESS
More informationGenetic Algorithms for Optimal Channel. Assignments in Mobile Communications
Genetic Algorithms for Optimal Channel Assignments in Mobile Communications Lipo Wang*, Sa Li, Sokwei Cindy Lay, Wen Hsin Yu, and Chunru Wan School of Electrical and Electronic Engineering Nanyang Technological
More informationOPTIMAL CHANNEL ALLOCATION WITH DYNAMIC POWER CONTROL IN CELLULAR NETWORKS
OPTIMAL CHANNEL ALLOCATION WITH DYNAMIC POWER CONTROL IN CELLULAR NETWORKS ABSTRACT Xin Wu, Arunita Jaekel and Ataul Bari School of Computer Science, University of Windsor 401 Sunset Avenue, Windsor, ON,
More informationChapter 1 Introduction
Chapter 1 Introduction 1.1Motivation The past five decades have seen surprising progress in computing and communication technologies that were stimulated by the presence of cheaper, faster, more reliable
More informationETI2511-WIRELESS COMMUNICATION II HANDOUT I 1.0 PRINCIPLES OF CELLULAR COMMUNICATION
ETI2511-WIRELESS COMMUNICATION II HANDOUT I 1.0 PRINCIPLES OF CELLULAR COMMUNICATION 1.0 Introduction The substitution of a single high power Base Transmitter Stations (BTS) by several low BTSs to support
More informationSECTOR SYNTHESIS OF ANTENNA ARRAY USING GENETIC ALGORITHM
2005-2008 JATIT. All rights reserved. SECTOR SYNTHESIS OF ANTENNA ARRAY USING GENETIC ALGORITHM 1 Abdelaziz A. Abdelaziz and 2 Hanan A. Kamal 1 Assoc. Prof., Department of Electrical Engineering, Faculty
More informationA.S.C.Padma et al, / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 2 (6), 2011,
An Efficient Channel Allocation in Mobile Computing A.S.C.Padma, M.Chinnaarao Computer Science and Engineering Department, Kakinada Institute of Engineering and Technology Korangi, Andhrapradesh, India
More informationChapter 8 Traffic Channel Allocation
Chapter 8 Traffic Channel Allocation Prof. Chih-Cheng Tseng tsengcc@niu.edu.tw http://wcnlab.niu.edu.tw EE of NIU Chih-Cheng Tseng 1 Introduction What is channel allocation? It covers how a BS should assign
More informationAn Analysis of Genetic Algorithm and Tabu Search Algorithm for Channel Optimization in Cognitive AdHoc Networks
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 3, Issue. 7, July 2014, pg.60
More informationDISTRIBUTED DYNAMIC CHANNEL ALLOCATION ALGORITHM FOR CELLULAR MOBILE NETWORK
DISTRIBUTED DYNAMIC CHANNEL ALLOCATION ALGORITHM FOR CELLULAR MOBILE NETWORK 1 Megha Gupta, 2 A.K. Sachan 1 Research scholar, Deptt. of computer Sc. & Engg. S.A.T.I. VIDISHA (M.P) INDIA. 2 Asst. professor,
More informationWireless Communications Principles and Practice 2 nd Edition Prentice-Hall. By Theodore S. Rappaport
Wireless Communications Principles and Practice 2 nd Edition Prentice-Hall By Theodore S. Rappaport Chapter 3 The Cellular Concept- System Design Fundamentals 3.1 Introduction January, 2004 Spring 2011
More informationSatellite constellation design and radio resource management using genetic algorithm
Satellite constellation design and radio resource management using genetic algorithm M. Asvial, R. Tafazolli and B.G. Evans Abstract: Novel strategies for automatic satellite constellation design with
More informationPerformances Analysis of Different Channel Allocation Schemes for Personal Mobile Communication Networks
Performances Analysis of Different Channel Allocation Schemes for Personal Mobile Communication Networks 1 GABRIEL SIRBU, ION BOGDAN 1 Electrical and Electronics Engineering Dept., Telecommunications Dept.
More informationA Genetic Algorithm for Solving Beehive Hidato Puzzles
A Genetic Algorithm for Solving Beehive Hidato Puzzles Matheus Müller Pereira da Silva and Camila Silva de Magalhães Universidade Federal do Rio de Janeiro - UFRJ, Campus Xerém, Duque de Caxias, RJ 25245-390,
More informationA Novel Multistage Genetic Algorithm Approach for Solving Sudoku Puzzle
A Novel Multistage Genetic Algorithm Approach for Solving Sudoku Puzzle Haradhan chel, Deepak Mylavarapu 2 and Deepak Sharma 2 Central Institute of Technology Kokrajhar,Kokrajhar, BTAD, Assam, India, PIN-783370
More informationChapter 5 OPTIMIZATION OF BOW TIE ANTENNA USING GENETIC ALGORITHM
Chapter 5 OPTIMIZATION OF BOW TIE ANTENNA USING GENETIC ALGORITHM 5.1 Introduction This chapter focuses on the use of an optimization technique known as genetic algorithm to optimize the dimensions of
More informationGSM FREQUENCY PLANNING
GSM FREQUENCY PLANNING PROJECT NUMBER: PRJ070 BY NAME: MUTONGA JACKSON WAMBUA REG NO.: F17/2098/2004 SUPERVISOR: DR. CYRUS WEKESA EXAMINER: DR. MAURICE MANG OLI Introduction GSM is a cellular mobile network
More informationCMC VIDYA SAGAR P. UNIT IV FREQUENCY MANAGEMENT AND CHANNEL ASSIGNMENT Numbering and grouping, Setup access and paging
UNIT IV FREQUENCY MANAGEMENT AND CHANNEL ASSIGNMENT Numbering and grouping, Setup access and paging channels, Channel assignments to cell sites and mobile units, Channel sharing and barrowing, sectorization,
More informationIntroduction to Genetic Algorithms
Introduction to Genetic Algorithms Peter G. Anderson, Computer Science Department Rochester Institute of Technology, Rochester, New York anderson@cs.rit.edu http://www.cs.rit.edu/ February 2004 pg. 1 Abstract
More informationMehrdad Amirghasemi a* Reza Zamani a
The roles of evolutionary computation, fitness landscape, constructive methods and local searches in the development of adaptive systems for infrastructure planning Mehrdad Amirghasemi a* Reza Zamani a
More informationFOUR TOTAL TRANSFER CAPABILITY. 4.1 Total transfer capability CHAPTER
CHAPTER FOUR TOTAL TRANSFER CAPABILITY R structuring of power system aims at involving the private power producers in the system to supply power. The restructured electric power industry is characterized
More informationDECISION MAKING TECHNIQUES FOR COGNITIVE RADIOS
DECISION MAKING TECHNIQUES FOR COGNITIVE RADIOS MUBBASHAR ALTAF KHAN 830310-P391 maks023@gmail.com & SOHAIB AHMAD 811105-P010 asho06@student.bth.se This report is presented as a part of the thesis for
More informationSolving Assembly Line Balancing Problem using Genetic Algorithm with Heuristics- Treated Initial Population
Solving Assembly Line Balancing Problem using Genetic Algorithm with Heuristics- Treated Initial Population 1 Kuan Eng Chong, Mohamed K. Omar, and Nooh Abu Bakar Abstract Although genetic algorithm (GA)
More informationEvolutionary Programming Optimization Technique for Solving Reactive Power Planning in Power System
Evolutionary Programg Optimization Technique for Solving Reactive Power Planning in Power System ISMAIL MUSIRIN, TITIK KHAWA ABDUL RAHMAN Faculty of Electrical Engineering MARA University of Technology
More informationDynamic Spectrum Allocation for Cognitive Radio. Using Genetic Algorithm
Abstract Cognitive radio (CR) has emerged as a promising solution to the current spectral congestion problem by imparting intelligence to the conventional software defined radio that allows spectrum sharing
More informationSmart Grid Reconfiguration Using Genetic Algorithm and NSGA-II
Smart Grid Reconfiguration Using Genetic Algorithm and NSGA-II 1 * Sangeeta Jagdish Gurjar, 2 Urvish Mewada, 3 * Parita Vinodbhai Desai 1 Department of Electrical Engineering, AIT, Gujarat Technical University,
More informationCSC 396 : Introduction to Artificial Intelligence
CSC 396 : Introduction to Artificial Intelligence Exam 1 March 11th - 13th, 2008 Name Signature - Honor Code This is a take-home exam. You may use your book and lecture notes from class. You many not use
More informationChutima Prommak and Boriboon Deeka. Proceedings of the World Congress on Engineering 2007 Vol II WCE 2007, July 2-4, 2007, London, U.K.
Network Design for Quality of Services in Wireless Local Area Networks: a Cross-layer Approach for Optimal Access Point Placement and Frequency Channel Assignment Chutima Prommak and Boriboon Deeka ESS
More informationSurvey of Call Blocking Probability Reducing Techniques in Cellular Network
International Journal of Scientific and Research Publications, Volume 2, Issue 12, December 2012 1 Survey of Call Blocking Probability Reducing Techniques in Cellular Network Mrs.Mahalungkar Seema Pankaj
More informationTotal Harmonic Distortion Minimization of Multilevel Converters Using Genetic Algorithms
Applied Mathematics, 013, 4, 103-107 http://dx.doi.org/10.436/am.013.47139 Published Online July 013 (http://www.scirp.org/journal/am) Total Harmonic Distortion Minimization of Multilevel Converters Using
More informationGenetic Algorithm-Based Approach to Spectrum Allocation and Power Control with Constraints in Cognitive Radio Networks
Research Journal of Applied Sciences, Engineering and Technology 5(): -7, 23 ISSN: 24-7459; e-issn: 24-7467 Maxwell Scientific Organization, 23 Submitted: March 26, 22 Accepted: April 7, 22 Published:
More informationTABLE OF CONTENTS CHAPTER NO. TITLE PAGE NO. LIST OF TABLES LIST OF FIGURES LIST OF SYMBOLS AND ABBREVIATIONS
vi TABLE OF CONTENTS CHAPTER TITLE PAGE ABSTRACT LIST OF TABLES LIST OF FIGURES LIST OF SYMBOLS AND ABBREVIATIONS iii viii x xiv 1 INTRODUCTION 1 1.1 DISK SCHEDULING 1 1.2 WINDOW-CONSTRAINED SCHEDULING
More information[Cheeneebash et al., 5(1): January, 2018] ISSN Impact Factor 3.802
GLOBAL JOURNAL OF ADVANCED ENGINEERING TECHNOLOGIES AND SCIENCES A REDUCED SPACE COMBINED WITH TABU SEARCH FOR SOLVING THE CHANNEL ALLOCATION PROBLEM Jayrani Cheeneebash*, Harry C S Rughooputh and Jose
More informationScheduling. Radek Mařík. April 28, 2015 FEE CTU, K Radek Mařík Scheduling April 28, / 48
Scheduling Radek Mařík FEE CTU, K13132 April 28, 2015 Radek Mařík (marikr@fel.cvut.cz) Scheduling April 28, 2015 1 / 48 Outline 1 Introduction to Scheduling Methodology Overview 2 Classification of Scheduling
More informationPopulation Adaptation for Genetic Algorithm-based Cognitive Radios
Population Adaptation for Genetic Algorithm-based Cognitive Radios Timothy R. Newman, Rakesh Rajbanshi, Alexander M. Wyglinski, Joseph B. Evans, and Gary J. Minden Information Technology and Telecommunications
More informationCross-layer Network Design for Quality of Services in Wireless Local Area Networks: Optimal Access Point Placement and Frequency Channel Assignment
Cross-layer Network Design for Quality of Services in Wireless Local Area Networks: Optimal Access Point Placement and Frequency Channel Assignment Chutima Prommak and Boriboon Deeka Abstract This paper
More informationDynamic Grouping and Frequency Reuse Scheme for Dense Small Cell Network
GRD Journals Global Research and Development Journal for Engineering International Conference on Innovations in Engineering and Technology (ICIET) - 2016 July 2016 e-issn: 2455-5703 Dynamic Grouping and
More informationApplication of Soft Computing Techniques for Handoff Management in Wireless Cellular Networks
International Journal of Engineering and Management Research, Vol.-2, Issue-6, December 2012 ISSN No.: 2250-0758 Pages: 1-6 www.ijemr.net Application of Soft Computing Techniques for Handoff Management
More informationLow Overhead Spectrum Allocation and Secondary Access in Cognitive Radio Networks
Low Overhead Spectrum Allocation and Secondary Access in Cognitive Radio Networks Yee Ming Chen Department of Industrial Engineering and Management Yuan Ze University, Taoyuan Taiwan, Republic of China
More informationImplementation of FPGA based Decision Making Engine and Genetic Algorithm (GA) for Control of Wireless Parameters
Advances in Computational Sciences and Technology ISSN 0973-6107 Volume 11, Number 1 (2018) pp. 15-21 Research India Publications http://www.ripublication.com Implementation of FPGA based Decision Making
More informationMeta-Heuristic Approach for Supporting Design-for- Disassembly towards Efficient Material Utilization
Meta-Heuristic Approach for Supporting Design-for- Disassembly towards Efficient Material Utilization Yoshiaki Shimizu *, Kyohei Tsuji and Masayuki Nomura Production Systems Engineering Toyohashi University
More informationA Hybrid Evolutionary Approach for Multi Robot Path Exploration Problem
A Hybrid Evolutionary Approach for Multi Robot Path Exploration Problem K.. enthilkumar and K. K. Bharadwaj Abstract - Robot Path Exploration problem or Robot Motion planning problem is one of the famous
More informationEvolution of Sensor Suites for Complex Environments
Evolution of Sensor Suites for Complex Environments Annie S. Wu, Ayse S. Yilmaz, and John C. Sciortino, Jr. Abstract We present a genetic algorithm (GA) based decision tool for the design and configuration
More informationCHAPTER 5 PERFORMANCE EVALUATION OF SYMMETRIC H- BRIDGE MLI FED THREE PHASE INDUCTION MOTOR
85 CHAPTER 5 PERFORMANCE EVALUATION OF SYMMETRIC H- BRIDGE MLI FED THREE PHASE INDUCTION MOTOR 5.1 INTRODUCTION The topological structure of multilevel inverter must have lower switching frequency for
More informationLANDSCAPE SMOOTHING OF NUMERICAL PERMUTATION SPACES IN GENETIC ALGORITHMS
LANDSCAPE SMOOTHING OF NUMERICAL PERMUTATION SPACES IN GENETIC ALGORITHMS ABSTRACT The recent popularity of genetic algorithms (GA s) and their application to a wide range of problems is a result of their
More informationAn Optimized Performance Amplifier
Electrical and Electronic Engineering 217, 7(3): 85-89 DOI: 1.5923/j.eee.21773.3 An Optimized Performance Amplifier Amir Ashtari Gargari *, Neginsadat Tabatabaei, Ghazal Mirzaei School of Electrical and
More informationAnalytical Approach for Channel Assignments in Cellular Networks
Analytical Approach for Channel Assignments in Cellular Networks Vladimir V. Shakhov 1 and Hyunseung Choo 2 1 Institute of Computational Mathematics and Mathematical Geophysics, Siberian Branch of the
More informationOptimization of OFDM Systems Using Genetic Algorithm in FPGA
Optimization of OFDM Systems Using Genetic Algorithm in FPGA 1 S.Venkatachalam, 2 T.Manigandan 1 Kongu Engineering College, Perundurai-638052, Tamil Nadu, India 2 P.A. College of Engineering and Technology,
More informationThe Behavior Evolving Model and Application of Virtual Robots
The Behavior Evolving Model and Application of Virtual Robots Suchul Hwang Kyungdal Cho V. Scott Gordon Inha Tech. College Inha Tech College CSUS, Sacramento 253 Yonghyundong Namku 253 Yonghyundong Namku
More informationLocal Search: Hill Climbing. When A* doesn t work AIMA 4.1. Review: Hill climbing on a surface of states. Review: Local search and optimization
Outline When A* doesn t work AIMA 4.1 Local Search: Hill Climbing Escaping Local Maxima: Simulated Annealing Genetic Algorithms A few slides adapted from CS 471, UBMC and Eric Eaton (in turn, adapted from
More informationMRN -4 Frequency Reuse
Politecnico di Milano Facoltà di Ingegneria dell Informazione MRN -4 Frequency Reuse Mobile Radio Networks Prof. Antonio Capone Assignment of channels to cells o The multiple access technique in cellular
More informationA Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation
A Study of Permutation Operators for Minimum Span Frequency Assignment Using an Order Based Representation Christine L. Valenzuela (Mumford) School of Computer Science, Cardiff University, CF24 3AA, United
More informationA Chaotic Genetic Algorithm for Radio Spectrum Allocation
A Chaotic Genetic Algorithm for Radio Spectrum Allocation Olawale David Jegede, Ken Ferens, Witold Kinsner Dept. of Electrical and Computer Engineering, University of Manitoba, Winnipeg, MB, Canada {jegedeo@cc.umanitoba.ca,
More informationEvaluation of a channel assignment scheme in mobile network systems
DOI 10.1186/s13673-016-0075-0 RESEARCH Open Access Evaluation of a channel assignment scheme in mobile network systems Nahla Nurelmadina 1, Ibtehal Nafea 1 and Muhammad Younas 2* *Correspondence: m.younas@brookes.ac.uk
More informationOptimum Coordination of Overcurrent Relays: GA Approach
Optimum Coordination of Overcurrent Relays: GA Approach 1 Aesha K. Joshi, 2 Mr. Vishal Thakkar 1 M.Tech Student, 2 Asst.Proff. Electrical Department,Kalol Institute of Technology and Research Institute,
More informationCommunication Switching Techniques
Communication Switching Techniques UNIT 5 P.M.Arun Kumar, Assistant Professor, Department of IT, Sri Krishna College of Engineering and Technology, Coimbatore. PRINCIPLES OF CELLULAR NETWORKS TOPICS TO
More informationINTEGRATED CIRCUIT CHANNEL ROUTING USING A PARETO-OPTIMAL GENETIC ALGORITHM
Journal of Circuits, Systems, and Computers Vol. 21, No. 5 (2012) 1250041 (13 pages) #.c World Scienti c Publishing Company DOI: 10.1142/S0218126612500417 INTEGRATED CIRCUIT CHANNEL ROUTING USING A PARETO-OPTIMAL
More informationSolving Sudoku with Genetic Operations that Preserve Building Blocks
Solving Sudoku with Genetic Operations that Preserve Building Blocks Yuji Sato, Member, IEEE, and Hazuki Inoue Abstract Genetic operations that consider effective building blocks are proposed for using
More informationThe Genetic Algorithm
The Genetic Algorithm The Genetic Algorithm, (GA) is finding increasing applications in electromagnetics including antenna design. In this lesson we will learn about some of these techniques so you are
More informationLow-Computational Complexity Detection and BER Bit Error Rate Minimization for Large Wireless MIMO Receiver Using Genetic Algorithm
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174 Volume 7, Number 8 (2014), pp. 779-785 International Research Publication House http://www.irphouse.com Low-Computational
More informationCS 441/541 Artificial Intelligence Fall, Homework 6: Genetic Algorithms. Due Monday Nov. 24.
CS 441/541 Artificial Intelligence Fall, 2008 Homework 6: Genetic Algorithms Due Monday Nov. 24. In this assignment you will code and experiment with a genetic algorithm as a method for evolving control
More informationBASIC CONCEPTS OF HSPA
284 23-3087 Uen Rev A BASIC CONCEPTS OF HSPA February 2007 White Paper HSPA is a vital part of WCDMA evolution and provides improved end-user experience as well as cost-efficient mobile/wireless broadband.
More informationCreating a Dominion AI Using Genetic Algorithms
Creating a Dominion AI Using Genetic Algorithms Abstract Mok Ming Foong Dominion is a deck-building card game. It allows for complex strategies, has an aspect of randomness in card drawing, and no obvious
More informationOptimal Placement of Antennae in Telecommunications Using Metaheuristics
Optimal Placement of Antennae in Telecommunications Using Metaheuristics E. Alba, G. Molina March 24, 2006 Abstract In this article, several optimization algorithms are applied to solve the radio network
More informationA COMPACT TRI-BAND ANTENNA DESIGN USING BOOLEAN DIFFERENTIAL EVOLUTION ALGORITHM. Xidian University, Xi an, Shaanxi , P. R.
Progress In Electromagnetics Research C, Vol. 32, 139 149, 2012 A COMPACT TRI-BAND ANTENNA DESIGN USING BOOLEAN DIFFERENTIAL EVOLUTION ALGORITHM D. Li 1, *, F.-S. Zhang 1, and J.-H. Ren 2 1 National Key
More informationImprovement of Robot Path Planning Using Particle. Swarm Optimization in Dynamic Environments. with Mobile Obstacles and Target
Advanced Studies in Biology, Vol. 3, 2011, no. 1, 43-53 Improvement of Robot Path Planning Using Particle Swarm Optimization in Dynamic Environments with Mobile Obstacles and Target Maryam Yarmohamadi
More informationJoint QoS Multicast Routing and Channel Assignment in Multiradio Multichannel Wireless Mesh Networks using Intelligent Computational Methods
Joint QoS Multicast Routing and Channel Assignment in Multiradio Multichannel Wireless Mesh Networks using Intelligent Computational Methods Hui Cheng,a, Shengxiang Yang b a Department of Computer Science,
More informationDistributed Power Control in Cellular and Wireless Networks - A Comparative Study
Distributed Power Control in Cellular and Wireless Networks - A Comparative Study Vijay Raman, ECE, UIUC 1 Why power control? Interference in communication systems restrains system capacity In cellular
More informationA Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles Seyed Mehran Kazemi, Bahare Fatemi
A Retrievable Genetic Algorithm for Efficient Solving of Sudoku Puzzles Seyed Mehran Kazemi, Bahare Fatemi Abstract Sudoku is a logic-based combinatorial puzzle game which is popular among people of different
More informationLoad Balancing for Centralized Wireless Networks
Load Balancing for Centralized Wireless Networks Hong Bong Kim and Adam Wolisz Telecommunication Networks Group Technische Universität Berlin Sekr FT5 Einsteinufer 5 0587 Berlin Germany Email: {hbkim,
More informationDynamic Frequency Hopping in Cellular Fixed Relay Networks
Dynamic Frequency Hopping in Cellular Fixed Relay Networks Omer Mubarek, Halim Yanikomeroglu Broadband Communications & Wireless Systems Centre Carleton University, Ottawa, Canada {mubarek, halim}@sce.carleton.ca
More informationHarmonic Minimization for Cascade Multilevel Inverter based on Genetic Algorithm
Harmonic Minimization for Cascade Multilevel Inverter based on Genetic Algorithm Ranjhitha.G 1, Padmanaban.K 2 PG Scholar, Department of EEE, Gnanamani College of Engineering, Namakkal, India 1 Assistant
More informationOptimizing Methods in Military Radio-Networks Planning and Management
Optimizing Methods in Military Radio-Networks Planning and Management Piotr Gajewski, Cezary Ziółkowski Military University of Technology Kaliskiego 2, 00-908 Warsaw POLAND Phone: +48 22 6854905, Fax:
More informationGA Optimization for RFID Broadband Antenna Applications. Stefanie Alki Delichatsios MAS.862 May 22, 2006
GA Optimization for RFID Broadband Antenna Applications Stefanie Alki Delichatsios MAS.862 May 22, 2006 Overview Introduction What is RFID? Brief explanation of Genetic Algorithms Antenna Theory and Design
More informationAchieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters
Achieving Desirable Gameplay Objectives by Niched Evolution of Game Parameters Scott Watson, Andrew Vardy, Wolfgang Banzhaf Department of Computer Science Memorial University of Newfoundland St John s.
More informationIntelligent Handoff in Cellular Data Networks Based on Mobile Positioning
Intelligent Handoff in Cellular Data Networks Based on Mobile Positioning Prasannakumar J.M. 4 th semester MTech (CSE) National Institute Of Technology Karnataka Surathkal 575025 INDIA Dr. K.C.Shet Professor,
More informationSpectrum Sharing with Adjacent Channel Constraints
Spectrum Sharing with Adjacent Channel Constraints icholas Misiunas, Miroslava Raspopovic, Charles Thompson and Kavitha Chandra Center for Advanced Computation and Telecommunications Department of Electrical
More informationGenetic Algorithm for Routing and Spectrum Allocation in Elastic Optical Networks
2016 Third European Network Intelligence Conference Genetic Algorithm for Routing and Spectrum Allocation in Elastic Optical Networks Piotr Lechowicz, Krzysztof Walkowiak Dept. of Systems and Computer
More informationDISTRIBUTION NETWORK RECONFIGURATION FOR LOSS MINIMISATION USING DIFFERENTIAL EVOLUTION ALGORITHM
DISTRIBUTION NETWORK RECONFIGURATION FOR LOSS MINIMISATION USING DIFFERENTIAL EVOLUTION ALGORITHM K. Sureshkumar 1 and P. Vijayakumar 2 1 Department of Electrical and Electronics Engineering, Velammal
More informationOPTIMIZATION ON FOOTING LAYOUT DESI RESIDENTIAL HOUSE WITH PILES FOUNDA. Author(s) BUNTARA.S. GAN; NGUYEN DINH KIEN
Title OPTIMIZATION ON FOOTING LAYOUT DESI RESIDENTIAL HOUSE WITH PILES FOUNDA Author(s) BUNTARA.S. GAN; NGUYEN DINH KIEN Citation Issue Date 2013-09-11 DOI Doc URLhttp://hdl.handle.net/2115/54229 Right
More informationHow Much Can Sub-band Virtual Concatenation (VCAT) Help Static Routing and Spectrum Assignment in Elastic Optical Networks?
How Much Can Sub-band Virtual Concatenation (VCAT) Help Static Routing and Spectrum Assignment in Elastic Optical Networks? (Invited) Xin Yuan, Gangxiang Shen School of Electronic and Information Engineering
More informationLinear Array Geometry Synthesis Using Genetic Algorithm for Optimum Side Lobe Level and Null
ISSN: 77 943 Volume 1, Issue 3, May 1 Linear Array Geometry Synthesis Using Genetic Algorithm for Optimum Side Lobe Level and Null I.Padmaja, N.Bala Subramanyam, N.Deepika Rani, G.Tirumala Rao Abstract
More informationA comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms
A comparison of a genetic algorithm and a depth first search algorithm applied to Japanese nonograms Wouter Wiggers Faculty of EECMS, University of Twente w.a.wiggers@student.utwente.nl ABSTRACT In this
More informationJoint Transmitter-Receiver Adaptive Forward-Link DS-CDMA System
# - Joint Transmitter-Receiver Adaptive orward-link D-CDMA ystem Li Gao and Tan. Wong Department of Electrical & Computer Engineering University of lorida Gainesville lorida 3-3 Abstract A joint transmitter-receiver
More informationSolving the Fixed Channel Assignment Problem in Cellular Communications Using An Adaptive Local Search
Solving the Fixed Channel Assignment Problem in Cellular Communications Using An Adaptive Local Search Graham Kendall and Mazlan Mohamad Automated Scheduling, Optimisation and Planning (ASAP) Research
More informationThe Application of Multi-Level Genetic Algorithms in Assembly Planning
Volume 17, Number 4 - August 2001 to October 2001 The Application of Multi-Level Genetic Algorithms in Assembly Planning By Dr. Shana Shiang-Fong Smith (Shiang-Fong Chen) and Mr. Yong-Jin Liu KEYWORD SEARCH
More informationLocalized Distributed Sensor Deployment via Coevolutionary Computation
Localized Distributed Sensor Deployment via Coevolutionary Computation Xingyan Jiang Department of Computer Science Memorial University of Newfoundland St. John s, Canada Email: xingyan@cs.mun.ca Yuanzhu
More informationShuffled Complex Evolution
Shuffled Complex Evolution Shuffled Complex Evolution An Evolutionary algorithm That performs local and global search A solution evolves locally through a memetic evolution (Local search) This local search
More informationIntelligent Adaptation And Cognitive Networking
Intelligent Adaptation And Cognitive Networking Kevin Langley MAE 298 5/14/2009 Media Wired o Can react to local conditions near speed of light o Generally reactive systems rather than predictive work
More informationCHAPTER 4 IMPLEMENTATION OF ADALINE IN MATLAB
52 CHAPTER 4 IMPLEMENTATION OF ADALINE IN MATLAB 4.1 INTRODUCTION The ADALINE is implemented in MATLAB environment running on a PC. One hundred data samples are acquired from a single cycle of load current
More informationA Review on Genetic Algorithm and Its Applications
2017 IJSRST Volume 3 Issue 8 Print ISSN: 2395-6011 Online ISSN: 2395-602X Themed Section: Science and Technology A Review on Genetic Algorithm and Its Applications Anju Bala Research Scholar, Department
More informationThe Simulated Location Accuracy of Integrated CCGA for TDOA Radio Spectrum Monitoring System in NLOS Environment
The Simulated Location Accuracy of Integrated CCGA for TDOA Radio Spectrum Monitoring System in NLOS Environment ao-tang Chang 1, Hsu-Chih Cheng 2 and Chi-Lin Wu 3 1 Department of Information Technology,
More informationCoordination of overcurrent relay using Hybrid GA- NLP method
Coordination of overcurrent relay using Hybrid GA- NLP method 1 Sanjivkumar K. Shakya, 2 Prof.G.R.Patel 1 P.G. Student, 2 Assistant professor Department Of Electrical Engineering Sankalchand Patel College
More informationReal-Coded Genetic Algorithm for Robust Design of UPFC Supplementary Damping Controller
Real-Coded Genetic Algorithm for Robust Design of UPFC Supplementary Damping Controller S. C. Swain, S. Mohapatra, S. Panda & S. R. Nayak Abstract - In this paper is used in Designing UPFC based supplementary
More informationTransmission Expansion Planning Considering Network Adequacy and Investment Cost Limitation using Genetic Algorithm M. Mahdavi, E.
International Journal of Electrical and Electronics Engineering 5:4 Transmission Expansion Planning Considering Network Adequacy and Investment Cost Limitation using Genetic Algorithm M. Mahdavi, E. Mahdavi
More informationRadio Resource Allocation Scheme for Device-to-Device Communication in Cellular Networks Using Fractional Frequency Reuse
2011 17th Asia-Pacific Conference on Communications (APCC) 2nd 5th October 2011 Sutera Harbour Resort, Kota Kinabalu, Sabah, Malaysia Radio Resource Allocation Scheme for Device-to-Device Communication
More informationWire Layer Geometry Optimization using Stochastic Wire Sampling
Wire Layer Geometry Optimization using Stochastic Wire Sampling Raymond A. Wildman*, Joshua I. Kramer, Daniel S. Weile, and Philip Christie Department University of Delaware Introduction Is it possible
More informationEENG473 Mobile Communications Module 2 : Week # (4) The Cellular Concept System Design Fundamentals
EENG473 Mobile Communications Module 2 : Week # (4) The Cellular Concept System Design Fundamentals Frequency reuse or frequency planning : The design process of selecting and allocating channel groups
More informationAPPLICATION OF NEURAL NETWORK TRAINED WITH META-HEURISTIC ALGORITHMS ON FAULT DIAGNOSIS OF MULTI-LEVEL INVERTER
APPLICATION OF NEURAL NETWORK TRAINED WITH META-HEURISTIC ALGORITHMS ON FAULT DIAGNOSIS OF MULTI-LEVEL INVERTER 1 M.SIVAKUMAR, 2 R.M.S.PARVATHI 1 Research Scholar, Department of EEE, Anna University, Chennai,
More information