• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1C
• /
• pp.89-96
• /
• 2012

Since tactical robots are going to be grown and tactical data communications will be more network-centric, the reliability of wireless tactical data networks is going to be very important in the future. However, the connectivity of such wireless tactical data networks can be extremely uncertain in practical circumstances. In this paper, we propose a searching technique to find out the weak boundary area of the network connectivity using a small UAV(unmanned aerial vehicle) which has a simple polling access function to wireless nodes on the ground in wireless tactical data networks. The UA V calculates the network topology of the wireless tactical data networks and coverts it to the Lapalcian matrix. In the proposed algorithm, we iteratively search the eigenvalues and find a minimum cut in the network resulting in finding the weak boundary of the connectivity for the wireless tactical data networks. If a UAV works as a relay nodes for the weak area, we evaluate that the throughput performance of the proposed algorithm outperforms star connection method and MST(minimum Spanning Tree) connection method. The proposed algorithm can be applied for recovering the connectivity of wireless tactical data networks.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.27 no.7
• /
• pp.599-611
• /
• 2016

This paper proposes a cognitive engine platform that enables dynamic spectrum access(DSA) based on a spectrum sharing system for the military tactical network environment. The current military tactical wireless communication system is increasing need to secure a supplementary wireless spectrum to ensure that multiple wireless networks for different weapon systems co-exist, so that tactical wireless communication between the same or different systems can be operated effectively. This paper examined policy development and research activities engaged by the U.S. and European countries on wireless spectrum sharing to secure more spectrum. It also introduces the current status of cognitive engine development, which is the core technology of tactical wireless communication for DSA. In addition, based on the investigation performed into the latest trends, we propose a platform structure for a cognitive engine based on a spectrum sharing method where more frequencies can be added for tactical radio communication, so that DSA can be realized, and wireless networks of different weapon systems can co-exist.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.298-299
• /
• 2019

In this paper, we propose a stable mutual authentication protocol between unmanned combat systems in tactical wireless networks where long distance communications are not always guaranteed due to a poor channel condition. The proposed protocol generates an authentication code using hash collision of arbitrarily selected random data. The authentication requester encrypts and transmits it to the authenticator. They performs authentication by sharing the valid authentication code. We analyze the safety of the proposed method for various attack scenarios.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.21 no.5
• /
• pp.658-664
• /
• 2018

In this paper, we propose a group key management scheme for very high confidential information in tactical wireless networks. For the proposed scheme, we consider the tactical networks that has a hierarchical topology and the nature of high confidential information. The leader node, which may have higher probability of good channel state than others, provides some data to all the network member in order to generate a geographical group key and it transmits the encrypted information with minimum transmission power level to others. By this scheme, the security and reliability for sharing confidential information is ensured. The performance of the proposed scheme is validated by mathematical analysis. It shows that the proposed scheme makes nodes to share a high confidential information securely if the proper parameters for network design are selected.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.220-222
• /
• 2021

In this paper, we propose a resource allocation scheme based on entropy for tactical wireless networks. In a tactical situation, the sensing nodes that are located randomly provide transmitted data values depending on environmental conditions. Since they share wireless resources, nodes providing valuable data compared to others need to have more resources. The proposed scheme evaluates the value of received data by a sink node. Based on the results, the sink node reallocates resources to sensing nodes. Through various experiments, we verified the proposed scheme is superior to the fixed allocation scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11B
• /
• pp.1676-1684
• /
• 2010

Tactical network environments are characterized by unreliable connectivity, communication links which has limited bandwidth compared to commercial networks and distributed architecture where users have high mobility. The best route should be selected based on the required traffic characteristics which can be a wireless channel environments and a status of nodes which are moving. Those characteristics are self aware and should be a routing decision factor in order to guarantee a reliable data transfer. In this paper we define the requirements of services and traffic characteristics on tactical network environments and suggest the new routing method "AODV-IMTC" based on selective routing metric to enable efficient data transfer in wireless ad hoc networks.

