• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1148-1161
• /
• 2012

Recently, developments in the field of communication and network technologies induced new paradigm in the defense weapon system. As a consequence, military authorities develop the Tactical Information Communication Network(TICN) system to adapt to the changing paradigm. One of the most important functions of TICN is real-time communication. As a result, TICN system needs to receive real-time information from the battlefield, and the key technology to support these features is MANET(Mobile Ad-Hoc Network) routing protocol. In this paper, we analyze problems of the shortest path scheme in tactical Ad-Hoc networks, which is widely used in common Ad-Hoc networks. We propose efficient routing protocol for tactical MANET by considering the environment of small combat units, such as node position, speed and data size. The proposed algorithm shows reliable data transfer and low latency in battlefield.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.10-17
• /
• 2014

This paper presents an analytical method for finding the optimum transmission range in mobile ad hoc networks(MANETs). The results are particularly useful for the operation of military networks, as the transmission range affects the traffic throughput of user & routing traffic, delay, and frequency interference. When the conditions of tactical environment are applied in our simulations and the above-mentioned performances are analyzed, we find the OLSR protocol is more excellent. Plus, we compare the results of MANETs performance when applying optimum transmission range and the default transmission range(10km), and analyze the reasonability of the calculation of optimum transmission range proposed by this paper.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.871-878
• /
• 2004

Recenty, there has been great interest in MANET from various areas. In this paper we focus on performance analysis of on demand routing protocols surf as DSR, AODV, and TORA in MANET. We have conducted several simulations concerned with application service data such as sensor, text. voice, and video data. And then, we have evaluated the performance of three protocols in a pre-designed ad hoc network, which is consisted of 20 nodes. As a result, we have obtained quantitative data for packet delivery fraction, average end to-end delay, routing load, channel utilization from upper layer and supportable routing protocol for application service data. The results can be used for designing specific-purposed ad-hoc networks.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.314-323
• /
• 2002

The routing protocols designed for wired networks can hardly be used for mobile ad-hoc networks due to limited bandwidth of wireless transmission and unpredictable topological change. Recently, several routing protocols for mobile ad-hoc networks have been Proposed. However, when theme protocols are applied to support real time services like multimedia transmission, they still have problems in ad-hoc networks, where the topology changes drastically. In this paper, we propose a new route selection algorithm which selects the most reliable route that is impervious to route failures by topological changes by mobile hoots. For reliable route selection, the concept of virtual zone (stable zone and caution zone) is proposed. The zone is located in a mobile node'transmission range and determined by mobile node's mobility information received by Global Positioning System (GPS). The proposed algorithm is applied to the route discovery procedure of the existing on-demand routing protocol, AODV, and evaluated by simulation in various traffic conditions and mobility patterns.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.4
• /
• pp.40-46
• /
• 2011

Wireless Sensor Networks(WSNs) have shown a lot of good outcomes in providing a various functions depending on industrial expectations by deploying ad-hoc networking with helps of light loaded and battery powered sensor nodes. In particular, it is strongly requested to develop an algorithm of cross-layer control between 2-layer and 3-layer to deriver the sensing data from the end node to the sink node on time. In this paper, based on the above observation we have proposed an IEEE802.15.4 based self priority routing scheme under UC Berkely TinyOS platform. The proposed beacon based priority routing (BPR) algorithm scheme utilizes beacon periods in sending message with embedding the high priority data and thus provides high quality of service(QoS) in the given criteria. The performance measures are the packet Throughput, delivery, latency, total energy consumption. Simulation results under TinyOS Simulator(TOSSIM) have shown the proposed scheme outcome the conventional Ad hoc On-Demand Distance Vector(AODV) Routing.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.7
• /
• pp.1367-1372
• /
• 2007

This paper suggests One-time Password key exchange authentication technique for a strong authentication based on MANET and through identify wireless environment security vulnerabilities, analyzes current authentication techniques. The suggested authentication technique consists of 3 steps: Routing, Registration, and Running. The Routing step sets a safe route using AODV protocol. The Registration and Running step apply the One-time password S/key and the DH-EKE based on the password, for source node authentication. In setting the Session key for safe packet transmission and data encryption, the suggested authentication technique encrypts message as H(pwd) verifiers, performs key exchange and utilizes One time password for the password possession verification and the efficiency enhancement. EKE sets end to end session key using the DH-EKE in which it expounds the identifier to hash function with the modula exponent. A safe session key exchange is possible through encryption of the H(pwd) verifier. The suggested authentication technique requires exponentiation and is applicable in the wireless network environment because it transmits data at a time for key sharing, which proves it is a strong and reliable authentication technique based on the complete MANET.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10d
• /
• pp.372-375
• /
• 2007

