• Title/Summary/Keyword: data link

Search Result 2,466, Processing Time 0.03 seconds

A SES Alarmed Link Encryption Synchronization Method Having Optimized Threshold Value for High-Speed Video Data Encryption

  • Kim, Hyeong-Rag;Lee, Hoon-Jae;Kim, Ki-Hwan;Jung, Ju-Hyun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.9
    • /
    • pp.57-64
    • /
    • 2017
  • CCSDS Standard is widely used in the international space telecommunication area. But standard recommendation of CCSDS is not restrictive, so, we can select an appropriate encryption protocol among the layer. For synchronization, encryption sync is attached in the beginning of the encrypted data. In the exceptional environmental condition, although the receiver can not decrypt the normal data, the sender have no conception of that situation. In this paper, we propose a two-stage SES alarmed link encryption synchronization method having optimized threshold value necessary to decide whether the receiver has a correct decryption or not. first, through the experiment of mutual relations between error rate and encryption synchronization detection error, we can predict worst communication environment for the selected encryption synchronization pattern. second, through the experiment for finding what number of consecutive frame synchronization error is an appropriate reference value and analysis of that experiment, we suggest an optimized threshold value for resynchronization request. lastly, through the output images we can predict the probability error that should be guaranteed by channel coder.

The Marginal Model for Categorical Data Analysis of $3\times3$ Cross-Trials ($3\times3$ 교차실험을 범주형 자료 분석을 위한 주변확률모형)

  • 안주선
    • The Korean Journal of Applied Statistics
    • /
    • v.14 no.1
    • /
    • pp.25-37
    • /
    • 2001
  • The marginal model is proposed for the analysis of data which have c(2: 3) categories in the 3 x 3 cross-over trials with three periods and three treatments. This model could be used for the counterpart of the Kenward-Jones' joint probability one and should be the generalization of Balagtas et ai's univariate marginal logits one, which analyze the treatment effects in the 3 x 3 cross-over trials with binary response variables[Kenward and Jones(1991), Balagtas et al(1995)]. The model equations for the marginal probability are constructed by the three types of link functions. The methods would be given for making of the link function matrices and model ones, and the estimation of parameters shall be discussed. The proposed model is applied to the analysis of Kenward and Jones' data.

  • PDF

Satellite Link Simulator Development in 100 MHz Bandwidth to Simulate Satellite Communication Environment in the Geostationary Orbit (정지궤도 위성통신 환경모의를 위한 100 MHz 대역폭의 위성링크 시뮬레이터 개발)

  • Lee, Sung-Jae;Kim, Yong-Sun;Han, Tae-Kyun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.14 no.5
    • /
    • pp.842-849
    • /
    • 2011
  • The transponder simulator designed to simulate the transponder of military satellite communication systems in the geostationary orbit is required to have time delay function, because of 250 ms delay time, when a radio wave transmits the distance of 36,000 km in free space. But, it is very difficult to develop 250 ms time delay device in the transponder simulator of 100 MHz bandwidth, due to unstable operation of FPGA, loss of memory data for the high speed rate signal processing. Up to date, bandwidth of the time delay device is limited to 45 MHz bandwidth. To solve this problem, we propose the new time delay techniques up to 100 MHz bandwidth without data loss. Proposed techniques are the low speed down scaling and high speed up scaling methods to read and write the external memory, and the matrix structure design of FPGA memory to treat data as high speed rate. We developed the satellite link simulator in 100 MHz bandwidth using the proposed new time delay techniques, implemented to the transponder simulator and verified the function of 265 ms time delay device in 100 MHz bandwidth.

