Mobile Ad-hoc Routing Protocols Research Articles

An Emergency Message Routing Protocol for Improved Congestion Management in Hybrid RF/VLC VANETs

Unexpected traffic incidents cause safety concerns and intense traffic congestion on crowded urban road networks. Vehicular ad-hoc network (VANET)-aided Intelligent Transport Systems (ITS) aim to mitigate these risks through timely dissemination of alert messages. However, conventional Radio frequency (RF) mobile ad-hoc routing protocols are ill-suited for dynamic VANET environments due to high mutual interference, packet collisions, high end-to-end delay from frequent route discoveries, and periodic beaconing requirements. Fortunately, the quickly emerging Visible Light Communications (VLC) provide complementary short-range connectivity with high bandwidth and low interference. This paper proposes an efficient adaptive routing protocol for emergency messages in dense VANET scenarios leveraging a hybrid RF/VLC system. When an incident or congestion happens, the source vehicle disseminates the information to the incoming vehicles as quickly as possible using a combination of VLC and RF communication networks. Multi-hop relays extend the connectivity if the direct links are blocked. The coverage area is partitioned into zones based on road segments, intersections, and traffic flows. The Road Side Units (RSU)s are intelligently assigned to zones and they analyze the historical traffic data to characterize each zone and decide a response strategy. We also propose a congestion detection scheme that utilizes traffic simulations to forecast the clearance times under different response strategies. The highest-scoring strategy is selected based on the predicted impacts on travel time, emissions, and driver stress levels. The proposed algorithm adaptively uses the selected strategy to proactively alleviate the predicted congestion through optimized routing and control. Overall, the protocol maximizes safety and efficiency during emergencies by leveraging the hybrid RF/VLC, incorporating real-time congestion forecasting and dynamic rerouting into the response strategies.

Security Mandated Analytics based Route Processing with Digital Signature [SMARPDS] - Pseudonymous Mobile Ad Hoc Routing Protocol

There are a lot of speculations going on about the interests for privacy in mobile network. Many research works have been proposed in the aspect and these works concentrate more on the anonymity part and there are quite a few implementations of these research works on some applications. Ad hoc routing protocols must have provision for both anonymity providing nature and restriction of information collection from unauthorized nodes. Till recent times, there are a number of ad hoc routing protocols that have been introduced. But, they have lack security features or authentication features or in some cases both. The lack of proper security features leads to a state of vulnerability which at any given point, will act as a threat element. In this paper, we propose Security Mandated Analytics based Route Processing with Digital Signature protocol [SMARPDS]. It is an anonymous and authentication providing routing protocol in Mobile Ad hoc network. In addition, routes are discovered based on analytics done on the node and its present location in the network. SMARPDS provides authentication during the route discovery and transmission process by employing digital signatures on node front and also on packets front.

Study Based on Mobile Ad Hoc Routing Protocols in Control System

Study Based on Mobile Ad Hoc Routing Protocols in Control System

A Review: Mobile Ad Hoc Networks Challenges, Attacks, Security, Vulnerability and Routing Protocols

One of the most attractive areas of research is Mobile Ad hoc Networks (MANET), which has a number of movable nodes with no infrastructure. Independent nodes are able to move freely inside or leave the network so mobile ad hoc networks are flexible and dynamic topology, MANETs are simply configurable by themselves, easy to deploy, no need for existing infrastructure, and these abilities make them one of the modern eras for industries. Most dangerous and powerful attacks in MANETs are wormhole attack and detection it is very difficult. This paper seeks to study and analyze challenges, security issues of MANETs and one of the severe attacks “wormhole attack,” and its detection and prevention methods, routing protocols used to identify and prevent this attack. These methods are able to identify and avoid the wormhole attacks; but they are not very efficient and have some weaknesses. There is no common algorithm that fits well against the wormhole attack.

Improving Performance of Routing Protocols Using MRP Framework

