• Title/Summary/Keyword: Routing protocols

Search Result 606, Processing Time 0.03 seconds

Area Aware-DSDV Routing Protocol on Ad hoc Networking (Ad Hoc 망에서 AA-DSDV 라우팅 프로토콜)

  • Cho, Se-Hyun;Park, Hea-Sook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.04a
    • /
    • pp.590-593
    • /
    • 2011
  • Time goes on, Ad Hoc network is hot issues. So far, there are a lot of protocols have been proposed for Ad Hoc routing protocol to support the mobility. This paper presents an enhanced DSDV(Destination-Sequenced Distance Vector) routing protocol which nominates one node to take care of a specific area. Simply Area-Aware(AA) DSDV routing protocol has one nominee to take care of some area. It has two jobs. One is to take care of its neighbour and another is to transfer the routing table to its other node as it works. It is called as Area Nominee(AN). The new scheme extends the routing table to include the nominee in the area. The general node is the same as the previous DSDV routing protocol. In the other hands, the node which is nominated has two routing protocols. One is for Regional Routing(RR) table which is the same routing table in DSDV. Another is Global Routing(GR) table which is about the area round its area which it cares nearby. GR table is the table for the designated node like the nominee. Each area has one nominee to transfer between ANs. It has only nominee's information about every area. This concept decreases the topology size and makes the information of topology more accurate.

Performance Variations of AODV, DSDV and DSR Protocols in MANET under CBR Traffic using NS-2.35

  • Chandra, Pankaj;Soni, Santosh
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.7
    • /
    • pp.13-20
    • /
    • 2022
  • Basically Mobile Ad Hoc Network (MANET) is an autonomous system with the collection of mobile nodes, these nodes are connected to each other by using wireless networks. A mobile ad hoc network poses this quality which makes topology in dynamic manner. As this type of network is Ad Hoc in nature hence it doesn't have fixed infrastructure. If a node wishes to transfer data from source node to a sink node in the network, the data must be passed through intermediate nodes to reach the destination node, hence in this process data packet loss occurs in various MANET protocols. This research study gives a comparison of various Mobile Ad Hoc Network routing protocols like proactive (DSDV) and reactive (AODV, DSR) by using random topology with more intermediate nodes using CBR traffic. Our simulation used 50, 100, and 150 nodes variations to examine the performance of the MANET routing protocols. We compared the performance of DSDV, AODV and DSR, MANET routing protocols with the result of existing protocol using NS-2 environment, on the basis of different performance parameters like Packet Delivery Ratio, average throughput and average end to end delay. Finally we found that our results are better in terms of throughput and packet delivery ratio along with low data loss.

Performance Evaluation for a Unicast Vehicular Delay Tolerant Routing Protocol Networks

  • Abdalla, Ahmed Mohamed
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.2
    • /
    • pp.167-174
    • /
    • 2022
  • Vehicular Ad hoc Networks are considered as special kind of Mobile Ad Hoc Networks. VANETs are a new emerging recently developed, advanced technology that allows a wide set of applications related to providing more safety on roads, more convenience for passengers, self-driven vehicles, and intelligent transportation systems (ITS). Delay Tolerant Networks (DTN) are networks that allow communication in the event of connection problems, such as delays, intermittent connections, high error rates, and so on. Moreover, these are used in areas that may not have end-to-end connectivity. The expansion from DTN to VANET resulted in Vehicle Delay Tolerant Networks (VDTN). In this approach, a vehicle stores and carries a message in its buffer, and when the opportunity arises, it forwards the message to another node. Carry-store-forward mechanisms, packets in VDTNs can be delivered to the destination without clear connection between the transmitter and the receiver. The primary goals of routing protocols in VDTNs is to maximize the probability of delivery ratio to the destination node, while minimizing the total end-to-end delay. DTNs are used in a variety of operating environments, including those that are subject to failures and interruptions, and those with high delay, such as vehicle ad hoc networks (VANETs). This paper discusses DTN routing protocols belonging to unicast delay tolerant position based. The comparison was implemented using the NS2 simulator. Simulation of the three DTN routing protocols GeOpps, GeoSpray, and MaxProp is recorded, and the results are presented.

