• Title/Summary/Keyword: Tactical Message

Search Result 58, Processing Time 0.026 seconds

A Study on a Clustering for Military Tactical Information Communication Network (군 전술정보통신체계에서 클러스터 구조에 대한 연구)

  • Lee, Myung-Noh;Yoo, Jae-Young
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.709-712
    • /
    • 2010
  • A military tactical information communication network uses no base station and all mobile terminal are independent while mobile networks use an infra structure that a fixed base station supports many mobile terminals. A clustering system is more efficient than the existing one in small Ad-hoc network using a limited message size. The development of an adaptive clustering algorithm is necessary to maximize the network efficiency via a study on a clustering for military tactical information communication network.

  • PDF

Mutual Friendly Force Identification Protocol based on Hash-Chain for Personal Combat Systems

  • Lee, Jongkwan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.9
    • /
    • pp.3858-3869
    • /
    • 2020
  • In this paper, we propose a hash-chain based friendly force identification protocol for personal combatants equipped with a personal combat system in a tactical wireless network. It is imperative in military operations to effectively and quickly identify friendly forces. If the identification of friendly forces is not correct, this can cause friendly fire. In current ground operations, the identification of friendly forces by personal combatants is neither secure nor safe. To address this issue, the proposed protocol uses a hash-chain to determine if a detected person is friendly. Only friendly forces with the same materials that are assigned before they deploy can construct an initial hash-chain. Moreover, the hash-chain is changed at specific times. The performance of the proposed protocol is evaluated on the assumption that the secret key is leaked, which is the worst scenario in the security research field. We verify that the proposed protocol is secure for the various attack scenarios, such as message replay attack, fabrication attack, and Denial of Service attack.

A Study on the Design of KVMF 2.0 Protocol for Ensuring Backward/Forward Compatibility between Different KVMF Message Standard Versions

  • Jeong-Min, Lee;Won-Gi, Lim;Won-Jun, Cho;Yong-Cheol, Kim;Jeung-Sub, Lee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.3
    • /
    • pp.45-58
    • /
    • 2023
  • KVMF(Korean Variable Message Format) 1.0 protocol is the Army's standard tactical datalink protocol that defines standard messages and communication methods to enable data communication between various weapon systems through bitwise variable message processing. The protocol has been applied to a variety of Army weapon systems over the past decade and has contributed to upgrade the Army's operational capabilities by enabling the implementation of Network Centric Warfare (NCW), the core of modern warfare. Since the KVMF 1.0 protocol was applied, new weapon systems with new technologies have been introduced over time, and new weapon systems have new messages based on the characteristics of the weapon system. As a result, compatibility problems arose due to different message versions with existing weapon systems, and it was expected that these problems would continue to emerge in the future, considering the need for continuous message revisions. Therefore, it became necessary to solve this problem, so this paper proposed a KVMF 2.0 protocol design that guarantees compatibility between forward and backward versions. In this paper, we implemented the design as SW, and confirmed that the design worked successfully by test between forward and backward versions on test environment. Therefore, when the KVMF 2.0 protocol design is applied to a weapon system, we can expect that the weapon system can be compatible with the forward and backward versions working with the existing weapon systems as well as with the future weapon systems.

An approach to define variable length messages using ASN.1 (ASN.1을 이용한 가변 길이 메시지 표현 방법)

  • Baek, Haeun;Kang, Sungwon;Kim, Jingyu;Kim, Jungmin;Kwon, Koohyung;Kim, Sangsoo
    • Journal of Software Engineering Society
    • /
    • v.25 no.2
    • /
    • pp.35-47
    • /
    • 2012
  • Variable Message Format(VMF) is a communications protocol that allows computers to exchange tactical military information over low-data-rate bearers. VMF is designed to define message length and structure variably in order to allow the user to transmit only the relevant information by using indicators. However, flexibility of messages makes it difficult to analyze messages structure and figure out meanings. Furthermore, whenever messages are added or modified, message processing software should be updated and distributed to systems. In this paper, we propose a systematic approach to defining VMF messages that uses the international standard notation ASN.1. By describing VMF messages in ASN.1, protocol architects can deal with VMF messages accurately and conveniently, and use various ASN.1 tool. This paper develops ASN.1 description templates for VMF message segments, and presents an approach to describing VMF messages in ASN.1 by combining the templates.

  • PDF

Zone-Based Wireless Link-K Network Structure and Routing for Supporting Mission Group (작전임무그룹 지원을 위한 Zone 기반 무선 Link-K 네트워크 구조 및 라우팅)

  • Cheon, Minhwan;Baek, Hoki;Jee, Seungbae;Kim, Sangjun;Lim, Jaesung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.42 no.1
    • /
    • pp.108-120
    • /
    • 2017
  • To this end, the ROK military is developing a Korean Tactical Data Link (Link-K) in two stages: Basic and Completion types. Currently, the basic type of the Link-K has a limitations for supporting Mission Group(MG)s, such as to share unnecessary information and inefficient routing, because all RICCs simply broadcasts the same information in the basic type of the Link-K. In this paper, we propose a Zone-based Wireless Link-K network structure and a routing algorithm. To improve the effectiveness of the proposed routing algorithm, we have studied a filtering method that adjusts the message data according to the priority of the message and a method of controlling the load of the network. In order to evaluate the performance of the proposed scheme, it is proved that it is effective to support the mission task group compared with the existing wireless Link-K routing algorithm according to the operational scenario situation.