These days MANET (Mobile Ad-hoc Network) is an amazing remarkably altering or rising technology, for the reason that of its elite nature of scattered mobile devices and self-motivated network topology. The mobile ad-hoc routing protocol follows several principles in wireless MANET’s. The up to date and novel applications based on wireless technology are being produced in the private as well as commercial sectors. A lot of challenges which are facing wireless MANETs like network stability, security, energy efficiency and performance analysis etc. At present wireless ad-hoc network get much more attention because of its accessibility everywhere. As a result researchers produce several routing protocols. In this paper first of all we analyzed the performance investigation of wireless routing protocols on the basis of ROH (Routing Overhead), throughput, end-2-end delay and PDR (Packet Delivery Ratio). After that we proposed an MRP (Mixed Routing Protocol) framework which improve performance.

GEOGRAPHICAL ROUTING PROTOCOLS FOR MOBILE AD HOC NETWORKS - A SURVEY ON THEIR PERFORMANCE ANALYSIS

Mobile Ad Hoc network is an autonomous system of mo bile nodes connected by wireless links forming a te mporary network without the aid of any centralized administration o r infrastructure. Each node operates not only as an end system but also as a router to forward packets. The nodes are free to mo ve themselves into a network. These networks have n o fixed topology due to the high degree of node mobility. To accommodate th e changing topology, special routing protocols are needed. The goal of the routing protocol is to have an efficient route esta blishment between a pair of nodes, so that messages can be delivered in a timely manner. Mobile Ad Hoc routing protocols are divided into Flat routing, Hierarchical routing, Geographi cal routing, Power aware routing and Multicast routing. It is difficul t to determine which protocols may perform well und er a number of different network scenarios. This paper provides an overview of geographical routing protocols proposed in the l iterature and performance comparison of geographical routing prot ocols.

Mobile Networking and Mobile Ad Hoc Routing Protocol Modeling

In this Research paper we describe mobile ad hoc networking and routing protocols modeling. Moreover we discuss system model and ad hoc wireless networks about the routing protocols. We decisions of report Solutions for Routing Protocols in Ad Hoc Networks. This paper we discuss verification of the Ad Hoc Routing. We discuss for another process of copying with the state explosion in Ad Hoc Networks and checking of the mobile ad hoc network. Finally we survey the current checking of the modeling solutions for the mobile ad hoc network. Keyword: Networking, Modeling, Protocol, node, Verification, Routing, UPAAL, BDD, SPIN.

A new RREQ message forwarding technique based on Bayesian probability theory

The flooding method, which is used by many mobile ad-hoc routing protocols, is a process in which a route request packet (RREQ) is broadcasted from a source node to other nodes in the network. This often results in unnecessary re-transmissions, causing packet collisions and congestion in the network, a phenomenon called broadcast storm. This article presents firstly the impact of a different message forwarding probability on the RREQ and secondly a RREQ message forwarding scheme which is implemented on Ad-hoc On-Demand Distance Vector Routing (AODV) routing protocol, a Bayesian probability based the AODV extended version based on a modified version of Bayesian probability (AODV_EXT_BP) that reduces routing overheads, by calculating the probability with respect to the neighbour density as well as the posterior probability. The performance of the AODV_EXT_BP is compared to that of extended version of AODV (AODV_EXT), AODV, Destination Sequenced Distance Vector, dynamic source routing and Optimized Link State Routing protocols and the simulation results show that the AODV_EXT_BP protocol achieves better results in all sectors.

GFDA: Route Discovery Algorithms for On-demand Mobile Ad Hoc Routing Protocols

Route discovery in manymobile ad hoc protocols is based on flooding. However, flooding suffers from high overhead, which can increase contention and communication delays. In this paper,we propose twonewroute discovery algorithms that are aimed towards reducing these delays. Both algorithms are suitable for use with ad hoc protocols where nodes periodically broadcast Hello Messages. Using the GloMoSim simulator, the proposed algorithms were evaluated and compared to existing methods. The simulation results show that the proposed approach can reduce routing overhead, number of broken links, average delay, and the number of dropped packets. Small improvements in message delivery ratios are also observed.