Research on Energy Efficiency of Routing Protocols in Mobile Sensor Field (이동 센서 환경에서 라우팅 프로토콜에 따른 에너지 효율에 관한 연구)

  • Park, Se-Young;Yun, Dai Yeol
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.502-504
    • /
    • 2021
  • The Mobile Ad-hoc Network (MANET) is a representative mobile sensor network. MANET is used in various areas because it consists of sensors composed of moving nodes that do not depend on existing infrastructure networks. In the mobile sensor field, the mobility characteristic plays an important role in the performance of the network. Researches on routing techniques are being actively developed in terms of energy efficiency of the entire network. Clustering-based routing protocols show excellent performance in terms of energy efficiency. In this paper, the energy performance according to routing protocols is compared in the MANET to which the same mobility model is adopted.

  • PDF

DT-GPSR: Delay Tolerant-Greedy Perimeter Stateless Routing Protocol (DT-GPSR: 지연감내형 GPSR 라우팅 프로토콜)

  • Nam, Jae-Choong;Cho, You-Ze
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.2
    • /
    • pp.189-197
    • /
    • 2016
  • Mobile ad-hoc networks (MANETs) experience frequent link disconnections due to non-uniform node distribution and mobility. Thus, end-to-end path establishment-based routing protocols cause frequent transmission failures in MANETs, resulting in heavy control messages for path reestablishment. While location-based MANET routing protocols, such as Greedy Perimeter Stateless Routing (GPSR), use location information to forward messages in a hop-by-hop routing fashion without an end-to-end path establishment procedure, such protocols encounter communication void problems when message forwarding to the next hop fails due to the absence of a relay node. Therefore, to solve this problem, this paper proposes a Delay Tolerant-GPSR (DT-GPSR) protocol, which combines Delay Tolerant Networking (DTN) technology with the GPSR protocol. The performance of DT-GPSR is compared with the performances of the original GPSR and PRoPHET routing protocols through simulation using NS-2. The simulation results confirm that DT-GPSR outperforms GPSR and PRoPHET in terms of the message delivery ratio and message delivery delay.

Improved Intelligent Routing Protocol in Vehicle Ad-hoc Networks (차량 Ad-hoc 혹 통신에서 개선된 지능형 경로 프로토콜)

  • Lee, Dong Chun
    • Convergence Security Journal
    • /
    • v.21 no.1
    • /
    • pp.129-135
    • /
    • 2021
  • Greedy protocols show good performance in Vehicular Ad-hoc Networks (VANETs) environment in general. But they make longer routes causing by surroundings or turn out routing failures in some cases when there are many traffic signals which generate empty streets temporary, or there is no merge roads after a road divide into two roads. When a node selects the next node simply using the distance to the destination node, the longer route is made by traditional greedy protocols in some cases and sometimes the route ends up routing failure. Most of traditional greedy protocols just take into account the distance to the destination to select a next node. Each node needs to consider not only the distance to the destination node but also the direction to the destination while routing a packet because of geographical environment. The proposed routing scheme considers both of the distance and the direction for forwarding packets to make a stable route. And the protocol can configure as the surrounding environment. We evaluate the performance of the protocol using two mobility models and network simulations. Most of network performances are improved rather than in compared with traditional greedy protocols.

