A Performance Comparison of Wireless Ad Hoc Network Routing Protocols under Security Attack

Routing protocol is the primary strategy to design any wireless network. In Mobile AdHoc Network many routing protocols are present for sending packets from source to destination. Routing protocols in Mobile AdHoc Networks (MANETs) are reactive routing protocols, proactive routing protocols, hybrid routing protocols. Performance analysis of different routing protocols is the major step before selecting the routing protocol. Routing protocols perform different under different traffic conditions in different environments. In this paper, the TCP and UDP based performance analysis is carried out in reactive routing protocols and proactive routing protocols with different packet size using NS2 simulator under different traffic conditions. The delay, throughput and packet delivery ratio are common measures parameters used for the comparison of performance of reactive protocols and proactive protocols.

Wireless Ad Hoc network routing algorithm is one of the core technologies of wireless Ad Hoc networks. Ad Hoc network is dynamic topology on characteristic, mainly reflected on the network node number and node movement, which lead to network topology changes, in order to study the Ad Hoc network size and topology changes influence on packet delivery, time delay and routing control, through experiment it is concluded that, the dynamic source routing protocol is an ideal choice.

Mobile Ad-hoc Network (MANET) has emerged as the self organized wire less interconnection for the various applications in random topology. As most of the multimedia applications require strict QoS guarantee during the communication between a single source and multiple destinations. How ever, achieving reliable multicast transmission in MANET is crucial due to the dynamic network topology caused by the node mobility. This gives rise to the need for an efficient multicast routing strategy. This paper proposes a novel scheme PBMRP-BR (position-based Multicast Routing Protocol for Ad-hoc Network Using Backpressure Restoration) for efficient transmission of multimedia applications in Ad-hoc Network, which provides priorities for routing based on Distance of path, Load at the node (ie, traffic) and queue length at the node(ie, bandwidth). It also keeps the path information including bandwidth resources of each node for routing decisions. The problem of the link failure in the channel during the call in progress thus lead in the degradation of the QoS (Quality of Service).To deal this we are using a Backpressure Technique The simulation results shows that the proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The simulation results shows the proposed PBMRP-BR protocol achieve the above objectives and gives the batter results than previous schemes like DSR for the maintenance of overheads and the path reliability. Our proposed scheme will improve the bandwidth utilization by reducing the congestion in the Adhoc wireless network.

Today, the use of Mobile Ad Hoc Network (MANET) is becoming increasingly popular due to its flexibility and ease of use wherever and whenever. MANET is able to adapt to many applications, such as disaster management and military operations. The MANET routing protocol consists of two types, namely Proactive Routing Protocols and On Demand Routing Protocols. Destination-Sequence Distance-Vector (DSDV) is an example of a protocol that includes Proactive Routing Protocols. Meanwhile, Ad Hoc on-Demand Distance Vector Routing (AODV) and Dynamic Source Routing (DSR) are examples of protocols that include On Demand Routing Protocols or Reactive Routing Protocols. Because routing protocols greatly affect MANET performance significantly, it is necessary to study the performance of routing protocols. This paper discusses the performance comparison of MANET routing protocol based on RandomWaypoint mobility model. The experiment was carried out by applying the MANET routing protocol to the RandomWaypoint mobility model. Routing protocols used are AODV, DSDV and DSR. The simulation is done using NS-2 software. The total of nodes used in simulations is 100, 150, 200 and 250 nodes respectively. Length of simulation time 900 s. The simulation area take place in urban residential areas. Performance evaluation is performed on variable packet delivery ratio (PDR), throughput, average end to end delay, packet loss and normalized routing load (NRL).

QoS Analysis for Ad-Hoc Networks

