• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.1-12
• /
• 2022

In order to overcome the power fluctuation issues in photovoltaic (PV) smart grid-connected systems and the inverter nonlinearity model problem, an adaptive backstepping command-filter and a double second order generalized Integrators (DSOGI) controller are designed in order to tune the AC current and the DC-link voltage from the DC side. Firstly, we propose to present the filter mathematical model throughout the PV system, at that juncture the backstepping control law is applied in order to control it, Moreover the command filter is bounded to the controller aiming to exclude the backstepping controller differential increase. Additionally, The adaptive law uses Lyapunov stability criterion. Its task is to estimate the uncertain parameters in the smart grid-connected inverter. A DSOGI is added to stabilize the grid currents and eliminate undesirable harmonics meanwhile feeding maximum power generated from PV to the point of common coupling (PCC). Then, guaranteeing a dynamic effective response even under very unbalanced loads and/or intermittent climate changes. Finally, the simulation results will be established using MATLAB/SIMULINK proving that the presented approach can control surely the smart grid-connected system.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.193-201
• /
• 2023

In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

• International Journal of Computer Science & Network Security
• /
• v.24 no.3
• /
• pp.12-22
• /
• 2024

The travelling salesman problem is very famous and very difficult combinatorial optimization problem that has several applications in operations research, computer science and industrial engineering. As the problem is difficult, finding its optimal solution is computationally very difficult. Thus, several researchers have developed heuristic/metaheuristic algorithms for finding heuristic solutions to the problem instances. In this present study, a new hybrid genetic algorithm (HGA) is suggested to find heuristic solution to the problem. In our HGA we used comprehensive sequential constructive crossover, adaptive mutation, 2-opt search and a new local search algorithm along with a replacement method, then executed our HGA on some standard TSPLIB problem instances, and finally, we compared our HGA with simple genetic algorithm and an existing state-of-the-art method. The experimental studies show the effectiveness of our proposed HGA for the problem.

• ETRI Journal
• /
• v.22 no.4
• /
• pp.25-31
• /
• 2000

Design of secure and efficient public-key encryption schemes under weaker computational assumptions has been regarded as an important and challenging task. As far as ElGamal-type encryption schemes are concerned, some variants of the original ElGamal encryption scheme based on weaker computational assumption have been proposed: Although security of the ElGamal variant of Fujisaki-Okamoto public -key encryption scheme and Cramer and Shoup's encryption scheme is based on the Decisional Diffie-Hellman Assumption (DDH-A), security of the recent Pointcheval's ElGamal encryption variant is based on the Computational Diffie-Hellman Assumption (CDH-A), which is known to be weaker than DDH-A. In this paper, we propose new ElGamal encryption variants whose security is based on CDH-A and the Elliptic Curve Computational Diffie-Hellman Assumption (EC-CDH-A). Also, we show that the proposed variants are secure against the adaptive chosen-ciphertext attack in the random oracle model. An important feature of the proposed variants is length-efficiency which provides shorter ciphertexts than those of other schemes.

• Journal of Satellite, Information and Communications
• /
• v.9 no.4
• /
• pp.16-19
• /
• 2014

In this paper, the beacon signals of WiFi doppler frequency detection based WiFi-AP was designed with the subcarrier between a transmitter and a receiver of WLAN(wireless LAN). We can use such signals to identify human moving as an antenna array and tracking of RF beam. This wireless security services with the combination of WiFi doppler frequency and adaptive beacon time signal was proposed for wireless detection and motion based services.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2018.10a
• /
• pp.174-177
• /
• 2018

스마트폰 키 애플리케이션이 널리 사용되면서, 이에 대한 중계 공격의 위협도 증가하고 있다. 중계공격은 공격자가 차량과 키 애플리케이션 사이에서 오고가는 신호를 중계하여 허용 범위 밖의 통신을 시스템이 유요한 것으로 판단하게 하는 공격이다. 본 논문에서는 중계 공격을 막기 위해, 추가 지연시간을 탐지하여, 임계 지연 시간을 넘었을 경우 차량과 스마트키가 충분히 근접하지 않았다고 판단하여 차량 문 개폐 요청을 거부하는 시스템을 제안하였다. 또한 실제 환경에서의 유동성을 고려하여 임계 지연 시간을 지속적으로 업데이트하는 적응 임계 지연 시간(Adaptive Delay Threshold) 기술을 제시하였다. 그리고 실제 임베디드 기기를 이용해 시스템을 구현하여 시스템의 실효성을 검증하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.92-94
• /
• 2023

