• Title/Summary/Keyword: Distance Vector Routing Protocols

Search Result 49, Processing Time 0.027 seconds

A Hybrid Routing Protocol Based on Bio-Inspired Methods in a Mobile Ad Hoc Network

  • Alattas, Khalid A
    • International Journal of Computer Science & Network Security
    • /
    • v.21 no.1
    • /
    • pp.207-213
    • /
    • 2021
  • Networks in Mobile ad hoc contain distribution and do not have a predefined structure which practically means that network modes can play the role of being clients or servers. The routing protocols used in mobile Ad-hoc networks (MANETs) are characterized by limited bandwidth, mobility, limited power supply, and routing protocols. Hybrid routing protocols solve the delay problem of reactive routing protocols and the routing overhead of proactive routing protocols. The Ant Colony Optimization (ACO) algorithm is used to solve other real-life problems such as the travelling salesman problem, capacity planning, and the vehicle routing challenge. Bio-inspired methods have probed lethal in helping to solve the problem domains in these networks. Hybrid routing protocols combine the distance vector routing protocol (DVRP) and the link-state routing protocol (LSRP) to solve the routing problem.

A Performance Comparison of Routing Protocols for Mobile Ad hoc Networks using the NS-3 (NS-3를 사용한 이동 애드혹 네트워크용 라우팅 프로토콜 성능 비교)

  • Jang, Jaeshin;Ngo, Van-Vuong;Wie, Sunghong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.2
    • /
    • pp.308-316
    • /
    • 2015
  • In this paper, we carried out performance comparison of four routing protocols that had been proposed for mobile ad hoc networks using the NS-3 network simulator. Those four routing protocols consist of two proactive routing protocols, DSDV(destination-sequenced distance vector) and OLSR(optimized link state routing), and two reactive routing protocols, AODV(ad-hoc on-demand distance vector) and DSR(dynamic source routing). Two performance metrics, system throughput and packet delivery ratio, are adopted and performance evaluation was carried out in a square communication area where each communicating mobile node moves independently. Numerical results show that the AODV routing protocol provides the best performance among those four routing protocols.

Performance Evaluation of Position-based and Non-position-based Routing Protocols in a Vehicular Ad-Hoc Network (VANET에 있어서 위치기반과 비위치기반 라우팅프로토콜의 성능 평가)

  • Jo, Jun-Mo;Choi, Dae-Woo
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.7 no.2
    • /
    • pp.213-218
    • /
    • 2006
  • In this paper, we evaluate and compare performance between position-based and non-position-based routing protocols in a vehicular ad-hoc network. The protocols evaluated in this paper for many performance evaluation aspects are a position-based routing protocol, GPSR (Greedy Perimeter Stateless Routing), and the non-position-based such as AODV (Ad-hoc On-Demand Distance Vector) and DSR (Dynamic Source Routing) protocols. The three protocol characteristics such as Packet Delivery Ratio, Latency of first packet per connection, and Average number of hops depending on distance are compared and evaluated. As the result of simulation, the AODV performed better than the DSR. However, due to the high mobility characteristic of a vehicular ad-hoc network, GPSR, the position-based routing performs better than the non-position-based routing protocols such as AODV and DSR in a vehicular ad-hoc network environment.

  • PDF

A Cost-Aware Multi-path DSDV Routing Protocol in Wireless Mesh Networks (무선 메쉬 네트워크에서 비용 인지 다중 경로 DSDV 라우팅 프로토콜)

  • Lee, Seong-Woong;Chung, Yun-Won
    • The KIPS Transactions:PartC
    • /
    • v.15C no.4
    • /
    • pp.289-296
    • /
    • 2008
  • In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.

AOZDV(Ad Hoc On-demand Zone and Distance-Vector) : A Routing Protocol with Novel Zone Mechanism in Wireless Ad hoc Networks (무선 Ad hoc 망의 새로운 Zone 기법을 적용한 AOZDV(Ad Hoc On-demand Zone and Distance-Vector) 라우팅 프로토콜)

  • Kim Yong-Woo;Choi Sung-Jae;Lee Hong-Ki;Song Joo-Seok
    • 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.

A Study on Performance Evaluation of Efficient Vehicular Ad-Hoc Network in Road Traffic (도로 사정에 따른 효율적인 자동차 애드 혹망의 성능평가에 관한 연구)

  • Cho, Ok-Lae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.8 no.3
    • /
    • pp.593-600
    • /
    • 2007
  • In this paper, we composed several road network and evaluated the network for the performance of the network with protocols. The protocols we applied were the MANET routing protocols such as AODV(Ad-hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) protocols. Generally, the AODV performs better than the DSR. However, in my ad-hoc vehicular network, the performance of the DSR is the better than the AODV when there are more vehicles in the road environment than there are the less vehicles. For the simulation, we composed 4-lane road with vehicles and simulated in the OPNET.

  • PDF