Wireless technology based on the IEEE 802.11 standard is widely deployed. This technology is used to support multiple types of communication services (data, voice, image) with different QoS requirements. MANET (Mobile Adhoc NETwork) does not require a fixed infrastructure. Mobile nodes communicate through multihop paths. The wireless communication medium has variable and unpredictable characteristics. Furthermore, node mobility creates a continuously changing communication topology in which paths break and new one form dynamically. The routing table of each router in an adhoc network must be kept up-to-date. MANET uses Distance Vector or Link State algorithms which insure that the route to every host is always known. However, this approach must take into account the adhoc networks specific characteristics: dynamic topologies, limited bandwidth, energy constraints, limited physical security, ... Two main routing protocols categories are studied in this paper: proactive protocols (e.g. Optimised Link State Routing - OLSR) and reactive protocols (e.g. Ad hoc On Demand Distance Vector - AODV, Dynamic Source Routing - DSR). The proactive protocols are based on periodic exchanges that update the routing tables to all possible destinations, even if no traffic goes through. The reactive protocols are based on on-demand route discoveries that update routing tables only for the destination that has traffic going through. The present paper focuses on study and performance evaluation of these categories using NS2 simulations. We have considered qualitative and quantitative criteria. The first one concerns distributed operation, loop-freedom, security, sleep period operation. The second are used to assess performance of different routing protocols presented in this paper. We can list end-to-end data delay, jitter, packet delivery ratio, routing load, activity distribution. Comparative study will be presented with number of networking context consideration and the results show the appropriate routing protocol for two kinds of communication services (data and voice).

With the development of Mobile Internet, Accessing to the Internet or sharing data with others has become an important integral part of daily life. There exists one kind of networks which be called infrastructure less mobile network commonly known as mobile Ad Hoc network (MANET) plays a critical role to satisfy the demands above. Classical routing protocols of MANET like AODV, TORA or LAR are widely used. However these protocols have somewhat inevitable weakness in routing overhead, delay or throughput. This paper mixes two main routing strategies known as topology-based and location-based (RMTF) meanwhile introduces the concept of area. Nodes are divided into different areas and use location-based routing during intra-area communication on the other hand apply topology-based routing in inter-area. The RMTF effectively promotes weaknesses of either topology-based routing or location-based routing in routing overhead, delay and throughput.

Background:AMobileAdHocNetwork (MANET) consistsofmany independentnodes that operate over awireless topology with numerous Quality of Service (QoS) requirements. So, a robust routing protocol that also provides QoS parameters to its different range of applications is needed. Various network parameters like node density, node mobility, field size etc. also effects the QoS parameters of MANETs. Methods: The traditional reactive routing protocols do not have any backup route in case of a node failure and hence are not effective for MANETs. Ad Hoc on Demand Distance Vector Backup Routing (AODV BR) protocol performs better than traditional routing protocols but is not effective when the backup route fails. So, to counter this problem, the authors had proposed AODV nth BR that keeps on providing backup routes when multiple nodes fail and hence successfully transfers the data to the destination. The nodes for backup routing are selected based on their distance from the failed node and energy efficiency. Results: In this paper, the performance of AODV nth BR has been compared with AODV, DSR and AODV BR protocol under varying node density (nodes 20, 60,100) and node mobility conditions (5m/s, 20m/s, 50m/s). The values for Packet Delivery Fraction (PDF) for 60 nodes at speed 20m/s in case of AODV nth BR protocol after 6000 rounds is 0.3054. Comparatively, value of AODV BR is 0.2664, AODV is 0.1936 and DSR is 0.1056. QoS performance is measured in terms of end to end delay, packet delivery fraction and lifetime of devices and it has been shown through simulated results that AODV nth BR protocol gives better output than traditional routing protocols. Conclusion: From the simulated results explained in detail in the paper, it has been observed that route after link breakage is found to be best with AODV nth BR protocol and this can be clearly seen in the QoS parameters obtained.Keywords: AODV BR, AODV nth BR, MANETs, Node Density, Node Mobility

