• Journal of KIISE:Information Networking
• /
• v.33 no.4
• /
• pp.299-309
• /
• 2006

In Mobile ad hoc networks, AODV is one of the famous on-demand routing protocol, which use the routing tables in the nodes if possible, or Route Discovery Process (RDP) is triggered to find a new route. However increasing the traffic of RDP causes dropping of the network performance in the large size of ad hoc networks. In this paper, we propose a novel routing protocol, named as AOZDV (Ad hoc On-demand Zone and Distance-Vector Routing), which enhances the AODV protocol with zone routing. AOZDV creates a Zone with neighbor nodes of the source/destination using traffic and power information, and utilizes Destination-Vector Table for internal routing in the Zone. We show by simulations that AOZDV can reduce the occurrence rate of route fail and RDP caused by route fail compared to existing routing protocols such as DSR and AODV.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10c
• /
• pp.375-377
• /
• 2000

유선 네트워크 환경을 위해 디자인된 경로설정 프로토콜들은 대역폭의 제한성과 예측할 수 없는 토폴로지의 변화로 인해 ad-hoc 네트워크 환경에 적용하기에는 부적합하다. 최근 들어 ad-hoc 네트워크 환경에 적합한 경로설정 프로토콜들이 많이 개발되었다. 본 논문에서는 기존의 ad-hoc 경로설정 프로토콜을 토폴로지 변화에 대한 적응력을 향상시키기 위해서 GPS(Global Positioning System) 기술을 활용하여 가상 지역(virtual zone) 개념을 제안하고 있다. 본 논문에서 제안하는 프로토콜은 AODV(Ad-hoc On-demand Distance Vector) 경로설정 프로토콜을 기본으로 하고 있다. AODV의 경로설립(route discovery) 과정 시 이러한 가상 지역 개념을 도입함으로써 이동 단말의 이동성에 의한 토폴로지의 변화에도 불구하고 잘 적응할 수 있는 안정된 경로의 설립을 목표로 하고 있다. 본 논문에서는 시뮬레이션을 통하여 다양한 트래픽 상태와 단말들의 이동성 형태에 따른 중요 변수들을 설명하였으며 이에 따라 제안된 경로설정 프로토콜(AODV-GPS)의 효율성을 검증하고 있다.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.447-454
• /
• 2006

An ad-hoc network routing protocol, AODV(Ad-hoc On-demand Distance Vector) initially uses ERS(Expanding Ring Search) algorithm to control the RREQ(Route Request) retransmission in the route discovery process. Because ERS uses the fixed NTT(Node Travesal Time), it does not reflect accurately ad-hoc network environment. In this paper, we propose an improved ERS algorithm which lowers the retransmission rate. It uses RREP(Route Reply) and gives different weights in NTT of each node in accordance with the adjacency to an originating node. To show the effectiveness of the proposed algorithm, we perform a simulation using ns2. The simulation results showed that the proposed algorithm has better performance than existing algorithms.

• International journal of advanced smart convergence
• /
• v.8 no.4
• /
• pp.169-178
• /
• 2019

Due to the characteristics of an ad hoc network without a control center, self-organization, and flexible topology, the trust evaluation of the nodes in the network is extremely difficult. Based on the analysis of ad hoc networks and the blockchain technology, a blockchain-based node-level trust evaluation model is proposed. The concepts of the node trust degree of the HASH list on the blockchain and the perfect reward and punishment mechanism are adopted to construct the node trust evaluation model of the ad hoc network. According to the needs of different applications the network security level can be dynamically adjusted through changes in the trust threshold. The simulation experiments demonstrate that ad-hoc on-demand distance vector(AODV) Routing protocol based on this model of multicast-AODV(MAODV) routing protocol shows a significant improvement in security compared with the traditional AODV and on-demand multipath distance vector(AOMDV) routing protocols.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.46-55
• /
• 2020

Ad Hoc network is a special wireless network, mainly because the nodes are no control center, the topology is flexible, and the networking could be established quickly, which results the transmission stability is lower than other types of networks. In order to guarantee the transmission of data packets in the network effectively, an improved Queue Ad Hoc On-demand Distance Vector Routing protocol (Q-AODV) for node detection by using blockchain technology is proposed. In the route search process. Firstly, according to the node's daily communication record the cluster is formed by the source node using the smart contract and gradually extends to the path detection. Then the best optional path nodes are chained in the form of Merkle tree. Finally, the best path is chosen on the blockchain. Simulation experiments show that the stability of Q-AODV protocol is higher than the AODV protocol or the Dynamic Source Routing (DSR) protocol.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.9
• /
• pp.29-35
• /
• 2009

In this paper we propose a mobile ad-hoc routing protocal based on AODV(Ad hoc On demand Distance Vector) with traffic management support and evaluate the performance through simulation. The average reception rate is increased by establishing the shortest route, considering in advance the usable communication resources at each node. For performance evaluation, we analyze the average data reception rate, considering the node mobility.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.3
• /
• pp.469-477
• /
• 2008

The standard routing protocol of MANET(Mobile Ad-hoc NETwork), AODV(Ad-hoc On-demand Distance Vector), only considers the shortest path for routing, which may cause traffic concentration to a node at the critical path. Hence, the battery of the node will be dissipated rapidly to reduce the lifetime of the whole network. In this paper, power dissipation considered AODV is proposed for fair energy distribution in MANET, and verified using the computer simulation.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07a
• /
• pp.541-543
• /
• 2005

본 논문에서는 Ad Hoc 네트워크와 Ad Hoc 라우팅 프로토콜 중에 대표적인 On-demand 방식인 AODV(Ad Hoc On-demand Distance Vector) 라우팅 프로토콜에 대해 알아본다. 본 연구의 목표는 멀티미디어 데이터를 위한 QoS를 지원하는 새로운 라우팅 알고리즘을 제안하고, 네트워크 시뮬레이터에 구현하여 다양한 실험환경에서 제안한 라우팅 알고리즘에 대한 성능평가를 수행하는 것이다.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.195-201
• /
• 2006

This thesis proposes hybrid routing protocol that mix proactive routing protocol and reactive routing protocol used in Ad hoc network. Proposed method is that establish special node offering network service of nods which construct Ad hoc network and do routing different from existing hybrid routing protocol, ZRP. Special node doing these parts is called C-node. Routing using C-node can accompany efficient routing by decreasing path institution time and flooding time than existing routing protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.11A
• /
• pp.1059-1067
• /
• 2006

AODV(Ad-hoc On-demand Distance Vector) routing protocol was devised for use of mobile nodes in Ad-hoc network. When we use the AODV routing protocol in Ad-hoc networks with high mobility, disturbance of optimized route path and link break occur. In order to solve the shortcomings, this paper proposes a new routing protocol in which new routing control messages are added to the existing AODV. The proposed protocol minimizes link break and transmission delay while is able to secure the optimized route path constantly in changes of network topology The performance of the proposed routing protocol was evaluated by using us2 network simulator. The actual Ad-hoc network test bed provides us the most reliable experimental data for Ad-hoc networks. In order to support this experimental environment, the dissertation also developed an efficient embedded system on which AODV routing protocol, NAT, Netfilter can run and other event message can be verified without declining efficiency. The correct operation of AODV routing protocol has been verified in both the Ad-hoc network test bed in which the embedded system was used, and Ad-hoc networks linked with Ethernet backbone network.