• Structural Engineering and Mechanics
• /
• v.77 no.6
• /
• pp.779-795
• /
• 2021

In the recent decades, various optimization algorithms have been considered for the optimization of structures. In this research, a new enhanced algorithm is used for the size and topology optimization of truss structures. This algorithm, which is obtained from the combination of Crow Search Algorithm (CSA) and the Cellular Automata (CA) method, is called CA-CSA method. In the first iteration of the CA-CSA method, some of the best designs of the crow's memory are first selected and then located in the cells of CA. Then, a random cell is selected from CA, and the best design is chosen from the selected cell and its neighborhood; it is considered as a "local superior design" (LSD). In the optimization process, the LSD design is used to modify the CSA method. Numerical examples show that the CA-CSA method is more effective than CSA in the size and topology optimization of the truss structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1B
• /
• pp.15-20
• /
• 2012

In this paper, an algorithm that enhances the conventional directional CSMA/CA protocol in IEEE 802.15.3c is proposed under saturation environments. For the algorithm, a Markov chain model is presented and analyzed in no-ACK mode. The effects of directional antennas and the features of IEEE 802.15.3c MAC are considered in the model. The optimal sizes of contention window are derived from the numerical results. The numerical results show that the proposed directional CSMA/CA algorithm outperforms conventional one. The overall analysis is verified by simulation. The obtained results provide the criterion for selecting the optimal parameters and developing a MAC protocol that enhances the performance of mmWave WPANs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.267-277
• /
• 2011

Like other wireless network protocols, IEEE 802.15.4 adopts CA (Collision Avoidance)algorithm to avoid the early collision of a new packet by randomizing its first transmission time rather than its immediate delivery. The traditional CA scheme of IEEE 802.15.4, however, selects the random access time from the predetermined range without considering the degree of current congestion. It probably causes either a long delay to settle in the suitable range for the current network load or frequent clashes especially during the long lasting heavy traffic period. This paper proposes an ACA(Adaptive Collision Avoidance) algorithm adapting the initial backoff range to the undergoing collision variations. It also introduces a mathematical model to predict the performance of ACA algorithm added to IEEE 802.15.4. With only small deviations from corresponding simulations, our analytical model shows that ACA technique can improve the throughput of IEEE 802.15.4 by up-to 41% maximally in addition to shortening the packet delays.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.6
• /
• pp.1129-1136
• /
• 2022

This study leads to the shortcoming that the RSSI distance measurement method is easily affected by the external environment and the position error is large, leading to the problem of optimizing the distance values measured by the RSSI distance measurement nodes in this three-dimensional configuration environment. We proposed the CA-PSO-BP algorithm, which is an improved version of the CA-PSO algorithm. The proposed algorithm allows setting unknown nodes in WSN 3D space. In addition, since CA-PSO was applied to the BP neural network, it was possible to shorten the learning time of the BP network and improve the convergence speed of the algorithm through learning. Through the algorithm proposed in this study, it was proved that the precision of the network location can be increased significantly (15%), and significant results were obtained.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.6
• /
• pp.1105-1112
• /
• 2020

One-dimensional 3-neighborhood Cellular Automata (CA)-based pseudo-random number generators are widely applied in generating test patterns to evaluate system performance and generating key sequence generators in cryptographic systems. In this paper, in order to design a CA-based key sequence generator that can generate more complex and confusing sequences, we study a one-dimensional symmetric 5-neighborhood CA that expands to five neighbors affecting the state transition of each cell. In particular, we propose an n-cell one-dimensional symmetric 5-neighborhood CA synthesis algorithm using the algebraic method that uses the Krylov matrix and the one-dimensional 90/150 CA synthesis algorithm proposed by Cho et al. [6].

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.321-323
• /
• 2006

The IEEE 802.15.4 uses a CSMA/CA algorithm on access of media. The CSMA/CA algorithm does Random Backoff before the data is transmitted to avoid collisions. The random backoff is a kind of unavoidable delays and introduces the side effect of energy consumptions. To cope with those problems we propose a new media access algorithm, the Priority Based Ordered Media Access (PBOMA) algorithm, which uses different IFSs. The PBOMA algorithm uses Sampling Rate and Beacon Interval to get a different access probability(or IFS). The access probability is higher, the IFS is shorter. Note that The transfer of urgent data uses tone signal to transmit it immediately. The proposed algorithm is expected to reduce the energy consumptions and the delay.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.4
• /
• pp.3-10
• /
• 2005

Every cell position of a maximum-length 90/150 cellular automata(CA) generates the same pseudo-noise(PN) sequence corresponding to the characteristic polynomial of the CA with a phase shift. Unlike LFSRs, the phase shift is generally different between stages of a CA. In this paper, we propose an algorithm to compute relative phase shifts between stage of a CA. Our algorithm does not need Shank's algorithm to compute relative phase shifts and does not need any previous phase shifts to compute a phase shift. Moreover it is done in time $O(2^n)$.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.11 no.8
• /
• pp.735-742
• /
• 2016

The Low-Rate WPAN is a short range wireless networking technology characterized by low-rate, low-power, low complexity and low-cost. The LR-WPAN controls wireless channel access among network devices based on the contention-based CSMA/CA algorithm. Therefore, frame collisions may take place at any time, leading to the severe degradation of network performance. This paper proposes a new algorithm that changes back-off periods adaptively in the CSMA/CA process depending on network conditions, resulting in the reduction of frame collisions. Throughout extensive simulations, it turns out that varying the back-off periods dynamically shows better performance than maintaining the fixed back-off periods.

• Journal of Broadcast Engineering
• /
• v.17 no.6
• /
• pp.954-963
• /
• 2012

As a greedy algorithm reconstructing the sparse signal from underdetermined system, orthogonal matching pursuit (OMP) algorithm has received much attention. In this paper, we multiple candidate matching pursuit (MuCaMP), which builds up candidate support set in every iteration and uses the minimum residual at last iteration. Using the restricted isometry property (RIP), we derive the sufficient condition for MuCaMP to recover the sparse signal exactly. The MuCaMP guarantees to reconstruct the K-sparse signal when the sensing matrix satisfies the RIP constant ${\delta}_{N+K}<\frac{\sqrt{N}}{\sqrt{K}+3\sqrt{N}}$. In addition, we show a recovery performance both noiseless and noisy measurements.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1331-1342
• /
• 2009

In this paper, we analyze the behavior of the state transition of nongroup CA with a single attractor over GF($2^p$)(p > 1), and propose the algorithm for the construction of the state transition diagram of a Single Attractor CA(SACA) over GF($2^p$) which is very different from the construction algorithm for the state transition diagram of GF(2) SACA.