Mobile Ad hoc Networks (MANET) comprises of self-organizing autonomous mobile nodes. MANETs are open and decentralized. Therefore they are vulnerable to malicious entities. MANETs are multi-hop wireless network where all nodes supportively maintain network connectivity without a centralized infrastructure. Since MANETs are infrastructure less and independent, the secure communication is the main issue. Therefore they are vulnerable to malicious entities. Here the location identity and traffic can be traced out by an outside observer. Anonymity means secure communications by hiding node identities and preventing traffic analysis attacks by outside observers. This paper proposes Position based Anonymous Routing Scheme in MANETs (PARS).Here the routing is based on Greedy Perimeter Stateless Routing Protocol. The objective is an anonymous routing protocol for the network. The proposed one is a zone based anonymous GPSR based protocol that can provide source, destination and route anonymity. Performance of the proposed system is compared with that of GPSR and AODV using Network Simulator. Index Terms: Anonymous routing, position-based routing, random forwarder, zone partition. I. Introduction Mobile Ad hoc Networks are collection of independent mobile nodes that can communicate by radio waves. It is an infrastructure less self-organizing network. The nodes that are in radio range can communicate by single hop or by multi hop with the help of intermediate nodes. The network is open and decentralized and fully distributed. So they are perfect choice for communication and information sharing. MANETs are susceptible to malicious entities that aim to alter and analyzed the traffic analysis by communication eaves dropping or attacking routing protocols. MANETs are characterized by their distributed operation, multi hop routing, dynamic topology and shared physical medium. Nodes in a MANET are independently free to move in any direction. Due to the lack of a centralized coordinator security is the major concern here. Wireless communication can endure interferences or malicious interceptions; whereas multi-hop communication assumes that each node will perform properly its functions to support network services. Further, self-organization increases the complexity of security management operations as access control, node authentication, secure routing and cryptographic key distribution. There is no fixed infrastructure and the topology is frequently changing due to node mobility or environmental changes. Therefore, it is very hard to maintain a stable and efficient end-to-end route in an ad-hoc network. Each node in MANET is energy constrained. There is verylimited physical security in MANET. The type of attacks can be Active attacks or Passive attacks. The common security issues are Passive attacks which include eaves dropping and information disclosure. Active attacks include Do Sand Data modification. There are other more specific problems with mobile ad hoc network such as vulnerability of channels and nodes, Byzantine black hole and Byzantine wormhole attack. The security issue also includes attacks that may inject erroneous routing information and diverting network traffic thus making routing inefficient. There are many methods to reduce the impact of these attacks, which include a secure routing using public and private key s to get a certification authority and use of digital signatures and prior it rust relationships. Routing is the process of communication from one node to the other host in a network. Routing is the process off or warding packet towards its destination using most efficient path. Routing efficiency is measured in terms of Number of hops, traffic, security, etc. Routing protocols in MANETs are divided as reactive proactive and hybrid. Reactive Protocol maintains the routes in on demand manner. In route discovery phase it floods the route request (RREQ) packets throughout the network. Dynamic source Routing (DSR), ad hoc on- demand distance vector routing (AODV) are some of the examples of reactive protocols. In proactive approach every node in the MANET continuously maintains the complete routing information of the entire network. This is accomplished by flooding network periodically with network status information. Global State Routing (GSR), Hierarchical State Routing (HSR) and Destination Sequenced Distance Vector Routing (DSDV) are some of the examples of proactive

In Mobile Ad-hoc NETwork (MANET) each node has the possibility to move freely in the space and communicate with each other over wireless link without any centralized controller or base station. These characteristics makes MANET useful and practical in several fields like military scenarios, sensor networks, Rescue operations, students on campus, etc. but this kind of network still suffers from a number of problems, power consumption is one of the most crucial design concerns in Mobile Ad-hoc networks as the nodes in MANET have battery limited. In this paper, we will discuss about the aspect of energy consumption in MANET's routing protocols. A performance comparison of four routing protocols Dynamic Source Routing (DSR), Ad hoc On-Demand Distance Vector (AODV), Destination-Sequenced Distance Vector (DSDV) and Optimized Link State Routing (OLSR) with respect to average energy consumption are explained thoroughly. Then, an evaluation of how the varying parameters of network in diverse scenarios affect the power consumption in these four protocols is discussed. A detailed simulation model using Network Simulator 2 (NS2) with different mobility and traffic models is used to study their energy consumption.

An adhoc network is a collection of mobile nodes connected by a wireless link, where each node acts as a router. In order to facilitate the communication within the network, a routing protocol is needed. Due to bandwidth constraint and dynamic topology of the mobile adhoc Networks supporting Quality of Service (QoS) is challenging task. The aim of this work is to present QoS enabled routing protocol in adhoc networks and compare it with normal routing protocol. The Optimized Link State Routing (OLSR) protocol is an optimization of the classical link state protocol, which is used for implement the QoS. Such protocol is adopted for the reason that it reduces the size of control messages and minimizes the overhead from the flooding of control traffic. The performance of both routing and QoS routing protocols are evaluated using Network simulator Ns-2.QoS enabled routing protocol shows a significant improvement in protocol performance metrics applied in our measurements, such as packet delivery ratio, packet loss and delay.