A Distributed Dynamic Address Assignment for Tactical Mobile Ad-hoc Networks (전술 MANET에서 그룹 단위 분산된 동적 주소 할당 기법)

  • Park, Mun-Young;Lee, Jong-Kwan;Baek, Ho-Ki;Kim, Du-Hwan;Lim, Jae-Sung
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.17 no.3
    • /
    • pp.327-335
    • /
    • 2014
  • In this paper, we propose a group distributed dynamic address assignment scheme suitable for tactical mobile ad hoc networks(MANET). Efficient address assignment is an important issue in the MANET because a node may frequently leave the current network and join another network owing to the mobility of the node. The conventional schemes do not consider the features of the tactical networks: existence of a leader node and network activity on a group basis. Thus, they may not be suitable for military operations. In our proposed scheme, called grouped units dynamic address assignment protocol(G-DAAP), a leader node maintains the address information for the members in the network and any of the nodes can exploit the information for the assignment or request of the IP address by a simple message exchange procedure. This leads to fast address assignment with small overheads. In addition, G-DAAP based on the modified IEEE 802.11e Enhanced Distributed Channel Access(EDCA) can assign addresses more quickly. We describe the delay performance of the G-DAAP and compare it with conventional schemes by numerical analysis and computer simulations. The results show that the G-DAAP significantly improves the delay performance as compared with the conventional schemes.

Reliable Dynamic TDMA Scheme with new Packing method for Image Transmission over Link-16 (Link-16에서 이미지 전송을 위한 신뢰성 기반의 동적 TDMA 기법과 새로운 패킹 방법)

  • Baek, Hoki;Lim, Jaesung;Koo, Jayeul;Jin, Jeonghwan;Chun, Philseong;Oh, Ilhyuk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1045-1053
    • /
    • 2012
  • Link-16 is a widely used TDL (Tactical Data Link) which uses TDMA (Time Division Multiple Access). Link-16 is a very low rate system, so it supports small size of data like tactical message and voice. However, there are related works to transmit situation awareness information like image due to the increasing interest about EBO(Effect-Based Operation), recently. Special TDMA scheduling is needed not static TDMA of Link-16 for image transmission because image data has much larger size than the existing tactical data. In this paper, we proposed Link-16K which enhances the Link-16 MAC. The proposed Link-16K is compatible with Link-16, and includes dynamic TDMA, new packing method, and an efficient retransmission scheme for image transmission effectively. We can see that image transmission delay is reduced and channel utilization is increased through simulation results of proposed idea.

Priority Based Medium Access Control and Load Balancing Scheme for Shared Situational Awareness in Airborne Tactical Data Link (공중 전술 데이터링크에서 상황인식 공유를 위한 우선순위 기반 매체접속제어와 부하분산 기법)

  • Yang, Kyeongseok;Baek, Hoki;Park, Kyungmi;Lim, Jaesung;Park, Ji Hyeon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.10
    • /
    • pp.1210-1220
    • /
    • 2016
  • As modern warfare has changed into network centered, the ability to share situational awareness among allies become a core competency for performing operational missions. In an airborne environment, it uses a tactical data link such as Link-16 for shared situational awareness. There exist problems when it shares situational awareness over the existing data link that can not allocate slots dynamically or that can not change the number of a slot to be allocated. In addition, there was a problem that can not share this failure so that failed to improves situation awareness because of finite time slot resources. In this paper, we accommodate dynamic slot allocation and changes of slot allocation with mixed structure of TDMA (time division multiple access) and random access. We propose a technique that can be used when available slots are exhausted, and a load balancing method to prevent slot allocation delay when slot requesting or message sending is concentrated on a single subframe.

Analysis of TM/TC data protocol of Military Unmanned Aerial Vehicles (군용 무인항공기의 TM/TC 데이터 프로토콜 분석)

  • Hong, Su-woon;Kim, Young-kil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.05a
    • /
    • pp.391-393
    • /
    • 2017
  • Unmanned aerial vehicles(UAVs) operating in the military for various purposes are designed to transmit information collected according to the purpose to GCS(Ground Control System), and to transmit/receive the vehicle's operational control and status information using wireless communication(or datalink). Currently, the military UAV systems in operation in Korea use unique communication methods, protocols, and message structures for each system. In this paper, we analyze the TM/TC data protocol of two types of military UAV systems currently under development and propose a more efficient TM/TC message design scheme in wireless communication(or datalink) environment. And we will discuss issues to be considered for standardization of technology for ensuring interoperability with many UAVs or newly introduced UAV systems.

  • PDF

A Tactical Internet Geocasting Protocol for Efficient Message Delivery (효율적인 메시지 전달을 위한 전술인터넷 지오캐스팅 프로토콜)

  • Yoon, Sun-Joong;Ko, Young-Bae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.1050-1061
    • /
    • 2009
  • The Tactical Internet(TI) managed by Infantry Brigades is used for the purpose of sharing information of Command Control and Situation Awareness. When there are more than two destinations to transmit data in the TI system, a multicasting is utilized based on pre-defined multicast groups. However even in the case when a source node needs to send some messages like weathercast and attack alarm etc to only a part of Battalion or Brigades in a specific geographical region (destination region), the current TI multicasting protocol is designed to transmit the messages to the pre-defined group or all of the Battalion/Brigade nodes, resulting in inefficiency in terms of end-to-end delay and overhead. In this paper, we propose more efficient protocol for such cases, named as "Tactical Internet Geocasting (TIG)". The proposed scheme firstly checks whether the destination region belongs to one Battalion region or more than two Battalion regions using location information, and then performs a greedy forwarding from the source node to the destination region, followed by a local flooding inside of the destination region. With performance analysis and simulations using NS-2, TIG is compared to the current TI multicasting protocol (i.e., Simplified MDP) and the LBM (Location-based Multicast). The simulation results show that the proposed TIG is more efficient than both in terms of delay and network overhead.