본 논문에서는 이동 노드를 가지는 센서 네트워크와 같은 대규모 애드 혹 네트워크에서 사용 가능한 새로운 라우팅 프로토콜을 소개한다. 본 라우팅 프로토콜은 노드의 이동성을 효율적으로 지원하기 위해 GPS를 이용한 위치정보를 이용하며 가상 싱크 기법을 사용하여 위치정보의 빈번한 플러딩 없이 라우팅을 수행할 수 있도록 설계되었다. V-Geocast는 NS-2 시뮬레이터 환경에서 구현하였으며 단순한 Geocast나 AODV와 같은 기존의 애드 혹 라우팅 알고리즘에 대비하여 뛰어난 성능을 가지는 것을 확인하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.338-343
• /
• 2006

모바일 Ad-hoc 네트워크는 기간망을 활용할 수 없는 특수한 지역이나 응용에 활용되는 네트워크를 의미한다. 이 네트워크 내에서는 노드의 이동성이 높고 노드 자체의 에너지 제약 등으로 인해 빈번한 네트워크 단절등이 발생하게 된다. 노드의 이동성에 따른 토플로지 변경에 유연하게 반응하면서 패킷의 전달성을 향상시키는 기법이 모바일 Ad-hoc 네트워크 분야에 반드시 요구되며 본 논문에서는 이를 위해 혼합형 프로토콜인 PAOMDV(Possibility based AOMDV)와 OLSR-ME(OLSR with Modify Energy Efficiency)를 제안한다. 이 프로토콜을 기존의 프로토콜인 AODV, AOMDV, ZRP와 비교 실험을 수행하고 그 성능을 검증하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.793-795
• /
• 2001

Ad-hoc 망은 인터넷과는 다른 독립적인 망을 구성하는 경우 사용되게 된다. 이러한 Ad-hoc의 특정 호스트가 인터넷 망과의 연결을 시도하는 경우, 이 호스트로의 패킷의 라우팅을 위해서는 모든 경로상의 라우터에서 이 호스트에 대한 정보의 엔트리가 추가되어야만 한다. 이는 망 구현 과정에서 확장성 (Scalability) 문제를 야기하게 된다. 즉, 라우팅 테이블 엔트리의 증가로 차지하는 라우터의 메모리 문제나, 해당 호스트의 정보를 찾고자 할 때의 소요시간으로 적용하기 어렵다. 이러한 확장성 문제를 제거하는 방법으로 자동으로 주소를 설정 하는 방식인 DHCP(Dynamic Host Configuration Protocol)에 대해서 알아 보았다. 그리고. DHCP의 문제점인 기존의 라우팅 정보를 손실되는 문제가 있어 적용하기 어렵다. 이에 본 논문은 확장성 문제를 제거하는 동시에 엑세스 포인트(access point)에서 NAT(Network Address Translation) 기술을 적용하여 AODV(Ad-Hoc On-Demand Distance Vector) 라우팅 프로토롤과 인터넷의 연동을 위한 메커니즘을 제안한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11b
• /
• pp.1367-1370
• /
• 2002

본 논문에서는 안정적인 단방향 링크 환경을 갖는 Ad Hoc 네트워크에 적용할 수 있는 라우팅 프로토콜을 제안한다. 이동 Ad Hoc 네트워크에서 자주 발생하는 단방향 링크는 그 불안정성 때문에 프로토콜의 복잡성을 증가시키고, 성능을 저하시키는 원인이 될 수 있기 때문에 대부분의 현재 제안되고 있는 라우팅 프로토콜에서 고려되지 않고 있다. 그러나, 단방향 링크는 항상 양방향 링크보다 짧은 경로를 제공하여, 효율적 활용되면 오히려 망의 성능을 향상시킬 수 있는 중요한 망 자원이다. 본 논문에서는 반영구적으로 고정된 노드들을 망 하부구조로 갖으며 단방향 링크를 활용한 Ad Hoc 네트워크 구조(HANIC)를 소개하고, HANIC구조에 활용할 Ad Hoc 라우팅 프로토콜인 $H^2$DVRP를 제안한다. $H^2$DVRP는 AODV 라우팅 프로토콜에 단방향 링크 환경 지원을 위한 기능을 추가하여 구성된 라우팅 프로토콜이다.