Earticle

This paper proposes the end-to-end security scheme with packet key mechanism to perform ciphering of user traffic between two User Equipments (UEs) attached to the different Long Term Evolution (LTE) networks. In LTE system, each UE derives its master key after a mutual authentication is performed between the UE and its local LTE network. In this paper, two end-to-end UEs use their own master keys to generate real-time packet keys where different packet keys are applied to encrypt packet stream data on a packet basis. Because the life cycle of the packet key is same as a packet period, the proposed security scheme significantly improves the security strength for end-to-end LTE users. This paper also analyzes the security strength of the proposed packet key system as well as the degree of latency for the session initialization, real-time packet encryption, and real-time packet decryption.

This work investigates the problem of efficient packet scheduling and transmission for IEEE 802.15.4e TSCH based on the Traffic-Aware Scheduling Algorithm (TASA). Three Integer Linear Programming (ILP) formulations are proposed, namely ILP1, ILP2, and ILP3, to comprehensively address key aspects of how packets are optimally delivered from child nodes to the root node, including node parent selection, packet scheduling, and frequency assignment. ILP1 is proposed to model the fundamental operations of TASA including packet scheduling and frequency assignment, while ILP2 further takes node parent selection into consideration for jointly optimizing node parent selection, packet scheduling, and frequency assignment. Despite its superior performance, ILP2 is only applicable to relatively small network problems due to high computational complexity. Therefore, we finally propose ILP3 for fast and efficient node parent selection. ILP3 can be combined with ILP1 and, most importantly, TASA for achieving effective node parent selection atop packet scheduling and frequency assignment for practical TSCH networks. ILP3 combined with ILP 1 led to computational complexity while ILP3 combined with TASA yielded good performance where it required less than one second of execution time and less packet delivery time.

Redundancy elimination or deduplication over network packets requires significant computing resources to find basic units of repeated contents, called chunks, by checking every byte in every packet. In this paper, we present the first constant-time chunking algorithm that divides every packet into a predefined number of chunks, irrespective of the packet size. In addition, we present the best implementation practice for packet-level deduplication by selecting an optimal combination of chunking, fingerprinting, and hash table algorithms. Through experiments with real traffic, we confirm that the throughput is improved by three times, compared with even the state-of-the-art scheme.

By considering the limited energy of Internet of Things (IoT) devices. We take the resource allocation to guarantee the stringent Quality of Service (QoS) depending on the joint optimization of power control and finite blocklength of channel. To achieve large volumes of arrival rates, we propose Adversarial Training based Generative Adversarial Networks (AT-GANs), which utilize a significant number of extreme events to provide high reliability and adjust real data in real-time. Simulation results show that Deep-Reinforcement Learning (Deep-RL) for AT-GAN could eliminate the transient training time. As a result, the AT-GAN keeps the reliability higher than 99.9999%.

In this paper, we propose and analyze an unmanned aerial vehicle (UAV)-assisted non-orthogonal multiple access (NOMA) short packet communication (SPC) system, where finite-size data packets are transmitted from a UAV to multiple users. The block error rate (BLER), throughput, and energy efficiency (EE) are used as metrics to evaluate the proposed system performance. We adopt the Gaussian-Chebyshev quadrature and the first-order Riemann integral to derive the approximate expressions of BLERs. The accuracy of the derived expressions is verified by presenting that numerical results are perfectly matched with analysis results. We also formulate optimization problems to maximize the throughput with respect to the number of transmitted bits and the altitude of the UAV. Numerical results in this paper provide useful knowledge about the relationships among BLER, throughput, EE, transmitted packet size, the altitude of the UAV, and the Rician factor.

저궤도위성의 프로그램 운영의 목적에 따라위성의 탑재체를 외부에서 개발하여 위성 버스에 장착하게 된다. 이때 탑재체의 원격텔레메트리 시스템이 위성버스시스템에 설계된 기존 원격텔레메트리 형태에서 벗어난 새로운 형태를 가질 경우, 기존 원격텔레메트리 시스템에 이를 쉽게 반영하기 힘들었으며, 위성 전체 원격텔레메트리 운영 구조가 기형적인 형태를 가지게 되었다. 즉, 기존 원격텔레메트리 구조와 변경된 구조가 동식에 존재하면서 위성 시험 및 관리, 탑재소프트웨어 개발 면에서 여러 가지 어려움이 제기되었다. 따라서 탑재체의 원격텔레메트리 시스템의 변경에 유연하게 대응할 수 있는 원격텔레메트리 시스템 개발이 필요하다. 또한 저궤도위성의 성능이 고도화됨에 따라 텔레메트리 데이터가 크게 증가하여기존의 텔레메트리 운용 시스템에서는 이들을 효과적으로 수용할 수 없었다. 원격텔레메트리를 전송하는 단위가 고정된 그리드 (Grid) 구조인 텔레메트리전송 체계는 설계상의 오류 발생 가능성이 크며 설계가 진행됨에 따라 새로운 텔레메트리를 전송받기 위해 그리드 전체를 변경해야 했다. 그리드 방식에서는 Dump 데이터의 운용 역시 많은 제한을 받았다. 이러한 약점을 완하기위해 최근 유럽에서 인공위성의 텔레메트리 운용에 이용하고 있는PUS (Packet Utilization Standard)개념을 검토하여 차세대 저궤도위성의 데이터 처리에 이용하고자 한다. 이 개념을 바탕으로 기존 위성 텔레메트리 시스템에서는 제한적으로 사용되었던 Dump 데이터 전송 및 Event 운용을 위성상태데이터와 별도로 운영할 수 있게 설계 하였고, 대량의 위성상태데이터를 효율적으로 운영할 수 있도록 Packet 단위의 위성텔레메트 리 시스템을 설계하였다