Mobile Ad Hoc Routing Protocols A Comparative Performance Analysis by Diversifying the Nodes

Mobile Ad hoc network is self-organizing and adaptive in nature. An Ad hoc wireless network does not rely on any fixed network entities the network itself is essentially infrastructure less. However, due to the presence of mobility, routing information changes to reflect subsistence in link connectivity. This paper highlights the performance of routing protocols like AODV, DSDV, DSR and TORA based on various evaluating parameter metrics like routing overload, throughput, average end-to-end delay, Packet Delivery Fraction (PDF) etc., by increasing the number of nodes when nodes are in mobile and tend to route the packets from source to destination. The simulation analysis proves that these metrics vary with different values in different test scenarios by diversifying the nodes.

A survey of secure mobile Ad Hoc routing protocols

Nowadays most portable electronic devices have some sort of network capability. However, due to different power, cost and processing limitations, the choice of networking technology changes for each device. Currently, networks are converging to all-IP solutions, due to their wide applicability and low cost. However, the IP architecture is built on several design decisions that complicate the support of ubiquitous networking. In order to allow the equipment to intercommunicate even though their protocols may be different, a new set of protocols and services have been developed. This article describes the challenges and existing solutions in the area of convergent networking protocols and architectures. First, we will explore why the TCP/IP architecture is not tailored to mobile networks, briefly describing its limitations and possible solutions. Next, we will present a taxonomy to classify the architectures for convergent networking. Finally, we show a brief survey of the existing convergent architectures as well as the research challenges on the subject.

A survey of secure mobile Ad Hoc routing protocols

Several routing protocols have been proposed in recent years for possible deployment of mobile ad hoc networks (MANETs) in military, government and commercial applications. In this paper, we review these protocols with a particular focus on security aspects. The protocols differ in terms of routing methodologies and the information used to make routing decisions. Four representative routing protocols are chosen for analysis and evaluation including: Ad Hoc on demand Distance Vector routing (AODV), Dynamic Source Routing (DSR), Optimized Link State Routing (OLSR) and Temporally Ordered Routing Algorithm (TORA). Secure ad hoc networks have to meet five security requirements: confidentiality, integrity, authentication, non-repudiation and availability. The analyses of the secure versions of the proposed protocols are discussed with respect to the above security requirements.

How to misuse AODV: a case study of insider attacks against mobile ad-hoc routing protocols

This paper presents a systematic analysis of insider attacks against mobile ad-hoc routing protocols, using the Ad-hoc On-Demand Distance Vector (AODV) protocol as an example. It identifies a number of attack goals, and then studies how to achieve these goals through misuses of the routing messages. To facilitate the analysis, it classifies insider attacks into two categories: atomic misuses and compound misuses. Atomic misuses are performed by manipulating a single routing message, which cannot be further divided; compound misuses are composed of combinations of atomic misuses and possibly normal uses of the routing protocol. The analysis results in this paper reveal several classes of insider attacks, including route disruption, route invasion, node isolation, and resource consumption. Finally, this paper presents simulation results that validate and demonstrate the impact of these attacks.

How to misuse AODV: a case study of insider attacks against mobile ad-hoc routing protocols*1

This paper presents a systematic analysis of insider attacks against mobile ad-hoc routing protocols, using the Ad-hoc On-Demand Distance Vector (AODV) protocol as an example. It identifies a number of attack goals, and then studies how to achieve these goals through misuses of the routing messages. To facilitate the analysis, it classifies insider attacks into two categories: atomic misuses and compound misuses . Atomic misuses are performed by manipulating a single routing message, which cannot be further divided; compound misuses are composed of combinations of atomic misuses and possibly normal uses of the routing protocol. The analysis results in this paper reveal several classes of insider attacks, including route disruption , route invasion , node isolation , and resource consumption . Finally, this paper presents simulation results that validate and demonstrate the impact of these attacks.