Minimum LQI based On-demand Routing Protocol for Sensor Networks (Minimum LQI 기반의 On-demand 센서 네트워크 라우팅 프로토콜)

  • Lee, Wan-Jik;Lee, Won-You;Heo, Seok-Yeol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.11
    • /
    • pp.3218-3226
    • /
    • 2009
  • A number of on-demand routing protocols for sensor networks have been proposed yet. However, the majority of proposed on-demand routing protocols for sensor networks are not suitable for a relatively poor wireless environment and sensor applications requiring reliable data transmission due to using a hop-count metric for their protocols. In this paper, we proposed a minimum LQI(Link Quality Indicator) based on-demand sensor network routing protocol that is suitable for a relatively poor wireless environment and implemented the proposed routing protocol on a TinyOS. We also compared the implemented protocol with typical hop count based routing protocol by carrying out performance experiments on a multi-hop testbed. The results from these experiments showed that the successful transmission rate of the proposed routing protocol is higher than that of typical hop count based routing protocol over a poor wireless link.

Large Scale Failure Adaptive Routing Protocol for Wireless Sensor Networks (무선 센서 네트워크를 위한 대규모 장애 적응적 라우팅 프로토콜)

  • Lee, Joa-Hyoung;Seon, Ju-Ho;Jung, In-Bum
    • The KIPS Transactions:PartA
    • /
    • v.16A no.1
    • /
    • pp.17-26
    • /
    • 2009
  • Large-scale wireless sensor network are expected to play an increasingly important role for the data collection in harmful area. However, the physical fragility of sensor node makes reliable routing in harmful area a challenging problem. Since several sensor nodes in harmful area could be damaged all at once, the network should have the availability to recover routing from node failures in large area. Many routing protocols take accounts of failure recovery of single node but it is very hard these protocols to recover routing from large scale failures. In this paper, we propose a routing protocol, which we refer to as LSFA, to recover network fast from failures in large area. LSFA detects the failure by counting the packet loss from parent node and in case of failure detection LSFAdecreases the routing interval to notify the failure to the neighbor nodes. Our experimental results indicate clearly that LSFA could recover large area failures fast with less packets than previous protocols.

Security-Aware Optimized Link Routing Protocol for Mobile Ad-Hoc Networks

  • Dhir, Amandeep;Sengupta, Jyotsna
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.3 no.1
    • /
    • pp.52-83
    • /
    • 2009
  • In this technical report, we have examined the basic building blocks of mobile ad-hoc networks. The paper discusses various security requirements of ad-hoc networks, attacks in ad-hoc networks, Security Implementation and Routing Protocols. The primary purpose of the paper is to address the Optimized Link State Routing (OLSR) protocol in detail, along with the various possible attacks. Finally, algorithms for securing OLSR are proposed, via the addition of digital signatures, as well as more advanced techniques such as cross checking of advertised routing control data with the node's geographical position. The main aim of this research work is the addition of security features to the existing OLSR protocol. In order to effectively design a secure routing protocol, we present a detailed literature survey of existing protocols, along with the various attacks. Based on the information gathered from the literature survey, a secure routing protocol for OLSR is proposed. The proposed secure routing protocol involves the addition of a digital signature as well as more advanced techniques such as the reuse of previous topology information to validate the actual link state. Thus, the main objective of this work is to provide secure routing and secure data transmission.

FANET:-Communication Architecture and Routing Protocols A Review

  • Moazzam Ali;Adil Idress;Jawwad Ibrahim
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.5
    • /
    • pp.181-190
    • /
    • 2024
  • FANET (Flying ad-hoc network) is a self-adjusting wireless network that enables easy to deploy flying nodes, inexpensive, flexible such as UAV in the absence of fixed network infrastructure they communicate amoung themselves. Past few decades FANET is only the emerging networks with it's huge range of next-generation applications.FANET is a sub-set of MANET's(Mobile Ad-hoc Network) and UAV networks are known as FANET.Routing enables the flying nodes to establish routes to radio access infrastructure specifically FANET and among themselves coordinate and collaborate.This paper presents a review on existing proposed communication architecture and routing protocols for FANETS.In addition open issues and challenges are summarized in tabular form with proposed solution.Our goal is to provide a general idea to the researchers about different topics to be addressed in future.