In a mobile ad-hoc network (MANET) where Mobile Nodes (MNs) self-organize to ensure the communication over radio links, routing protocols clearly play a significant role. In future MANETs, protocols should provide routing under full mobility, power constraints, fast time-varying channels, and nodes subject to high loading. In this article, a novel robust routing protocol, named distributed X-layer fastest path (DXFP), is proposed. The protocol is based on a cross-layer metric which is robust against the time-variations of the network as far as topology (mobility), congestion of the nodes and channel quality (fading, power constraints) are concerned. All these features are integrated in a single physical cost, i.e., the network crossing time, which has to be minimized. Furthermore, several routes from source to destination are stored for a given data flow to efficiently face the disconnections which frequently occur in MANETs. It is shown that the DXFP protocol, though locally operating in a fully distributed way within the MNs, provides, for each data flow, the optimum routes according to the considered metric. The DXFP protocol has been compared with two of the most commonly used routing protocols for MANETs, i.e., dynamic source routing and ad hoc on-demand distance vector, showing significant improvements in performance and robustness.

Vehicular Ad Hoc Networks (VANETs), a subclass of Mobile Ad Hoc Networks (MANETs), rely on efficient routing protocols to maintain reliable communication in highly dynamic and decentralized environments. While numerous routing strategies have been proposed, their performance varies significantly with the choice of underlying mobility models that simulate real vehicular movement. This study presents a two-phase evaluation of five widely used routing protocols—Ad hoc On-Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Destination-Sequenced Distance Vector (DSDV), Optimized Link State Routing (OLSR), and Geographic Routing Protocol (GRP)—across fourteen realistic mobility models, including the Intelligent Driver Model (IDM), Car-Following Model (CFM), and Lighthill–Whitham–Richards (LWR) model. Simulations are executed using Simulation of Urban Mobility (SUMO), Network Simulator 3 (NS-3), and the Veins framework. The performance is assessed using eight key metrics: Packet Delivery Ratio (PDR), End-to-End Delay (E2ED), Throughput, Jitter, Energy Consumption, Packet Loss Ratio (PLR), Normalized Routing Load (NRL), and Link Breakage Rate (LBR). Among the evaluated protocol–mobility combinations, AODV paired with the CFM model demonstrated comparatively favorable performance under the considered simulation configuration: 93% PDR, 79.4 ms E2ED, 332 kbps throughput, 3.4 ms jitter, 3.48 J energy consumption, 7% PLR, 0.3 NRL, and 5 link breakages per simulation. This study provides a systematic and unified comparative evaluation of five widely used routing protocols across fourteen simulation-based vehicular mobility models. The findings provide scenario-specific comparative insights for simulation-based VANET performance evaluation and offer practical, simulation-based guidance for selecting suitable protocol–mobility model combinations under the evaluated experimental conditions.

Ad hoc network is sub-domain of network communication in which user communicates with each other by temporarily network without any centralized network administration. Each node acts as node as well as router to forward data packets on the basis of routing protocols. Wireless communication is the most research oriented era now days; most importantly in the field of vehicular ad hoc network. VANET is the sub-ordinate of the Mobile ad hoc Network (MANET). Efficient routing protocols play vital role in ad hoc networks in terms of network reliability and network performance. Routing in VANET is the most important and challenging research issue. Mostly MANET routing protocols used in the VANET, but usually MANET routing protocols are not compatible within VANET's scenario due to its mobility differences. In this research we validate a VANET routing protocol GeoWave for better information dissemination to overcome the traffic blockage and which will reduce the Carbon Dioxide (CO) of the Vehicles in the large congested urban area scenario. We use well-known network simulator Omnet++ and SUMO traffic generator to simulate the network environment.

Routing problems in mobile ad-hoc networks (MANET) have been receiving increasing attention in the last few years. Most of the proposed routing protocols concentrate on finding and maintaining routes in the face of changing topology caused by mobility or other environmental changes. More recently, power-aware routing protocols and topology control algorithms have been developed to address the issue of limited energy reserve of the nodes in ad-hoc networks. We consider the routing problem in MANET with the goal of maximizing the life time of the network. We propose a distributed routing algorithm that reaches the optimal (centralized) solution to within an asymptotically small relative error. Our approach is based on the formulation of multicommodity flow, and it allows to consider different power consumption models and bandwidth constraints. It works for both static and slowly changing dynamic networks.