Ad-hoc Routing Protocols Research Articles

Energy, Traffic Load, and Link Quality Aware Ad Hoc Routing Protocol for Wireless Sensor Network Based Smart Metering Infrastructure

Electricity industry is in the midst of revolutionary transition from outdated ageing power infrastructure to an intelligent sophisticated smart grid network utilizing modern communication technologies to enhance power generation, transmission, distribution, and consumption. Smart metering infrastructure is an integral part of the smart power grid revolution. Smart meters, in addition to their primary billing functions, serve as distributed Wireless Sensor Network (WSN) nodes for enhancing grid reliability. Existing ad hoc routing protocols are based on single routing criterion such as hop count. This single routing metric approach can overload and deplete resource constrained smart meters along preferred paths. A protocol is needed which is aware of energy level and traffic congestion of smart metering nodes. In addition, protocol should select route based on link quality for optimal routing. In this paper, a novel WSN ad hoc routing protocol ETL-AODV is proposed for reliable and energy efficient communication of smart metering nodes. Three simulation based case studies are conducted to analyze the performance of the proposed protocol, and relative comparison is provided based on four metrics: (i) packet delivery ratio (PDR), (ii) normalized routing load (NRL) (iii) average energy consumption and (iv) average end-to-end delay.

Experimental Analysis of AODV and DSR with Varying Vehicle Mobility and Density in Vanet Scenario

In last three decade ,tremendous improvement is made in research area of wireless adhoc network and now a days ,one of the most attractive research topi c is inter vehicle communication i.e. realization of mobile adhoc network . A rich literatureis available in vehicular networksto explore the special characteristics of VANET but all the protocols are majorly geography based. It has some unique characte ristics which make it different from other adhoc routing protocols as well as difficult to define any exact mobility model and routing protocol because of their changing mobility patterns. In this research paper , the performance of two on-demand routing protocols AODV and DSR has been analysed by means of packet delivery ratio,end-to-end delay,packet loss ratio and normalised routing load with varying speed and node density under TCP connections.

Performance Analysis of Various Ad Hoc Routing Protocols in MANET using Variation in Pause Time and Mobility Speed

A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with each other without using any existing infrastructure, access point or centralized controller. In MANET, as nodes moves in and out of the network, the topology of the network changes frequently and thus, routing becomes a challenging task. A variety of routing protocols with varying network conditions are analyzed to find an optimized path from a source to destination. In this article a performance comparison of four popular mobile ad-hoc network routing protocols i.e. Ad hoc On-demand Distance Vector (AODV), Dynamic Source Routing (DSR), Optimization Link State Routing (OLSR) and Zone Routing Protocol (ZRP) is presented with variable pause time. A network simulator QualNet 6.1. from scalable networks is used to evaluate the performance of these protocols. The performance analysis is based on different network metrics such as Average End to End delay (s), Average Jitter(s), Throughput and Packet delivery ratio.

Challenges in Mobile Ad Hoc Network for Secure Data Transmission

An ad-hoc mobile network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on a continual basis. The primary goal of such an ad-hoc network routing protocol is correct and efficient route establishment between a pair of nodes so that messages may be delivered in a timely manner. LAR is an on-demand protocol who is based on the DSR (Dynamic Source Routing). The Location Aided Routing protocol uses location information to reduce routing overhead of the ad-hoc network! Normally the LAR protocol uses the GPS (Global Positioning System) to get these location information’s. With the availability of GPS, the mobile hosts knows there physical location. Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security-sensitive operations are still the main applications of ad hoc networks, although there is a trend to adopt ad hoc networks for commercial uses due to their unique properties. One main challenge in design of these networks is their vulnerability to security attacks. In this paper, we study the threats an ad hoc network faces and the security goals to be achieved. We identify the new challenges and opportunities posed by this new networking environment and explore new approaches to secure its communication. In particular, we take advantage of the inherent redundancy in ad hoc networks - multiple routes between nodes to defend routing against denial of service attacks.

The Extended Clustering AD HOC Routing Protocol (ECRP)

Ad hoc networks are acollection of mobile nodes communicating via wireless channels without any fixed infrastructure. Because of their ease and low cost of building, ad hoc networks have a lot of attractive applications in different fields. The topology of ad hoc networks chan ges dynamically, and each node in the network can act as a host or router.With the increase in the number of wirelessdevices and large amount of traffic to be exchanged, the demand for scalable routing protocols has increased. This paper presents a scalable routing protocol, based on AODV protocol, called the Extended Clustering Ad Hoc Routing Protocol (ECRP). This is a hybrid protocol, which combines reactive and proactive approaches in routing. The protocol uses the Global Positioning System to determine the position of certain nodesin the network. The evaluation methodology and s imulation results obtained showthat the protocol is efficient and scales well in large networks.

EAOMDV-MIMC: A Multipath Routing Protocol for Multi-Interface Multi-Channel Mobile Ad-Hoc Networks