Comparison of Topology Based-Routing Protocols in Wireless Network

  • Sharma, Vikas;Ganpati, Anita
    • Journal of Multimedia Information System
    • /
    • v.6 no.2
    • /
    • pp.61-66
    • /
    • 2019
  • VANET (Vehicular Ad-hoc Network) is a mobile Ad-hoc Network which deals with the moving vehicles. VANET supports Intelligent Transport Systems (ITS) which is related to different modes of transport and traffic management techniques. VANETs enabled users to be informed and make them safer. VANET uses IEEE 802.11p standard wireless access protocol for communication. An important and necessary issue of VANET is to design routing protocols. In a network, communication takes place by the use of the routing protocols. There are mainly two types of communications used such as Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) in VANET. Vehicles can send and receive messages among them and also to and from infrastructure used. In this paper, AODV, DSR and DSDV are compared by analysing the results of simulation on various metrics such as average throughput, instant throughput, packet delivery ratio and residual energy. Findings indicates utilization of AODV and DSR is more applicable for these metrics as compared to DSDV. A network simulator (NS2) is used for simulation.

Routing Protocols for VANETs: An Approach based on Genetic Algorithms

  • Wille, Emilio C. G.;Del Monego, Hermes I.;Coutinho, Bruno V.;Basilio, Giovanna G.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.542-558
    • /
    • 2016
  • Vehicular Ad Hoc Networks (VANETs) are self-configuring networks where the nodes are vehicles equipped with wireless communication technologies. In such networks, limitation of signal coverage and fast topology changes impose difficulties to the proper functioning of the routing protocols. Traditional Mobile Ad Hoc Networks (MANET) routing protocols lose their performance, when communicating between vehicles, compromising information exchange. Obviously, most applications critically rely on routing protocols. Thus, in this work, we propose a methodology for investigating the performance of well-established protocols for MANETs in the VANET arena and, at the same time, we introduce a routing protocol, called Genetic Network Protocol (G-NET). It is based in part on Dynamic Source Routing Protocol (DSR) and on the use of Genetic Algorithms (GAs) for maintenance and route optimization. As G-NET update routes periodically, this work investigates its performance compared to DSR and Ad Hoc on demand Distance Vector (AODV). For more realistic simulation of vehicle movement in urban environments, an analysis was performed by using the VanetMobiSim mobility generator and the Network Simulator (NS-3). Experiments were conducted with different number of vehicles and the results show that, despite the increased routing overhead with respect to DSR, G-NET is better than AODV and provides comparable data delivery rate to the other protocols in the analyzed scenarios.

Mobility-Aware Ad Hoc Routing Protocols for Networking Mobile Robot Teams

  • Das, Saumitra M.;Hu, Y. Charlie;Lee, C.S. George;Lu, Yung-Hsiang
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.296-311
    • /
    • 2007
  • Mobile multi-robot teams are useful in many critical applications such as search and rescue. Explicit communication among robots in such mobile multi-robot teams is useful for the coordination of such teams as well as exchanging data. Since many applications for mobile robots involve scenarios in which communication infrastructure may be damaged or unavailable, mobile robot teams frequently need to communicate with each other via ad hoc networking. In such scenarios, low-overhead and energy-efficient routing protocols for delivering messages among robots are a key requirement. Two important primitives for communication are essential for enabling a wide variety of mobile robot applications. First, unicast communication (between two robots) needs to be provided to enable coordination and data exchange. Second, in many applications, group communication is required for flexible control, organization, and management of the mobile robots. Multicast provides a bandwidth-efficient communication method between a source and a group of robots. In this paper, we first propose and evaluate two unicast routing protocols tailored for use in ad hoc networks formed by mobile multi-robot teams: Mobile robot distance vector (MRDV) and mobile robot source routing (MRSR). Both protocols exploit the unique mobility characteristics of mobile robot networks to perform efficient routing. Our simulation study show that both MRDV and MRSR incur lower overhead while operating in mobile robot networks when compared to traditional mobile ad hoc network routing protocols such as DSR and AODV. We then propose and evaluate an efficient multicast protocol mobile robot mesh multicast (MRMM) for deployment in mobile robot networks. MRMM exploits the fact that mobile robots know what velocity they are instructed to move at and for what distance in building a long lifetime sparse mesh for group communication that is more efficient. Our results show that MRMM provides an efficient group communication mechanism that can potentially be used in many mobile robot application scenarios.

Performance Evaluation of Directional AODV Routing Protocol for Wireless Mesh Networks (무선 메쉬 네트워크를 위한 방향섬 AODV 라우팅 프로토콜의 성능 평가)

  • Choi, Jae-In;Kim, Dae-Hwan;Le, Anh Ngoc;Lee, In-Soo;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9B
    • /
    • pp.795-801
    • /
    • 2008
  • Wireless Mesh Networks (WMNs) are popular due to their low cost and rapid deployment. Currently, many WMN researchers often considers the use of ad-hoc routing protocols because WMNs are similar to the ad-hoc networks. Some of currently deployed WMNs consider to use on-demand routing protocols such as Ad-hoc On-demand Distance Vector (AODV) and Dynamic Source Routing (DSR). But, AODV are not appropriate for Wireless Mesh Networks (WMNs), because flooding-based route discovery is both redundant and expensive in terms of control message overhead. In this paper, we propose a directional AODV (D-AODV) routing protocol based on hop count to a gateway. We implement the D-AODV routing protocol and evaluate the performance of the D-AODV on the testbed. The measurement results show that the D-AODV can enhance the network throughput by reducing the routing overhead.