• Journal of KIISE:Information Networking
• /
• v.37 no.2
• /
• pp.109-121
• /
• 2010

Recently, the military of Korea has been establishing the next generation wireless tactical communication system so called Tactical Information Communication Network (TICN). A routing protocol for TICN transport networks has to be able to select a path with high survivality, reliability, and stability while accommodating as many flows as possible with minimum QoS guarantees. The OSPF(Open Short Path First) used widely is determined to be the routing protocol for TICN. With the typical deployment practices OSPF, however, it cannot satisfy the requirements of TICN. In this paper, we propose a cost function for OSPF and a way to tune the OSPF protocol parameters for the TICN transport networks. Through simulations, it is shown that the OSPF with the proposed cost function provides better performance than the OSPF in terms of both the services provided to the applications and the network resources utilization.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.16 no.2
• /
• pp.160-168
• /
• 2013

In tactical environment, tactical wireless networks are generally comprised of Tactical MANETs(T-MANETs) or Tactical WMNs(T-WMNs). The most important services in tactical network are voice and low rate data such as command control and situation awareness. These data should be forwarded via multi-hop in tactical wireless networks. Urgent and mission-critical data should be protected in this environment, so QoS(Quality of Service) must be guaranteed for specific type of traffic for satisfying the requirement of a user. In IEEE 802.11s, TDMA-based MAC protocol, MCCA(MCF Controlled Channel Access), has a function of resource reservation. But 802.11s protocol can not guarantee the end-to-end QoS, because it only supports reservation with neighbors. In this paper, we propose the routing protocol, R-HWMP(Reservation-based HWMP) which has the resource reservation to support the end-to-end QoS. The proposed protocol can reserve the channel slots and find optimal path in T-WMNs. We analyzed the performance of the proposed protocol and showed that end-to-end QoS is guaranteed using NS-2 simulation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.2B
• /
• pp.120-129
• /
• 2012

Wireless mesh network (WMN) has recently emerged as a promising technology for tactical operation. If a platoon is organized with MPs, this system is suitable for tactical coverage is given for battle field where there is a shortage of wired infrastructure. However, MPs of typical WMN are generally fixed. This condition does not apply to diverse tactical scenarios. In this paper, it is considered that MPs have group mobility for flexible tactical networks. We propose cluster based multi-channel MAC scheme for mobilie WMN with single antenna condition. We have reduced the collision problems and message storming problems occur by mobility, so the reliability of WMN has been improved. Consequently, reliable communication is guaranteed by our framework in mobile WMN.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.344-358
• /
• 2011

Wireless tactical network (WTN) is the most important present-day technology enabling modern network centric warfare. It inherits many features from WMNs, since the WTN is based on existing wireless mesh networks (WMNs). However, it also has distinctive characteristics, such as hierarchical structures and tight QoS (Quality-of-Service) requirements. Little research has been conducted on hierarchical protocols to support various QoS in WMN. We require new protocols specifically optimized for WTNs. Control packets are generally required to find paths and reserve resources for QoS requirements, so data throughput is not degraded due to overhead. The fundamental solution is to adopt topology aggregation, in which a low tier node aggregates and simplifies the topology information and delivers it to a high tier node. The overhead from control packet exchange can be reduced greatly due to decreased information size. Although topology aggregation is effective for low overhead, it also causes the inaccuracy of topology information; thus, incurring low QoS support capability. Therefore, we need a new topology aggregation algorithm to achieve high accuracy. In this paper, we propose a new aggregation algorithm based on star topology. Noting the hierarchical characteristics in military and hierarchical networks, star topology aggregation can be used effectively. Our algorithm uses a limited number of bypasses to increase the exactness of the star topology aggregation. It adjusts topology parameters whenever it adds a bypass. Consequently, the result is highly accurate and has low computational complexity.