• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2008.10a
• /
• pp.288-291
• /
• 2008

Physics based Cellular Automata model is developed and implemented into FEM code. CA model can predict microstructure evolution based on physical phenomena, such as hardening, recovery and recrystallization. This paper outlines the methodology to determine the materials constants for these different phenomena from simpler measurements.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.4
• /
• pp.87-93
• /
• 2009

Wireless mesh networks (WMNs) are emerging technologies that provide ubiquitous environments and wireless broadband access. The aggregate capacity of WMNs can be improved by minimizing the effect of channel interference. The IEEE 802.11b/g standard which is mainly used for the network interface technology in WMNs provides 3 multiple channels. We must consider the channel scanning delay and the channel dependency problem to effectively assign channels in like these multi-channel WMNs. This paper proposes a cluster-based channel assignment (CB-CA) algorithm for multi-channel WMNs to solve such problems. The CB-CA does not perform the channel scanning and the channel switching through assigning co-channel to the inter-cluster head (CH) links. In the CB-CA, the communication between the CH and cluster member (CM) nodes uses a channel has no effect on channels being used by the inter-CH links. Therefore, the CB-CA can minimize the interference within multi-channel environments. Our simulation results show that CB-CA can improve the performance of WMNs.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.819-826
• /
• 2018

The generalized Hamming weight is one of the important parameters of the linear code. It determines the performance of the code when the linear codes are applied to a cryptographic system. In addition, when the block code is decoded by soft decision using the lattice diagram, it becomes a measure for evaluating the state complexity required for the implementation. In particular, a bit-parallel multiplier on finite fields based on trinomials have been studied. Cellular automata(CA) has superior randomness over LFSR due to its ability to update its state simultaneously by local interaction. In this paper, we deal with the efficient synthesis of the pseudo random number generator, which is one of the important factors in the design of effective cryptosystem. We analyze the property of the characteristic polynomial of the simple 90/150 transition rule block, and propose a synthesis algorithm of the reversible 90/150 CA corresponding to the trinomials $x^2^n+x^{2^n-1}+1$($n{\geq}2$) and the 90/150 reversible CA(RCA) corresponding to the maximum weight polynomial with $2^n$ degree by using this rule block.

• Advances in Computational Design
• /
• v.3 no.1
• /
• pp.35-47
• /
• 2018

Design of settlement space is a complicated process while reasonable spatial layout bears great significance on the development and resource allocation of a settlement. The study proposes a weighted L-system generation algorithm based on CA (Cellular Automation) model which tags the spatial attributes of cells through changes in their state during the evolution of CA and thus identifies the spatial growth mode of a settlement. The entrance area of the Caidian Botanical and Animal Garden is used a case study for the model. A design method is proposed which starts from the internal logics of spatial generation, explores possibility of spatial rules and realizes the quantitative analysis and dynamic control of the design process. Taking a top-down approach, the design method takes into account the site information, studies the spatial generation mechanism of settlements and further presents a engine for the generation of multiple layout proposals based on different rules. A optimal solution is acquired using GA (Genetic Algorithm) which generates a settlement spatial layout carrying site information and dynamically linked to the surround environment. The study aims to propose a design method to optimize the spatial layout of the complex settlement system based on parametric generation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.531-534
• /
• 2010

Currently the functionality of the PRC-999K radio that is widely used in Korean Army is half-duplex and the broadcasting system that all subscribers have to listen when one subscriber speaks in time. Radio data communication system configures peer-to-peer network between command post and network members in military fire control system. And the system applies CSMA/CA(Carrier Sense Multiple Access/Collision Avoidance) technique to avoid data collision. Such a data transmitting/receiving time could be reduced by allocating address in serial order to each network members. By doing that, command post need to broadcast data only one time and assigned members will reply in order without data collision. This paper provides such a protocol and algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.10
• /
• pp.40-48
• /
• 2008