RF Transceiver Design and Implementation for Common Data Link (공용 데이터링크 RF 송수신기 설계 및 구현)

  • Kim, Joo-Yeon
    • Journal of IKEEE
    • /
    • v.19 no.3
    • /
    • pp.371-377
    • /
    • 2015
  • This paper is about the RF transceiver designed and implementation for common data link. The trasmitter is configured as a frequency up-converter, a power amplifier and a duplexer. The receiver is configured as a duplxer, a frequency down-converter and a low noise amplifier. The maximum transmission distance, the reception sensitivity is designed to meet the electrical and temperature characteristics and the like. Using a modeling and simulation in order to meet the requirements of the RF transceiver has been designed and implemented. Transmitting output power and Noise Figure has been measured with 38.58dBm and 5.5dB, respectively. All of the electrical and temperature specifications was meet. Was confirmed all of the requirement specification by electrical characteristics test and temperature characteristics test.

A study on congesting control scheme for LAN interworkding in connectionless data service (비연결형 데이터 서비스에서 LAN연동을 위한 폭주 제어에 관한 연구)

  • 박천관;전병천;김영선
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.3
    • /
    • pp.29-38
    • /
    • 1998
  • This ppaer suggests a congestion control scheme for CL(ConnectionLess) overlay network using the feedback loops getween CL werver, between CL servers, and the header translation table of CL server. The CL overlay network for CBDS(Connectionless Broadband Data Service) defined by ITU0T(International Telecommunication Union-Telecommunication) consists of CL servers which route frames and links which connect between CL user and CL server or between CL servers. In this CL overlay network, two kinds of congestions, link congestion and CL server congestion, may occur. We suggest a scheme that can solve the congestion using ABR(Available Bit Rate) feedback control loop, the traffic control mechanism. This scheme is the link-by-link method suing the ABR feedback control loops between CL user and CL server or between CL servers, and the header translation table of CL server. As CL servers are always endpoints of ABR connections, the congestion staturs of the CL server can be informed to the traffic sources using RM(Resource Management) cell of the ABR feedback loops. Also CL server knows the trafffic sources making congestion by inspecting the source address field of CLNAP-PDUs(ConnectionLess Network Access Protocol - Protocol Data Units). Therefore this scheme can be implemeted easily using only both ABR feedback control loop of ATM layer and the congestion state table using the header translation table of CL server because it does not require separate feedback links for congestion control of CL servers.

  • PDF

Research of Considerations for Effective Operation of Weapons Data Link (무장데이터링크의 효과적인 운용을 위한 고려사항 고찰)

  • Woo, Sang Hyo;Baek, Inhye;Kwon, Ki-Jeong;Kim, Ki Bum
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.21 no.6
    • /
    • pp.886-893
    • /
    • 2018
  • U.S. and the allies attacked chemical weapons sites in Syria in 2018, and verbal battles are carried out about the effectiveness of the air strike. Syria claimed 13 missiles were shot down, and Russia claimed 71 missiles were shot down while the U.S. released pictures of completely destroyed targets, only. It led controversy about the effectiveness of missile defense system. If there is a method to observe mission success rate of the air strike, it can not only improve combat awareness but also can be a good sales strategy in military industry. This paper describes effects and considerations of a Weapon Data Link(WDL) technology which can be used as a smoking gun of effectiveness. The paper describes WDL abilities such as In-Flight Track Update, Loiter, and Bomb Hit Indication etc., and presents examples of expected effectiveness of the WDL. In addition, this paper briefly summarizes operational consideration for better performance.

Protection of a Multicast Connection Request in an Elastic Optical Network Using Shared Protection

  • BODJRE, Aka Hugues Felix;ADEPO, Joel;COULIBALY, Adama;BABRI, Michel
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.119-124
    • /
    • 2021
  • Elastic Optical Networks (EONs) allow to solve the high demand for bandwidth due to the increase in the number of internet users and the explosion of multicast applications. To support multicast applications, network operator computes a tree-shaped path, which is a set of optical channels. Generally, the demand for bandwidth on an optical channel is enormous so that, if there is a single fiber failure, it could cause a serious interruption in data transmission and a huge loss of data. To avoid serious interruption in data transmission, the tree-shaped path of a multicast connection may be protected. Several works have been proposed methods to do this. But these works may cause the duplication of some resources after recovery due to a link failure. Therefore, this duplication can lead to inefficient use of network resources. Our work consists to propose a method of protection that eliminates the link that causes duplication so that, the final backup path structure after link failure is a tree. Evaluations and analyses have shown that our method uses less backup resources than methods for protection of a multicast connection.