Multipath routing has been proposed to improve performance of mobile ad-hoc networks (MANETs). However, due to: (1) nodes lacking of network interface and (2) route coupling, using multiple paths concurrently in conventional single channel MANETs rarely exhibit performance gain. To improve performance, an ad-hoc routing protocol (and its extension) that utilizes multiple homogeneous network interface is proposed in this paper. Unlike other related multi-channel routing protocols, channels are not assigned. Instead, nodes are allowed to make use of all available channels they are tuned to. In the base protocol, nodes estimate channel conditions by monitoring their network interface queues and distribute data packets to different channels and next-hops according to their conditions. In the extended protocol, estimated channel condition at a node is further propagated to neighboring nodes by piggybacking channel condition information in data packets. With overhearing, other nodes can retrieve this information to make better next-hop selections. Extensive simulation studies show that our protocol outperforms other related multi-channel routing protocols.

A Review of Automated Formal Verification of Ad Hoc Routing Protocols for Wireless Sensor Networks

This paper surveys how formal verification can be used to prove the correctness of ad hoc routing protocols, which are fundamental infrastructure of wireless sensor networks. The existing techniques fall into two classes: verification on small-scale networks and verification on unbounded networks. The former one is always fully automatic and easy to use, thanks to the limited state space generated in verification. However, it cannot prove the correctness over all cases. The latter one can provide a complete proof based on abstractions of unbounded network. However, it usually needs user intervention and expertise in verification. The two kinds of technique are illustrated by verifications against some key properties such as stability, loop-freedom and deadlock-freedom. To conclude, they can be used to find faults and prove correctness, respectively. We believe that they can together aid the development of correct ad hoc routing protocols and their reliable implementations.

Fixed Parameters Simulation Comparison of the Generic Category Ad-hoc Protocols

An ad hoc network has certain characteristics, which imposes new demands on the generic routing protocol. The most important characteristic is dynamic network topology, which is consequence of node mobility. Nodes can change position quite frequently, which means we need a routing protocol that quickly adapts to topology changes. Many Routing protocols have been developed for accomplishing this task. In this thesis we have simulated, analyzed and compared three homologous ad-hoc routing protocols DSDV, DYMO and ZRP at fixed scenarios. We have used Qualnet version 5.0.2 Simulator for the simulation of these routing protocols and compared them for throughput, average end to end delay, Average jitter, Mobility, Number of broadcast and query packets transmitted and received.

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.

Analysis on Ad Hoc Routing Protocols in Wireless Sensor Networks

Analysis on Ad Hoc Routing Protocols in Wireless Sensor Networks

Security Mechanisms to Decrease Vulnerability of Ad-hoc Routing Protocols

Many proposed routing protocols for ad hoc networks operate in an ad hoc fashion, as on demand routing protocols often have low overhead and faster reaction time than other types of routing based on periodic protocols. Dynamic nature of ad-hoc networks leads to challenges in securing the network. Due to the vulnerable nature of ad-hoc networks there are many security threats. One of the solutions to the problem is ARAN - Authenticated routing protocol which is a secure protocol and provides Integrity, Availability, Confidentiality, Authenticity, Non repudiation, Authorization & Anonymity. But an authenticated selfish node can interfere this protocol and disturb the network by dropping packets. However varieties of attacks targeting routing protocols have been identified. By attacking, the routing protocol attacker can absorb network traffic, inject them in the path between source and destination and thus control 0network traffic. Therefore many secure routing protocols have been developed that deal with these attacks. This paper analyzes the security aspects of one commonly used secure routing protocol ARAN.

Compass of Research on Ad-hoc Routing Protocols – A Study of the Literature

An ad-hoc routing protocol is a caucus, or customary, that controls how nodes decide which way to route packets between computing devices in a mobile ad hoc network. Over the years, abundant routing protocols have been developed for ad hoc mobile networks. These can be categorized into table-driven and on-demand routing. The simulations have shown that there certainly is a need for a special ad-hoc routing protocol when mobility increases and security in mobile ad-hoc networks is an extensive area of research. This research paper is a compassing of research on ad-hoc routing protocols. It gives a sufficient amount of literature for the better understanding of the work ahead.

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.

Impact of Model Mobility in Ad Hoc Routing Protocols

An Ad Hoc network is a temporary network without infrastructure, dynamically formed by mobile devices without turning to any existing centralized administration. To send packets to remote nodes, a node use other nodes as intermediate relays, and ask them to transmit its packets. For this purpose, a routing protocol is needed. Because mobile devices are used, the network topology is unpredictable and can change at any time. The objective of this paper is to know the effect of mobility on the performance of Ad Hoc routing protocols, based on multi simulations performed with Glomosim.

Simulation and Performance Analysis of Routing Protocols in Wireless Sensor Network using QualNet