사물인터넷이 발전함에 따라 사용자에게 여러 서비스를 제공하기 위한 사물인터넷 플랫폼이 활발하게 개발되고 있다. 그러나 각각의 플랫폼은 독자적인 환경에서 개발되고 있어 상호운용성에 어려움이 있다. 특히, 이기종 사물인터넷 플랫폼이 리소스 보호를 위해 동일한 속성기반 접근제어를 사용하더라도 속성을 표현하는 표현법이 상이하여 유효한 속성을 소유하고 있음에도 타 플랫폼의 리소스에 접근할 수 없는 문제가 있다. 이에, 본 논문에서는 속성기반 접근제어를 활용하는 이기종 사물인터넷플랫폼 간의 서로 다른 속성 표현법을 이해하여 상호운용할 수 있는 프레임워크를 제안한다. 본 프레임워크는 자가적응 모듈을 통해 동일한 속성이더라도 표현법의 차이로 발생하는 상호운용의 문제를 해결하여 이기종 플랫폼 간의 리소스 접근이 가능하도록 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.913-916
• /
• 2008

TPS(Triple Play Service)를 통한 IP-TV,인터넷, 전화 등이 통합되는 추세에서, IPv6 상용네트워크가 수 년 안에 구축될 필연성을 공감하고 있다. 그러나 [1] 현재 IP-TV 서비스에서 Delay, Jitter,전송장애등 QoS에 대한 사용자 불만이 계속 발생하고 있다. 또한 현재 서비스중지 (DoS : Denial of Service)를 유발하는 [2] 인터넷 침해 사고가 월 평균 2157건 이상 발생하는 등, Security Issue의 증가 문제가 지속 되고 있다. IPv4/IPv6 듀얼 스택 멀티 캐스트 네트워크를 구현하여, 라우팅, 멀티캐스트(PIM-SM), QoS, Security 이슈에 대한, 최적의 방안을 도출하여, 라우팅 구현시 IPv6 라우팅 프로토클 간에 재분배(Redistribution) 장애 해결책, IPv6 특성에 따른 멀티캐스트 그룹주소 지정시의 장애대책을 제시하였고, QoS 에서는 기존의 QoS 정책의 문제점과 IPv6의 고유한 패킷 구조의 장점을 활용한 Adaptive QoS 방법을 제시하고, IPv6 멀티캐스트 서비스 중지 공격 유형을 정의하여, 최적화된 IPv6 멀티캐스트 구성 모델을 제시 하였다. 결론적으로 구현된 시스템에서 IPv6 패킷 분석을 통해서 최적화된 경로 통신 및 차별화된 IPv6 패킷의 QoS 방안을 제시하였으며, 서비스 중지공격을 대응하는 Security 보장성을 갖고 있음을 검증하여, 향후 상용화된 IPv4/IPv6 네트워크 구현을 위한 최적화 방안을 제시 하였다.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.17-25
• /
• 2007

In this paper, an algorithm that provisions proportional differentiation of packet delays is proposed with an objective for enhancing quality of service (QoS) in future packet networks. It features an adaptive scheme that adjusts the target delay every time slot to compensate the deviation from the target delay which is caused by the prediction error on the traffic to be arrived in the next time slot. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot. The difference between them is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential rate traffic. It is demonstrated through simulations that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism. The algorithm is implemented with VHDL on a Xilinx Spartan XC3S1500 FPGA and the performance is verified under the test board based on the XPC860P CPU.

• International Journal of Computer Science & Network Security
• /
• v.22 no.10
• /
• pp.191-200
• /
• 2022

Constrained Application Protocol (CoAP) is a standardized protocol by the Internet Engineering Task Force (IETF) for the Internet of things (IoT). IoT devices have limited computation power, memory, and connectivity capabilities. One of the significant problems in IoT networks is congestion control. The CoAP standard has an exponential backoff congestion control mechanism, which may not be adequate for all IoT applications. Each IoT application would have different characteristics, requiring a novel algorithm to handle congestion in the IoT network. Unnecessary retransmissions, and packet collisions, caused due to lossy links and higher packet error rates, lead to congestion in the IoT network. This paper presents an adaptive congestion control protocol for CoAP, Adaptive Congestion Control with a Backoff algorithm (ACCB). AACB is an extension to our earlier protocol AdCoCoA. The proposed algorithm estimates RTT, RTTVAR, and RTO using dynamic factors instead of fixed values. Also, the backoff mechanism has dynamic factors to estimate the RTO value on retransmissions. This dynamic adaptation helps to improve CoAP performance and reduce retransmissions. The results show ACCB has significantly higher goodput (49.5%, 436.5%, 312.7%), packet delivery ratio (10.1%, 56%, 23.3%), and transmission rate (37.7%, 265%, 175.3%); compare to CoAP, CoCoA+ and AdCoCoA respectively in linear scenario. The results show ACCB has significantly higher goodput (60.5%, 482%,202.1%), packet delivery ratio (7.6%, 60.6%, 26%), and transmission rate (40.9%, 284%, 146.45%); compare to CoAP, CoCoA+ and AdCoCoA respectively in random walk scenario. ACCB has similar retransmission index compare to CoAp, CoCoA+ and AdCoCoA respectively in both the scenarios.