A study on improving the evaluation of motorway functions using Trip Length Frequency Distribution(TLFD) (통행거리빈도분포를 활용한 고속도로 기능 평가 개선 연구)

  • Kwon, Ceholwoo;Yoon, Byoungjo
    • Journal of Urban Science
    • /
    • v.11 no.2
    • /
    • pp.9-17
    • /
    • 2022
  • The purpose of this study is to develop an index for evaluating the function of a new motorway using the travel distance frequency distribution (TLFD) calculated using the vehicle travel route big data, and to overcome the limitations of the evaluation through the existing traffic volume. The mobility evaluation index of motorways was developed by applying it to the TLFD data table in 2019. The smaller the value of the mobility evaluation index of the link is calculated, the more it is a link with mainly short-distance travel, and the higher the value of the mobility evaluation index, the more it means a link with mainly long-distance travel. The accessibility evaluation index was calculated through the result of the mobility evaluation index of all motorways developed, and all motorways were grouped into three groups using K-means clustering. Group A was found to exist inside a large city and consisted of motorways with many short-distance traffic, Group B was investigated as acting as an arterial between groups, and Group C was classified as a motorway consisting mainly of long-distance traffic connecting large cities and large cities. This study is significant in developing a new motorway function evaluation index that can overcome the limitations of motorway function evaluation through the existing traffic volume. It is expected that this study can be a reasonable comprehensive indicator in the operation and planning process of motorways.

Stability-based On-demand Multi-path Distance Vector Protocol for Edge Internet of Things

  • Dongzhi Cao;Peng Liang;Tongjuan Wu;Shiqiang Zhang;Zhenhu Ning
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.10
    • /
    • pp.2658-2681
    • /
    • 2023
  • In edge computing scenarios, IoT end devices play a crucial role in relaying and forwarding data to significantly improve IoT network performance. However, traditional routing mechanisms are not applicable to this scenario due to differences in network size and environment. Therefore, it becomes crucial to establish an effective and reliable data transmission path to ensure secure communication between devices. In this paper, we propose a trusted path selection strategy that comprehensively considers multiple attributes, such as link stability and edge cooperation, and selects a stable and secure data transmission path based on the link life cycle, energy level, trust level, and authentication status. In addition, we propose the Stability-based On-demand Multipath Distance Vector (STAOMDV) protocol based on the Ad hoc AOMDV protocol. The STAOMDV protocol implements the collection and updating of link stability attributes during the route discovery and maintenance process. By integrating the STAOMDV protocol with the proposed path selection strategy, a dependable and efficient routing mechanism is established for IoT networks in edge computing scenarios. Simulation results validate that the proposed STAOMDV model achieves a balance in network energy consumption and extends the overall network lifespan.

An Uncertain Graph Method Based on Node Random Response to Preserve Link Privacy of Social Networks

  • Jun Yan;Jiawang Chen;Yihui Zhou;Zhenqiang Wu;Laifeng Lu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.1
    • /
    • pp.147-169
    • /
    • 2024
  • In pace with the development of network technology at lightning speed, social networks have been extensively applied in our lives. However, as social networks retain a large number of users' sensitive information, the openness of this information makes social networks vulnerable to attacks by malicious attackers. To preserve the link privacy of individuals in social networks, an uncertain graph method based on node random response is devised, which satisfies differential privacy while maintaining expected data utility. In this method, to achieve privacy preserving, the random response is applied on nodes to achieve edge modification on an original graph and node differential privacy is introduced to inject uncertainty on the edges. Simultaneously, to keep data utility, a divide and conquer strategy is adopted to decompose the original graph into many sub-graphs and each sub-graph is dealt with separately. In particular, only some larger sub-graphs selected by the exponent mechanism are modified, which further reduces the perturbation to the original graph. The presented method is proven to satisfy differential privacy. The performances of experiments demonstrate that this uncertain graph method can effectively provide a strict privacy guarantee and maintain data utility.