The conventional telemetry system of Korean low-earth orbiting satellites has certain limitations in accommodating various missions. As the payload becomes complex, it requires very complicated operational concepts in terms of telemetry. With the current design, the telemetry formats have to be rebuilt whenever new payloads or operation concepts are involved, and many constraints in operation shall be produced due to the lacks of its flexibility. As the capability and performance of a satellite have been improved, the communication structure of the satellite should be improved to gather more telemetry data. For the efficiency of data handling, it is necessary to change the grid based telemetry system in which the downlink interval and types for telemetry was limited. Comparing the fixed data map such as grid type, the packet based telemetry system can be operated as flexible and various types of packet can be designed such as the dump packet and the event packet. The sequence of the packets can be modified or newly defined to manage the massive satellite state of health data. In this paper, a new strategy for the telemetry development partially derived from PUS (Packet Utilization Standard) of European Space Agency, which provides enhanced features for the accommodation of payloads & operational requirements, is presented.

본 논문은 RPR 망에서 외부의 공격으로 인해 새로운 노드의 추가, 제거 혹은 링크의 단절과 같은 상황이 발생하였을 때, 보다 신속하게 망을 복원할 수 있도록 새로운 방안을 제안한다. 망 복원에 소요되는 시간은 크게 문제를 감지하는데 소요되는 시간과 이를 복원하는데 소요되는 시간으로 나눌 수 있다. 본 논문에서는 이러한 시간들을 각각 단축함으로써 신속한 망 복원을 가능하게 하는 방법을 제안한다. 기존의 복구 방식에서는 망 복원용으로 사용되는 프로텍션 메시지의 전송으로 링크 또는 노드의 상태를 지속적으로 보고하며, 이러한 프로텍션 메시지의 전송 간격은 지수증가 한다. 프로텍션 메시지의 전송 간격이 지수증가 함으로써 야기되는 문제점은, 프로텍션 메시지의 전송 실패로 인해, 링크 또는 노드의 상태 보고가 지연될 수 있다는 것이다. 이를 해결하기 위해서 본 논문에서는 노드간의 자동 대역조절을 위하여 1ms주기로 전송되는 b형 공평메시지에 링크 또는 노드의 상태 정보를 실어서 전송하는 방법을 제안한다. 또한, 기존의 링크의 단절을 보다 신속히 감지하기 위한 방법도 제안한다.

In this paper, we suggest new fast recovery mechanism in RPR in case of node addition or removing by exterior attack. A RPR network recovery time is consist of two. Failure detecting time and reporting time are that. In this papser we propose fast recovery mechanism that can reduce each time. In a Legacy recovery mechanism, To report node’s state, rpr node transmit protection messages. But interval of this messages increase exponentially. Thus A transmission failure of protection message cause delay of reporting of network state. Therefore we propose new node state reporting mechanism that put a node state in type b fairnes message. And We also suggest fast failure detecting mechanism.

Today, the network becomes the core element in all that is done efficiently and effectively. They include block transfer, linear transfer, and asynchronous transfer. Optical Burst Switching (OBS) is also classified with them. By picking on data sent with OBS, some security failures occur, and these comprise Replay Attacks, Spoofing, and Burst Header Packet (BHP) flooding attacks which are among these threats. The addressed methodology incorporates the application of the Support Vector Machine (SVM) algorithm to fight down BHP attacks. The simulation outcomes reveal that the performance which is obtained from the actual learning algorithm is the best at 97.7% in all four classes of flooding attacks which include NB-No Block, NB-Wait, No Block, or Block. This proposed Intelligent Identification of BHP Flooding Attack on OBS utilizing Machine Learning Technique (I2BHPOBSML) shows that it is giving better results than the past Works.