Security of self organized mobile ad hoc networks is an important issue because administration information in the networks is managed by the constituent nodes. Especially authentication mechanism is necessary for trust setup between newly joining nodes and the network. The authentication models and protocols which are based on the wireline infrastructure could not be practical for mobile ad hoc network. Although public key algorithm-based method is widely used for authentication, it is not easy to be applied to mobile ad hoc networks because they do not have infrastructure such as centralized CA which is needed for certificate verification. In this paper, we consider the public key based random CA group method proposed in [1] to provide efficient authentication scheme to mobile ad hoc networks and analyze the performance of the method, which is then compared to the home CA method. From the analysis results, we see that the random CA method where the function of CA is distributed to some mobile nodes and the authentication information is propagated to randomly chosen CAs shows higher reliability and lower cost than home CA method.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.6
• /
• pp.1301-1308
• /
• 2018

90/150 CA which are used as key generators of the cipher system have more randomness than LFSRs, but synthesis methods of 90/150 CA are difficult. Therefore, 90/150 CA synthesis methods have been studied by many researchers. In order to synthesize a suitable CA, the analysis of the characteristic polynomial of 90/150 CA should be preceded. In general, the characteristic of polynomial ${\Delta}_n$ of n cell 90/150 CA is obtained by using ${\Delta}_{n-1}$ and ${\Delta}_{n-2}$. Choi et al. analyzed $H_{2^n}(x)$ and $H_{2^n-1}(x)$, where $H_k(x)$ is the characteristic polynomial of k cell 90/150 CA with state transition rule <$10{\cdots}0$>. In this paper, we propose an efficient method to obtain $H_n(x)$ from $H_{n-1}(x)$ and an efficient algorithm to obtain $H_{2^n+i}(x)$ and $H_{2^n-i}(x)$ ($1{\leq}i{\leq}2^{n-1}$) from $H_{2^n}(x)$ by using this method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.11
• /
• pp.1809-1814
• /
• 2003

Differential evolution (DE) algorithm is presented and applied to global optimization in this research. DE suggested initially fur the solution to Chebychev polynomial fitting problem is similar to genetic algorithm(GA) including crossover, mutation and selection process. However, differential evolution algorithm is simpler than GA because it uses a vector concept in populating process. And DE turns out to be converged faster than CA, since it employs the difference information as pseudo-sensitivity In this paper, a trial vector and its control parameters of DE are examined and unconstrained optimization problems of highly nonlinear multimodal functions are demonstrated. To illustrate the efficiency of DE, convergence rates and robustness of global optimization algorithms are compared with those of simple GA.

• Journal of Advanced Navigation Technology
• /
• v.8 no.1
• /
• pp.65-72
• /
• 2004

A basic access method using for IEEE 802.11a wireless LANs is the DCF method that is based on the CSMA/CA. But, Since IEEE 802.11 MAC layer uses original backoff algorithm (Exponential backoff method), when collision occurs, the size of contention windows increases the double size. Hence, packet transmission delay time increases and efficiency is decreased by original backoff scheme. In this paper, we have analyzed TCP packet transmission time of IEEE 802.11 MAC DCF protocol for wireless LANs using a proposed enhanced backoff algorithm. From the results, in OFDM/quadrature phase shift keying channel (QPSK), we can achieve that the transmission time in wireless channel decreases as the TCP packet size increases and based on the data collected, we can infer the correlation between TCP packet size and total message transmission time, allowing for an inference of the optimal packet size in the TCP layer.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.1
• /
• pp.91-100
• /
• 2010

According to the recent increase in air traffic a more efficient air traffic flow control is required. This paper proposes the algorithm for efficient air traffic flow control. Aeronautical communication environment is different from the common communication environment since it needs a direct communication between stations (or airplanes) and requires a strict priority for safety message. Moreover, the wide area for basic service causes high propagation delay. In this paper, by using existing CSMA/CA Media Access Control (MAC) protocol, we set the message priorities according to air traffic condition (congestion airport area, approach control area, En route area, and ocean area). This prioritization scheme enables the data transmission with higher access probability. Simulation results confirm that our protocol shows better performance in terms of channel efficiency and success probability compared to exisiting CSMA/CA protocol.