• ETRI Journal
• /
• v.29 no.1
• /
• pp.95-98
• /
• 2007

A low-profile phased array antenna with a low sidelobe was designed and fabricated using a genetic algorithm (GA). The subarray distances were optimized by GA with chromosomes of 78 bits, a population of 100, a crossover probability of 0.9, and a mutation probability of 0.005. The array antenna has 24 subarrays in 14 rows, and is designed as a mobile terminal for Ku-band satellite communication. The sidelobe level was suppressed by 6.5 dB after optimization, compared to the equal spacing between subarrays. The sidelobe level was verified from the far-field pattern measurement by using the fabricated array antenna with optimized distance.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.10-14
• /
• 2004

When providing flexible data transmission for future CDMA(Code Division Multiple Access) cellular networks, problems arise in two aspects: transmission rate. This paper has proposed an approach to maximize the cellular network capacity by combining the genetic transmission rate allocation and a rapid power control algorithm. We present a genetic chromosome representation to express call drop numbers and transmission rate to control mobile's transmission power levels while handling their flexible transmission rates. We suggest a rapid power control algorithm, which is based on optimal control theory and Steffenson acceleration technique comparing with the existing algorithms. Computer simulation results showed effectiveness and efficiency of the proposed algorithm Conclusively, our proposed scheme showed high potential for increasing the cellular network capacity and it can be the fundamental basis of future research.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.921-922
• /
• 2006

This paper presents a novel scheme that quickly searches for the sweet spot of multiple array antennas, and locks on to it for high-speed millimeter wavelength transmissions. The proposed method utilizes a modified genetic algorithm, which selects a superior initial group through preprocessing in order to solve the local solution in a genetic algorithm. TDD (Time Division Duplex) is utilized as the transfer method and data controller for the antenna. Once the initial communication is completed for the specific number of individuals, no longer antenna's data will be transmitted until each station processes GA in order to produce the next generation. After reproduction, individuals of the next generation become the data, and communication between each station is made again. Simulation results confirmed the efficiency of the proposed method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.1
• /
• pp.69-74
• /
• 2004

A sequencing problem is to find an ordered sequence of some entities which maximizes (or minimize) the domain specific objective function. As some typical examples of sequencing problems, there are traveling salesman problem, job shop scheduling, flow shop scheduling, and so on. This paper introduces a new type of sequencing problems, named a sequencing problem with fuzzy preference relation, where a fuzzy preference relation is provided for the evaluation of the quality of sequences. It presents how such a problem can be formulated in terms of objective function. It also proposes a genetic algorithm applicable to such a sequencing problem.

• Journal of Information Technology Applications and Management
• /
• v.13 no.2
• /
• pp.29-39
• /
• 2006

There has been a tremendous need for dual homing cell switch assignment problems where calling volume and patterns are different at different times of the day. This problem of assigning cells to switches in the planning phase of mobile networks consists in finding an assignment plan which minimizes the communication costs taking into account some constraints such as capacity of switches. This optimization problem is known to be difficult to solve, such that heuristic methods are usually utilized to find good solutions in a reasonable amount of time. In this paper, we propose an evolutionary approach, based on the genetic algorithm paradigm, for solving this problem. Simulation results confirm the appropriateness and effectiveness of this approach which yields solutions of good quality.

• Journal of the military operations research society of Korea
• /
• v.26 no.1
• /
• pp.56-69
• /
• 2000

A frequency assignment problem on time division duplex system is considered. Republic of Korea Army (ROKA) has been establishing an infrastructure of tactical communication (SPIDER) system for next generation and it will be a core network structure of system. VHF system is the backbone network of SPIDER, that performs transmission of data such as voice, text and images. So, it is a significant problem finding the frequency assignment with no interference under very restricted resource environment. With a given arbitrary configuration of communications network, we find a feasible solution that guarantees communication without interference between sites and relay stations. We formulate a frequency assignment problem as an Integer Programming model, which has NP-hard complexity. To find the assignment results within a reasonable time, we take a genetic algorithm approach which represents the solution structure with available frequency order, and develop a genetic operation strategies. Computational result shows that the network configuration of SPIDER can be solved efficiently within a very short time.

• Journal of IKEEE
• /
• v.26 no.2
• /
• pp.186-195
• /
• 2022

In this paper, we propose a new algorithm to improve the accuracy of indoor positioning techniques using Wi-Fi access points as beacon nodes. The proposed algorithm is based on the Weighted Centroid algorithm, a popular method widely used for indoor positioning, however, it improves some disadvantages of the Weighted Centroid method and also for other kinds of indoor positioning methods, by using the received signal strength correction method and genetic algorithm to prevent the signal strength fluctuation phenomenon, which is caused by the complex propagation environment. To validate the performance of the proposed algorithm, we conducted experiments in a complex indoor environment, and collect a list of Wi-Fi signal strength data from several access points around the standing user location. By utilizing this kind of algorithm, we can obtain a high accuracy positioning system, which can be used in any building environment with an available Wi-Fi access point setup as a beacon node.

• Journal of information and communication convergence engineering
• /
• v.20 no.2
• /
• pp.73-78
• /
• 2022

Based on experimental measurements conducted on many different practical wireless communication systems, ambient noise has been shown to be decidedly non-Gaussian owing to impulsive phenomena. However, most multiuser detection techniques proposed thus far have considered Gaussian noise only. They may therefore suffer from a considerable performance loss in the presence of impulsive ambient noise. In this paper, we consider a large-scale multiuser multiple-input multiple-output system in the presence of non-Gaussian noise and propose a genetic algorithm (GA) based detector for large-dimensional multiuser signal detection. The proposed algorithm is more robust than linear multi-user detectors for non-Gaussian noise because it uses a multi-directional search to manipulate and maintain a population of potential solutions. Meanwhile, the proposed GA-based algorithm has a comparable complexity because it does not require any complicated computations (e.g., a matrix inverse or derivation). The simulation results show that the GA offers a performance gain over the linear minimum mean square error algorithm for both non-Gaussian and Gaussian noise.

• International Journal of Internet, Broadcasting and Communication
• /
• v.16 no.2
• /
• pp.119-126
• /
• 2024

The volume of genomic data is constantly increasing in various modern industries and research fields. This growth presents new challenges and opportunities in terms of the quantity and diversity of genetic data. In this paper, we propose a distributed cloud system for integrating and managing large-scale gene databases. By introducing a distributed data storage and processing system based on the Hadoop Distributed File System (HDFS), various formats and sizes of genomic data can be efficiently integrated. Furthermore, by leveraging Spark on YARN, efficient management of distributed cloud computing tasks and optimal resource allocation are achieved. This establishes a foundation for the rapid processing and analysis of large-scale genomic data. Additionally, by utilizing BigQuery ML, machine learning models are developed to support genetic search and prediction, enabling researchers to more effectively utilize data. It is expected that this will contribute to driving innovative advancements in genetic research and applications.

• Journal of Korea Multimedia Society
• /
• v.12 no.5
• /
• pp.728-736
• /
• 2009

We propose a method using the genetic algorithm to solve the maximum set cover problem. It is needed for scheduling the power of sensor nodes in extending the lifetime of the wireless sensor network with variable sensing range. The existing Greedy Heuristic method calculates the power scheduling of sensor nodes repeatedly in the process of operation, and so the communication traffic of sensor nodes is increased. The proposed method reduces the amount of communication traffic of sensor nodes, and so the energies of nodes are saved, and the lifetime of network can be extended. The effectiveness of this method was verified through computer simulation, and considering the energy losses of communication operations about 10% in the network lifetime is improved.