Vehicular Adhoc Network (VANET) are vital in enhancing communication and safety in intelligent transportation systems, autonomous vehicles, and cooperative driving. Efficient and reliable data transmission in V2V scenarios is crucial for road safety and traffic management. However, high mobility and the dynamic nature of vehicular environments lead to challenges such as high packet loss, and packet queue length to mitigate network performance. To address these issues, we propose an innovative approach that leverages packet transmission data using weighted attention mechanism to predict packet flow and reduce congestion. We obtained a comprehensive dataset by integrating the H2V (Highway-to-Vehicle) based DSRC (Dedicated Short- Range Communication) protocol with the OMNET++ and SUMO simulators, encompassing network metrics such as queue length, packet loss and packet delay. The proposed LSTM approach shows promising results in predicting congestion patterns, enhancing the packet delivery ratio. Conclusively, our WDL-H2V model maintains a consistently high PDR to continuously mitigate congestion.

예이츠와 파운드 사이의 관계의 대체적인 큰 그림은 1910년대 수년간 형성되었다. 파운드는 부분적으로 예이츠를 만나기 위해 1908년 런던으로 오는데, 예이츠는 그보다 20년 연상이고 파운드는 예이츠를 시 분야에서 살아있는 거장으로 생각했다. 파운드는 문인들 사이에 곧 자리를 잡고, 올리비어 셰익스피어의 소개로 예이츠를 만나고, 예이츠가 매월요일마다 갖는 모임에 정규적으로 참석한다. 얼마 후 예이츠는 파운드를 비서로 고용하여 1913년부터 16년까지 서섹스의 스톤 코티지에서 3년간 겨울마다 함께 머물면서 편지를 받아쓰게 하거나 가까이서 시를 쓴다. 이 생산적인 기간에 두 저명한 업적이 남는데, 예이츠의 『페르 아미카 루네』(1918년)와 파운드의 ｢세 편의 장편시｣를 포함하는 『러스트라』(1917년)가 그것이다.

The general contour of the relationship between Yeats and Pound was shaped profoundly during a number of years in the 1910s: Pound arrived in London in 1908 partly to seek out Yeats, who was twenty years his senior and whom he considered a living master of his métier. Pound quickly established himself on the literary scene, was introduced to Yeats by Olivia Shakespear, and become a regular attendee of Yeats’s Monday evenings. Later on Yeats employed Pound as his secretary for three winters from 1913-16 at Stone Cottage, Sussex, dictating his letters to Pound and composing his poetry in close proximity. This period of fruitful collaboration ended with the twin achievements of Yeats’s Per Amica Silentia Lunae (1918) and Pound’s Lustra including “Three Cantos” (1917).

전통적인 회선교환 방식에서 패킷 교환 방식으로 네트워크가 진화함에 따라 분산된 클럭의 동기화를 위한 패킷 기반 동기화 방식은 큰 주목을 받고 있다. 특히 네트워크의 혼잡이 심각한 경우 패킷교환 네트워크의 특성에 기인하는 패킷 지연 변화 (PDV)는 IEEE1588 PTP (Precision Time Protocol)를 기반으로 하는 패킷 기반의 동기화 시스템에서 클럭 잡음의 주요 원인으로 작용한다. 본 논문에서는 IEEE1588 PTP의 동기화 성능을 개선하기 위해 이러한 클럭 잡음을 완화시킬 수 있는 비선형 SMoPF (Sample Mode Packet Filtering) 메커니즘을 제안하였다. 제안된 SMoPF 기법의 성능평가를 얻기 위하여 임의의 혼잡도를 갖는 패킷 교환 네트워크에서의 IEEE1588 PTP 동기화 프로토콜을 고려하였으며OMNET++ 툴 기반의 컴퓨터 시뮬레이션을 수행하였다. 또한, 제안된 기법의 성능은 기존의 샘플 최소 필터링, 평균 필터링, 최대 필터링 기법들과 비교 분석 되었다.

Packet-based methods for synchronizing distributed clocks are getting tremendous attention as networks are evolving from the conventional circuit-switched to packet-switched architecture. Packet Delay Variation (PDV) inherent in packet-switched networks, especially when the network is moderately or heavily congested, is a dominant source of clock noise in the packet-based synchronization systems that are based in IEEE 1588 Precision Time Protocol (PTP). This paper presents a non-linear Sample Mode Packet Filtering (SMoPF) mechanism to smooth such a clock noise to enhance the synchronization performance of IEEE 1588 PTP. Performance of the proposed SMoPF mechanism is compared (via computer simulations in OMNET++) with that of existing sample minimum-, sample mean-, and sample-maximum filtering mechanisms considering the IEEE 1588 PTP synchronization domain on top of an arbitrarily congested packet-switched network.