• Title/Summary/Keyword: AODV

Search Result 310, Processing Time 0.024 seconds

AODV Routing Algorithm Considering Successful Transmission Rate for QoS Support (전송성공률을 고려한 QoS보장 AODV 알고리즘)

  • Cho, Byeong Seok;Lee, Juhyeon;Park, Hyung-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.10a
    • /
    • pp.741-742
    • /
    • 2013
  • AODV algorithm is one of the widely used algorithm for wireless ad-hoc environment In AODV, the destination node selects the route with smallest hop count. Since AODV only consider hop count, the selected route could have low capacity link, and degrade QoS. In this paper, we propose a modified AODV algorithm that consider successful transmission rate of each link. Advantage of proposed algorithm is that AODV can support QoS without significant change of the algorithm using modified hop count.

  • PDF

An Efficient Route Maintenance Scheme Utilizing Hello Messages for AODV-based Ad Hoc Networks (AODV 기반 애드 혹 네트워크에서 헬로우 메시지를 이용한 효과적인 경로 유지 기법)

  • 서재홍;김기형;서현곤
    • Journal of KIISE:Information Networking
    • /
    • v.31 no.3
    • /
    • pp.280-288
    • /
    • 2004
  • In Ad Hoc Networks, a connection breaks due to the irregular movement of mobile nodes and the inherent characteristics of the wireless medium such as the interference and the multi-path fading. AODV, a typical on-demand routing protocol in Ad Hoc networks, uses the local repair mechanism to cope with the connection breaks. This paper proposes an efficient route maintenance scheme for AODV, named as AODV-ERM, by utilizing hello messages. The proposed AODV-ERM scheme can recover some link breaks efficiently without relying on the expensive local repair process, thereby reducing the repair time. To show the effectiveness of the proposed scheme, we performed extensive simulation with NS2. The simulation results show that the proposed scheme can reduce the repair time effectively and thus, increase the overall packet delivery ratio.

Performance Enhancement of AODV Routing Protocol Using Interrupt Message in MANET (MANET에서 Interrupt message를 이용한 AODV 라우팅 프로토콜의 성능 개선)

  • Lee, Yun-Kyung;Kim, Ju-Gyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.10
    • /
    • pp.785-800
    • /
    • 2013
  • In MANET, AODV(Ad hoc On-demand Distance Vector) has its advantages as on-demand approach but it also has a disadvantage that the control packet overhead is high compared to other routing protocols. This paper improves the problem caused by Hello messages that are broadcasted periodically to detect the local connectivity and maintain neighbor list. Periodic hello messages reduce the Packet delivery ratio and the efficiency in the limited bandwidth. And its increased Control packet overhead leads to decrease the Residual battery capacity and the Network lifetime. Further, non-reactive nature of periodic hello messages in AODV has also been the source of numerous controversies. In order to solve these problems, this paper improves the performance by using the interrupt driven approach which removes periodic hello messages and decreases the Control packet overhead. Performance comparisons between the traditional AODV and proposed mod_AODV done with network simulator QualNet 5.0 show that the mod_AODV performs better in most performance metrics under scenarios with various values of simulation parameters.

A Study on Advanced AODV Routing protocol in Mobile Ad Hoc Network (이동 애드혹 네트워크에서 개선된 AODV 라우팅 프로토콜에 관한 연구)

  • 정찬혁;오세덕;배진승;이광배;김현옥;곽승욱;하재승;문태수
    • Proceedings of the Safety Management and Science Conference
    • /
    • 2002.11a
    • /
    • pp.261-267
    • /
    • 2002
  • 화재나 긴급상황이 발생하였을 때 임시적으로 네트워크를 구성할 수 있는 애드혹 네트워크분야에서 DSR, AODV, TORA, ZRP 라우팅 프로토콜의 연구가 활발하며 이에 대한 여러가지 개발이 이루어지고 있다. 본 논문에서는 AODV 라우틸 프로토콜을 이 용하여 다양한 네트워크 환경에서 AODV 라우팅 프로토콜의 성능평가와 함께 AODV 라우팅 프로로콜의 문제점을 수정하여 개선하여 실질적인 MANET 통신에서 사용될수 있는 라우팅 프로토콜을 제안한다.

  • PDF

Method of Detecting and Isolating an Attacker Node that Falsified AODV Routing Information in Ad-hoc Sensor Network (애드혹 센서 네트워크에서 AODV 라우팅 정보변조 공격노드 탐지 및 추출기법)

  • Lee, Jae-Hyun;Kim, Jin-Hee;Kwon, Kyung-Hee
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.12
    • /
    • pp.2293-2300
    • /
    • 2008
  • In ad-hoc sensor network, AODV routing information is disclosed to other nodes because AODV protocol doesn't have any security mechanisms. The problem of AODV is that an attacker can falsify the routing information in RREQ packet. If an attacker broadcasts the falsified packet, other nodes will update routing table based on the falsified one so that the path passing through the attacker itself can be considered as a shortest path. In this paper, we design the routing-information-spoofing attack such as falsifying source sequence number and hop count fields in RREQ packet. And we suggest an efficient scheme for detecting the attackers and isolating those nodes from the network without extra security modules. The proposed scheme doesn't employ cryptographic algorithm and authentication to reduce network overhead. We used NS-2 simulation to evaluate the network performance. And we analyzed the simulation results on three cases such as an existing normal AODV, AODV under the attack and proposed AODV. Simulation results using NS2 show that the AODV using proposed scheme can protect the routing-information-spoofing attack and the total n umber of received packets for destination node is almost same as the existing norm at AODV.