A sensor network is a system that consists of thousands of very small stations called sensor nodes. The communication among nodes is done in a wireless fashion, and thus, the name of wireless sensor networks. Wireless sensor networks (WSN) have generated tremendous interest among researchers in recent years because of their potential usage in wide variety of applications [1]. In mobile sensor network (MSN), nodes are free to move with wireless links without any infrastructure.This paper investigates & undertakes simulation based study of Adhoc Routing Protocols in wireless sensor Network. In this paper comparison of four Routing Protocols AODV, DYMO, OLSR & IERP is done by using random waypoint mobility model and changing the nodes mobility using QualNet 5.0.2 Simulator. The metrics used for performance evaluation are Average Jitter, Throughput, Endto End delay, Signals received with errors, Average Queue Length, Packets to Application Layer, Total packets Received at the Receiver end.

Ant Colony based Mobile Ad Hoc Networks Routing Protocols: A Review

obile ad-hoc networks (MANETs) are the wireless ad-hoc networks which enclose sovereign group of wireless mobile nodes. The communication is relayed via routes which are discovered using various routing protocols. Diverse routing protocols have been proposed so far in MANETs. Likewise, swarm intelligence (SI) based ant colony optimization (ACO) technique have various routing protocols which can also solve the routing problems in MANETs. ACO uses the chemical substance called Pheromone whose value is stored in pheromone table to find shortest path between source and destination. However our exigent task is to select optimal routing protocol for changeable network scenarios. This paper stated the functioning of existing ACO based ad-hoc routing protocols as well as ad-hoc routing protocols for MANETs and the comparison tables with summery of every protocol is shown. Moreover this review will help researchers in having glimpse of the existing protocols and thus can select optimal routing protocol which responds quickly on change of network topology.

Joint path and spectrum diversity in cognitive radio ad-hoc networks

The uncertain availability of the spectral resource imposes unique challenges in cognitive radio networks. One of the critical issues is to counteract the performance degradation experienced by cognitive users (CUs) due to the activity of primary users (PUs). Since the activity of PUs varies both in frequency and space domain, diversity techniques can represent an efficient way to address this issue. In this article, it is proposed to jointly exploit path and spectrum diversity for effective use of spectrum in cognitive radio ad-hoc networks (CRAHNs). By jointly exploiting both the diversities, CUs can switch dynamically to different paths and spectrum bands for communicating with each other in presence of frequency- and space-varying PU activity. This idea is adopted in a routing protocol, referred to as Dual Diversity Cognitive Ad-hoc Routing Protocol, and simulation results reveal the effectiveness of introducing joint path and spectrum diversity in CRAHNs.

Performance analysis of mobile ad hoc routing protocols using extensive metrics

A Mobile ad hoc network (MANET) is an autonomous system of mobile nodes connected by wireless links. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These nodes change position frequently . Routing is critical issue in MANET. Simulation is the research tool of choice for a majority of the mobile ad hoc networks community. We have conducted survey of simulation results of various MANET routing algorithm and analyzed them. The routing algorithms considered are classified into two categories proactive and reactive. The algorithms considered are AODV, DSDV, DSR, and TORA. Research has shown that these ad-hoc routing protocols work well for MANETs with different characteristics and requirements. In this paper, we investigate how these ad-hoc routing protocols perform in terms of these extensive metrics like Packet delivery fraction, Average end to end delay, Routing load, Data packet loss, Throughput, Simulation time, Transmission range, Terrain range.

Performance Evaluation of Different Wireless Ad Hoc Routing Protocols

One of the major challenges in wireless ad hoc network is the design of robust routing protocols. The routing protocols are designed basically to established correct and efficient paths between source and destination. In the recent years several routing protocols have been proposed in literature and many of them studied through extensive simulation at different network characteristics. In this paper we compare the performance of three most common routing protocols of mobile ad hoc network i.e. AODV, DSR and ZRP. Performance of these three routing protocols are analysed based on given set of parameters. We compare the packet delivery ratio, average end to end delay, average jitters and energy consumption behaviours of the AODV, DSR and ZRP.

Performance Evaluation AODV, DYMO, OLSR and ZRPAD Hoc Routing Protocol for IEEE 802.11 MAC and 802.11 DCF In Vanet Using Qualnet

In VANET high speed is the re al characteristics which leads to frequent breakdown, interference etc. Therefore Performance of adhocrouting protocols is helpful to improve the Quality of Service (QOS).In this paper we studied various adhoc routing protocols, Reactive, Proactive & Hybrid, taking in to consideration parameters like speed, altitude, mobility etc in real VANET scenario. The AODV andDYMO (Reactive), OLSR (Proactive) and ZRP (hybrid) protocolsare compared forIEEE 802.11(MAC) andIEEE 802.11(DCF) standard using Qualnet as aSimulation tool. Since IEEE 802.11, coversboth physical and data link layer. Hence performance of the prot ocols in these layers helps to make a right selectionof Protocol for high speed mobility.Varying parameters of VANET shows that in the real traffic scenarios proactive protocol performs mo re efficiently for IEEE 802.11 (MAC) andIEEE 802.11(DCF).