An AODV-Based Two Hops Dynamic Route Maintenance in MANET (MANET에서의 AODV 기반 2홉 동적 경로유지 기법 연구)

  • Moon, Dae-Keun;Kim, Hag-Bae
    • The KIPS Transactions:PartC
    • /
    • v.14C no.2
    • /
    • pp.191-198
    • /
    • 2007
  • A mobile ad-hoc network (MANET) is an autonomous, infrastructure-less system that consists of mobile nodes. In MANET, on demand routing protocols are usually used because network topology changes frequently. AODV, which is a representative on demand routing protocol, operates using the routing table of each node that includes next hop of a route for forwarding packets. It maintains the established route if there is not an expiration of route or any link break. In the paper, we propose a partially adaptive route maintenance scheme (AODV-PA) based on AODV, which provides dynamic route modification of initial route for selecting the effective route using not only next hop but also next-hop of next-hop (i.e. 2-hop next node) acquired through route discovery process. In addition, the proposed scheme additionally manages the routing table for preventing exceptional link breaks by route modification using HELLO messages. We use NS 2 for the computer simulation and validate that the proposed scheme is better than general AODV in terms of packet delivery ratio, latency, routing overhead.

Advanced AODV Routing Performance Evaluation in Vehicular Ad Hoc Networks (VANET에서 Advanced AODV 라우팅 성능평가)

  • Lee, Jung-Jae;Lee, Jung-Jai
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.6
    • /
    • pp.1011-1016
    • /
    • 2020
  • Rapid change in network topology in high-speed VANET(: Vehicular Ad Hoc Network) is an important task for routing protocol design. Selecting the next hop relay node that affects the performance of the routing protocol is a difficult process. The disadvantages of AODV(: Ad Hoc On-Demand Distance Vector) related to VANET are end-to-end delay and packet loss. This paper proposes the AAODV (Advanced AODV) technique to reduce the number of RREQ (: Route Request) and RREP (: Route Reply) messages by modifying the AODV routing protocol and adding direction parameters and 2-step filtering. It can be seen that the proposed AAODV reduces packet loss and minimizes the effect of direction parameters, thereby increasing packet delivery rate and reducing end-to-end delay.

Implementation of Image Transmission System in Ad-Hoc Network Using AODV Routing Protocol (Ad hoc 네트워크에서 AODV 라우팅 프로토콜을 이용한 영상 전송 시스템 구현)

  • Lee, Sung-Hun;Lee, Hyung-Keun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.7 no.6
    • /
    • pp.92-100
    • /
    • 2008
  • Ad-hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any centralized administration or reliable support services such as wired network and base stations. Recently, Ad-hoc networks are evolving to support multimedia contents according to expansion of ad hoc multi-hop communication system. Wireless ad-hoc network is different from the conventional wired network by frequent changes in network topology, number of routers and resources, there are a number of problems in applying conventional routing protocol to ad-hoc network. The AODV routing protocol is proposed for mobile node in ad-hoc networks. AODV protocol that provides to guarantee QoS for data transmission in ad hoc networks that link break frequently occurs. In this paper, AODV routing protocol based NDIS(Network Driver Interface Specification) is implemented. We design high performance image transmission that can operate with software(AODV) for ad-hoc networks without degradation. and verify operation of AODV routing protocol on the test bed.

  • PDF

An Adaptive AODV Algorithm for Considering Node Mobility (노드 이동성을 고려한 적응형 AODV 알고리즘)

  • Hong, Youn-Sik;Hong, Jun-Sik;Lim, Hwa-Seok
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.6
    • /
    • pp.529-537
    • /
    • 2008
  • AODV routing protocol is intended for use by mobile' nodes in an ad-hoc network. In AODV nodes create routes on an on-demand basis. As the degree of node mobility becomes high, however, the number of the control packets, RREQ and RREP messages, have increased so rapidly. The unexpected increases in the number of the control packets cause the destination node to decrease the packet receiving rate and also to increase the overall energy consumption of such a network. In this paper, we propose a novel method of adaptively controlling the occurrences of such RREQ messages based on AIAD (additive increase additive decrease) under a consideration of the current network status. We have tested our proposed method with the conventional AODV and the method using timestamp based on the three performance metrics, i.e.. how long does node moves, node velocity, and node density, to compare their performance.

Bypass Generation Mechanism using Mobility Prediction for Improving Delay of AODV in MANET (AODV의 전송 지연 향상을 위한 이동성 예측을 이용한 우회 경로 생성 기법)

  • Youn, Byungseong;Kim, Kwangsoo;Kim, Hakwon;Roh, Byeong-Hee
    • KIISE Transactions on Computing Practices
    • /
    • v.20 no.12
    • /
    • pp.694-699
    • /
    • 2014
  • In mobile ad-hoc networks (MANET), the network topology and neighboring nodes change frequently, since MANET is composed of nodes that have mobility without a fixed network infrastructure. The AODV routing protocol is advantageous for MANET, but AODV has a delay in the transmission of data packets because AODV can not transmit data during route recovery. This paper proposes solving the above problem of AODV by using a bypass generation mechanism for data transmission during route recovery. For further improvement, additional mechanisms that coordinate the reception threshold of a hello packet are proposed in order to improve the accuracy of the information obtained from the neighboring nodes when the bypass is generated due to a link failure and the immediacy of the route recovery. Simulation results show that the proposed technique improves the performance in terms of the delay in transmission compared to traditional AODV.