Showing papers on "Ad hoc On-Demand Distance Vector Routing published in 2017"

Vehicular Ad Hoc Network (VANET): A Survey, Challenges, and Applications

Abstract: An ad hoc network consisting of vehicles has emerged as an interesting but challenging domain where a lot of new application may find their place. Though research in this field is on since last two decades, large-scale practical implementation still require some time. In this paper, a survey of current challenges and potential applications, incorporating medium access control schemes, routing approaches, hardware and spectrum issues, and security and privacy issues for VANETs, is presented.

A Survey of Ant Colony Optimization Based Routing Protocols for Mobile Ad Hoc Networks

Abstract: Developing highly efficient routing protocols for Mobile Ad hoc NETworks (MANETs) is a challenging task. In order to fulfill multiple routing requirements, such as low packet delay, high packet delivery rate, and effective adaptation to network topology changes with low control overhead, and so on, new ways to approximate solutions to the known NP-hard optimization problem of routing in MANETs have to be investigated. Swarm intelligence (SI)-inspired algorithms have attracted a lot of attention, because they can offer possible optimized solutions ensuring high robustness, flexibility, and low cost. Moreover, they can solve large-scale sophisticated problems without a centralized control entity. A successful example in the SI field is the ant colony optimization (ACO) meta-heuristic. It presents a common framework for approximating solutions to NP-hard optimization problems. ACO has been successfully applied to balance the various routing related requirements in dynamic MANETs. This paper presents a comprehensive survey and comparison of various ACO-based routing protocols in MANETs. The main contributions of this survey include: 1) introducing the ACO principles as applied in routing protocols for MANETs; 2) classifying ACO-based routing approaches reviewed in this paper into five main categories; 3) surveying and comparing the selected routing protocols from the perspective of design and simulation parameters; and 4) discussing open issues and future possible design directions of ACO-based routing protocols.

Wireless SDN mobile ad hoc network: From theory to practice

Abstract: A promising approach for dealing with the increasing demand of data traffic is the use of device-to-device (D2D) technologies, in particular when the destination can be reached directly, or though few retransmissions by peer devices. Thus, the cellular network can offload local traffic that is transmitted by an ad hoc network, e.g., a mobile ad hoc network (MANET), or a vehicular ad hoc network (VANET). The cellular base station can help coordinate all the devices in the ad hoc network by reusing the software tools developed for software-defined networks (SDNs), which divide the control and the data messages, transmitted in two separate interfaces. In this paper, we present a practical implementation of an SDN MANET, describe in detail the software components that we adopted, and provide a repository for all the new components that we developed. This work can be a starting point for the wireless networking community to design new testbeds with SDN capabilities that can have the advantages of D2D data transmissions and the flexibility of a centralized network management. In order to prove the feasibility of such a network, we also showcase the performance of the proposed network implemented in real devices, as compared to a distributed ad hoc network.

Research and Simulation of Queue Management Algorithms in Ad Hoc Networks Under DDoS Attack

Abstract: Concentrating on the influence of DDoS applied to ad hoc networks, we introduced three classic queue management algorithms: Drop-Tail, random early detection (RED), and random exponential marking (REM). We analyzed and compared the defensive abilities of these algorithms applied to ad hoc networks with NS2 under DDoS attack. The results showed that active queue management algorithms, such as REM and RED, exhibited stronger defensive abilities than the passive queue management algorithm Drop-Tail under medium- and small-scale DDoS attacks; however, under large-scale DDoS attack, all three algorithms exhibited insufficient defensive capabilities. This means that other defense schemes, such as network detection, must be integrated into security schemes to defeat DDoS attacks.

Cluster based emergency message broadcasting technique for vehicular ad hoc network

Abstract: Broadcasting is one of the major emergency services of Vehicular ad hoc network, since the number of vehicles increases every day. Because of the high density of the vehicles, it is necessary to broadcast emergency messages to all the vehicles to avoid traffic jam and vehicle accidents. Reliable broadcasting of messages in self-organizing Ad hoc networks is a promising research field. In this paper a cluster based emergency message broadcasting algorithm is proposed. In this regard we have proposed cluster based architecture for emergency message dissemination and collision avoidance in VANET. In this paper, first the formation of cluster is done in such a way that it avoids any kind of collision. Once cluster head is selected it takes the responsibility of intra cluster management to avoid interference between the clusters. To increase the reliability during emergency message dissemination two MAC layer broadcasts protocol is used. This assures that message is delivered on time without any hazards. The proposed model is simulated for DSDV, AODV, and DSR protocols with the standards 802.11 and 802.11p in SHWM, Manhattan and freeway mobility models.

Refined trust energy-ad hoc on demand distance vector (ReTE-AODV) routing algorithm for secured routing in MANET

Abstract: The characteristics of MANET such as decentralization, dynamic topology and openness are susceptible for security threats. To overcome the security threats and to provide a reliable network to transmit packets, a need for trust based routing arises. Moreover, the trust along with energy requirement on ad hoc on demand distance vector have paved way for the development of the newly proposed algorithm named as refined trust and energy based ad hoc on demand distance vector algorithm which is the refined form of the existing trust and energy based ad hoc on demand distance vector algorithms and the classical AODV. In this paper, the refinement parameter is the trust. Moreover, Bayesian probability is introduced in this paper for trust management due to its ability to handle uncertainty for obtaining the refined form of Trust calculation. The proposed algorithm routes the packets from the source to destination not through the shortest route but by selecting a reliable route which consumes low energy and trustful for sending the packets. The simulation results obtained from this work show that the proposed algorithm performs better than the existing algorithms in terms of Trust based routing and energy efficiency.

Attack-pattern discovery based enhanced trust model for secure routing in mobile ad-hoc networks

Abstract: Summary Multi-hop routing in an open environment in the absence of well-established infrastructure and centralized authority strives for trustworthiness and cooperation of nodes in a Mobile Ad-hoc Network (MANET). There is no guarantee of secure and reliable delivery of packets when some internal nodes intentionally perform packet forwarding misbehavior by compromising the routing mechanism. In this paper, we address this issue with a trust-model integrated with an attack pattern discovery technique. Extended from the Ad-hoc On-demand Distance Vector (AODV) routing protocol, we propose a trust-based scheme founded on nodes' historical behaviors which adopts a pattern discovery mechanism in order to detect suspicious activities from the malevolent nodes before they start dropping data packets. We also present the detailed mode of operations of three distinct adversary models launching various kinds of packet forwarding misbehavior. Theoretical analysis and experimental results prove that the integration of a pattern discovery method with a trust-based model provides earlier detection of adversaries which follow specific attack patterns and weakens their damaging effects on the network in comparison to a solitary trust-based model. Copyright © 2016 John Wiley & Sons, Ltd.

An efficient protocol for load-balanced multipath routing in mobile ad hoc networks

Abstract: In this paper, we propose a new routing protocol called the Least Common Multiple based Routing (LCMR) for load-balanced multipath routing in Mobile Ad hoc NETworks (MANETs) First, we find multiple paths between a source to a destination, when those exist, along with the estimates of the time to route a packet along each of these paths The data packets originating from the source to the destination are then distributed along these multiple paths in such a way that the number of data packets sent along any such path is inversely proportional to the routing time through this path This distribution strategy keeps the load balanced along all the paths so that the overall routing time for sending the data packets is minimized Routes between a given source-destination pair are discovered in a way similar to that in the Ad hoc On-demand Distance Vector (AODV) routing protocol with the difference that instead of the number of hops, the routing time for reaching the destination along every route is measured, and multiple routes, if those exist, will also be determined by the route discovery process Our proposed technique for distribution of packets along different routes is very elegant with a better performance than the existing load-balanced routing protocols like Fibonacci Multipath Load Balancing (FMLB) and Multiple AODV (MAODV), as established from a theoretical analysis as well as through simulation results

LEPR: Link Stability Estimation-based Preemptive Routing protocol for Flying Ad Hoc Networks

Abstract: Flying Ad Hoc Network (FANET) consisting of Unmanned Aerial Vehicles (UAVs) can undertake many tasks difficult for traditional Mobile Ad Hoc Networks (MANETs). However, the highly dynamic topology of FANET imposes difficulties for adopting existing MANET routing protocols. In this paper, we present the Link Stability Estimation-based Preemptive Routing (LEPR) protocol targeting FANET on the basis of AODV, an existing routing protocol for ad hoc networks. Taking advantage of GPS location information of UAVs, a new link stability metric is introduced for LEPR. This new metric uses the link quality, safety degree and mobility prediction factor to take into account the past, current and future statuses of link stability respectively. With this new metric, LEPR calculates multiple robust link-disjoint paths during the route discovery process. In addition, a semi-proactive route maintenance process is initiated when anticipating link breaks. This preemptive mechanism reduces the number of broken paths and packet latency by finding and switching to a more reliable path early. Simulation results demonstrate that LEPR significantly outperforms two popular routing protocols, AODV and DSR, in terms of packet delivery ratio, delay and routing overhead, whether in a high or low mobility setting.

An EDRI-based approach for detecting and eliminating cooperative black hole nodes in MANET

Abstract: Mobile Ad hoc Network (MANET) is a self-configurable, self-maintenance network with wireless, mobile nodes. Special features of MANET like dynamic topology, hop-by-hop communications and open network boundary, made security highly challengeable in this network. From security aspect, routing protocols are highly vulnerable against a wide range of attacks like black hole. In black hole attack malicious node injects fault routing information to the network and leads all data packets toward it-self. In this paper, we proposed an approach to detect and eliminate cooperative malicious nodes in MANET with AODV routing protocol. A data control packet is used in order to check the nodes in selected path; also, by using an Extended Data Routing Information table, all malicious nodes in selected path are detected, then, eliminated from network. For evaluation, our approach and a previous work have been implemented using Opnet 14 in different scenarios. Referring to simulation results, the proposed approach decreases packet overhead and delay of security mechanism with no false positive detection. In addition, network throughput is improved by using the proposed approach.

Security upgrade against RREQ flooding attack by using balance index on vehicular ad hoc network

Abstract: VANET is an ad hoc network that formed between vehicles. Security in VANET plays vital role. AODV routing protocol is a reactive or on-demand routing protocol which means if there is data to be send then the path will create. AODV is the most commonly used topology based routing protocol for VANET. Using of broadcast packets in the AODV route discovery phase caused it is extremely vulnerable against DOS and DDOS flooding attacks. Flooding attack is type of a denial of service attack that causes loss of network bandwidth and imposes high overhead to the network. The method proposed in this paper called Balanced AODV (B-AODV) because it expects all network node behave normally. If network nodes are out of the normal behavior (too much route request) then they identified as malicious node. B-AODV is designed with following feature: (1) The use of adaptive threshold according to network conditions and nodes behavior (balance index) (2) Not using additional routing packets to detect malicious nodes (3) Perform detection and prevention operations independently on each node (4) Perform detection and prevention operations in real time (5) No need for promiscuous mode. This method for detection and prevention flooding attack uses average and standard deviation. In this method each node is employing balance index for acceptation or rejection RREQ packets. The results of the simulation in NS2 indicates B-AODV is resilience against flooding attack and prevent loss of network bandwidth. Comparing between AODV with B-AODV in normal state (non-attacker) shows B-AODV is exactly match with AODV in network performance, this means that the B-AODV algorithm does not impose any overhead and false positive to AODV.

An improved hybrid technique for energy and delay routing in mobile ad-hoc networks

Abstract: A mobile ad-hoc network (MANET) comprises wireless mobile nodes that dynamically establish a temporary network without needing a central administration or an infrastructure. The Quality of service (QoS) enables a mobile network to interconnect wired or wireless networks. An important research background identifying a path that satisfies the QoS requirements, such as their topology and applications, has become quite a challenge in mobile networks. The QoS routing feature can also function in a stand-alone multi-hop mobile network for real-time applications. A QoS-aware protocol aims to find a stable path between the source and destination nodes that satisfies the QoS requirements. The proposed method was a new energy and delay-aware routing protocol that combines cellular automata (CA) with the hybrid genetic algorithm (GA) and African Buffalo Optimization (ABO) to optimize the path selection in the ad-hoc on-demand distance vector (AODV) routing protocol. The main conclusions of this research include two QoS parameters that were used for routing: energy and delay. The routing algorithm based on CA was used to identify a set of routes that can satisfy the delay constraints and then select a reasonably good route through the hybrid algorithm. Results of the simulation showed that the proposed approach demonstrated a better performance than the AODV with CA and GA.

Classification of node degree based on deep learning and routing method applied for virtual route assignment

Abstract: In recent years, the importance of various wireless network technologies has increased. Specifically, in communication environments noted for severe conditions, such as disasters, war, and terrorism, collaboration between fixed communication infrastructure and wireless ad-hoc networks is indispensable. In this paper, the node degree of wireless communication is classified for disaster situations, and virtual routes are set according to the predetermined node degree. Then, the proposed routing method is employed with base stations as the infrastructure, such that a route may be assigned, maintained, and recovered. Our classification of wireless degree nodes uses deep learning, and virtual routes are created by employing the Viterbi algorithm. The proposed routing method is compared with existing methods (AODV, OLSR, and ZRP) from the viewpoint of route discovery times and reachability via simulations.

A probability based stable routing for cognitive radio adhoc networks

Abstract: Cognitive Radio is devised as a wireless communication technology that enables user to communicate without having a fixed pre assigned radio spectrum. The technology facilitates the utilization of temporarily unused portion of radio frequency in the licensed spectrum region. Since its invention, researchers have carried out their investigation in various directions like spectrum sensing, spectrum allocation, routing etc. In this paper, a routing mechanism is proposed for cognitive radio adhoc network named as proposed stable routing (PSR). The proposed algorithm constructs path from source to destination considering the probability of stability of the selected channel. The channel is considered stable if the probability that the channel would be claimed by the concerned primary user during the operation of secondary user is comparatively low. PSR is simulated in ns-2 and compared with Cognitive AODV (CAODV) protocol. Observation shows that PSR outperforms CAODV in terms of route survival time, routing overhead and packet loss rate.

STAODV: A secure and trust based approach to mitigate blackhole attack on AODV based MANET

Abstract: Mobile ad hoc networks (MANET) is a type of networks that consists of autonomous nodes connecting directly without a top-down network architecture or central controller. Absence of base stations in MANET force the nodes to rely on their adjacent nodes in transmitting messages. The dynamic nature of MANET makes the relationship between nodes untrusted due to mobility of nodes. A malicious node may start denial of service attack at network layer to discard the packets instead of forwarding them to destination which is known as black hole attack. In this paper a secure and trust based approach based on ad hoc on demand distance vector (STAODV) has been proposed to improve the security of AODV routing protocol. The approach isolates the malicious nodes that try to attack the network depending on their previous information. A trust level is attached to each participating node to detect the level of trust of that node. Each incoming packet will be examined to prevent the black hole attack.

Review of ad-hoc on-demand distance vector protocol and its swarm intelligent variants for Mobile Ad-hoc NETwork

Abstract: Mobile Ad-hoc NETwork (MANET) is a rapidly changing network having mobile nodes. The wireless links connecting a node pair are unreliable due to the mobility of nodes; thereby MANET is subjected to frequent link failures that subsequently lead to route failure. It is required for the routing algorithms to determine routes enduring connectivity providing uninterrupted data transmission without compromising quality of service and load balancing. Ad-hoc on-demand distance vector (AODV) routing protocol is predominantly used in MANET for making routing decisions because of its performance in terms of delay, throughput, packet delivery ratio and number of hops when compared to other protocols in the literature. However, this protocol often converges to less reliable routes leading to high control overhead and packet loss. In this study, a multi-objective AODV algorithm is proposed to consider distance, cost, delay, load and reliability as routing metrics. Also modified versions of AODV protocol by applying ant colony optimisation, bee colony optimisation and firefly algorithms have been proposed and the results are presented.

Efficient Route Update and Maintenance for Reliable Routing in Large-Scale Sensor Networks

Abstract: Reliable data transmissions are challenging in industrial wireless sensor networks as channel conditions change over time. Rapid changes in channel conditions require accurate estimation of the routing path performance and timely update of the routing information. However, this is not well fulfilled in existing routing approaches. Addressing this problem, this paper presents combined global and local update processes for efficient route update and maintenance, and incorporates them with a hierarchical proactive routing framework. While the global process updates the routing path with a relatively long period, the local process with a shorter period checks potential routing path problems. A theoretical modeling is developed to describe the processes. Through simulations, the presented approach is shown to reduce end-to-end delay up to 30 times for large networks, while improving packet reception ratio (PRR) in comparison with hierarchical and proactive routing protocols ROL/NDC, DSDV, and DSDV with IPv6 Routing Protocol for Low-Power and Lossy Networks’ Trickle algorithm. Compared with reactive routing protocols AODV and Ad Hoc On-demand Multipath Distance Vector, it provides similar PRR while reducing end-to-end delay over 15 times.

A Source Anonymity-Based Lightweight Secure AODV Protocol for Fog-Based MANET.

Abstract: Fog-based MANET (Mobile Ad hoc networks) is a novel paradigm of a mobile ad hoc network with the advantages of both mobility and fog computing. Meanwhile, as traditional routing protocol, ad hoc on-demand distance vector (AODV) routing protocol has been applied widely in fog-based MANET. Currently, how to improve the transmission performance and enhance security are the two major aspects in AODV's research field. However, the researches on joint energy efficiency and security seem to be seldom considered. In this paper, we propose a source anonymity-based lightweight secure AODV (SAL-SAODV) routing protocol to meet the above requirements. In SAL-SAODV protocol, source anonymous and secure transmitting schemes are proposed and applied. The scheme involves the following three parts: the source anonymity algorithm is employed to achieve the source node, without being tracked and located; the improved secure scheme based on the polynomial of CRC-4 is applied to substitute the RSA digital signature of SAODV and guarantee the data integrity, in addition to reducing the computation and energy consumption; the random delayed transmitting scheme (RDTM) is implemented to separate the check code and transmitted data, and achieve tamper-proof results. The simulation results show that the comprehensive performance of the proposed SAL-SAODV is a trade-off of the transmission performance, energy efficiency, and security, and better than AODV and SAODV.

An ant-based QoS-aware routing protocol for heterogeneous wireless sensor networks

Abstract: Most of the existing routing protocols for wireless sensor networks consider homogeneous nodes wherein all sensor nodes have the same sensing, communication and computation capabilities. However, recent advances in multimedia technology have led to the availability of a wide range of sensors with widely varying capabilities. The introduction of multimedia sensors has presented additional challenges such as requirement of application-specific quality of service (QoS), high bandwidth and low delay. This paper presents an enhanced ant-based QoS-aware routing protocol for heterogeneous wireless sensor networks (EAQHSeN). It is a differentiated service-based QoS routing protocol for heterogeneous wireless sensor networks with multimedia and scalar nodes. We have used bio-inspired routing heuristics, and the key feature of the protocol is its ability to meet diverse QoS requirements claimed by heterogeneous traffic generated by the nodes. The routing decision is taken independently for control traffic, scalar traffic and multimedia traffic, thus maximizing the network performance and utilization. Simulation results show that the proposed EAQHSeN protocol performs better than the ad hoc on-demand distance vector (AODV) routing protocol and energy-efficient ant-based routing (EEABR) protocol. The average percentage improvement in minimum residual energy by EAQHSeN over EEABR is approximately 4 % which is an indication of extended lifetime.

Mobility-aware route selection technique for mobile ad hoc networks

Abstract: In this study, the authors present a stable and reliable route selection technique based on the nodes' mobility in mobile ad hoc networks. Here, a path is chosen for data routing that depends on some points that are computed based on a node's speed, direction and pause time. A trust module generates a threshold value to compare these points, which are known as the mobility_factor of a mobile node. Mobility_factor is used for selecting nodes to establish a path between source and destination nodes. They have carried out simulations of dynamic source routing (DSR) and ad hoc on-demand distance vector (AODV) routing protocols using random Waypoint and Levy Walk mobility models with and without their proposed technique. Through simulation results we have shown that when used with our proposed mobility aware route selection technique, both of the protocols perform much better than the basic AODV and DSR. Also, the proposed protocols outperform the existing routing protocols, mobility aware routing protocol as well as mobility and load routing.

Next generation marine data networks in an IoT environment

Abstract: Packet data networks at sea offer the potential for increased safety, connectivity and meteorological data acquisition. Existing solutions including satellite communication are expensive and prohibitive to most small vessels. In this paper, an Internet of Things (IoT) application is proposed as a marine data acquisition and cartography system over Ship Ad-hoc Networks (SANET). Ships are proposed to communicate over Very High Frequency (VHF) which is already available on the majority of ships and are equipped with several sensors such as sea depth, temperature, wind speed and direction, etc. On shore, 5G base station nodes represent sinks for the collected data and are equipped with Mobile Edge Computing (MEC) capabilities for data aggregation and processing. The sensory data is ultimately aggregated at a central cloud on the internet to produce public up to date cartography systems. We discuss the deployment limitations and benefits of the proposed system and investigate it's performance using four different MANET routing protocols which are Ad hoc On-Demand Distance Vector (AODV), Ad hoc On-Demand Multipath Distance Vector (AOMDV), Destination-Sequenced Distance Vector (DSDV) and Dynamic Source Routing (DSR) protocols. Simulation results illustrate the efficiency of the proposed system with packet delivery rates of up to 60 percent at shore base stations.

Uncertainty analysis framework for trust based routing in MANET

Abstract: MANET (Mobile Ad hoc Network) has distinctive characteristics like node mobility, broadcast nature of wireless communication, and peer to peer data transfer. Due to these characteristics uncertainty is an integral part of MANET behavior. Uncertainty quantification is important for performance evaluation and better decision making in MANET. Packet dropping is a serious issue in MANET which degrades the performance of the network to a great extent. The packet dropping attack increases uncertainty in the network communication and eventually of the MANET. Trust based routing mechanisms are useful for neutralizing packet dropping attack. There are many existing trust based routing protocols which uses uncertainty for precise trust calculations. Thus, trust and uncertainty are closely related to each other. The paper proposes Uncertainty Analysis Framework (UAF) for MANET, it calculates the network Belief, Disbelief, and Uncertainty (BDU) values. The UAF framework integrated into different trust variants of AODV protocol which use direct trust, indirect trust, and global trust. The research work discovers impact of different trust models on MANET BDU using various mobility models. Experimental analysis shows that, trust based routing protocols show average 3 % gain in packet delivery ratio and at least 5 % increase in the network belief.

An adaptive density-based routing protocol for flying Ad Hoc networks

Abstract: An Adaptive Density-based Routing Protocol (ADRP) for Flying Ad Hoc Networks (FANETs) is proposed in this paper. The main objective is to calculate forwarding probability adaptively in order to increase the efficiency of forwarding in FANETs. ADRP dynamically fine-tunes the rebroadcasting probability of a node for routing request packets according to the number of neighbour nodes. Indeed, it is more interesting to privilege the retransmission by nodes with little neighbour nodes. We describe the protocol, implement it and evaluate its performance using NS-2 network simulator. Simulation results reveal that ADRP achieves better performance in terms of the packet delivery fraction, average end-to-end delay, normalized routing load, normalized MAC load and throughput, which is respectively compared with AODV.

Design and performance analysis of high reliability-optimal routing protocol for mobile wireless multimedia sensor networks

Abstract: Designing of Wireless Multimedia Sensor Network (WMSN) routing protocols limited by conventional sensor network protocols. They have been designed for scalar data such as sensor data; which is small in size compared to multimedia data. The addressed challenges were the motivation to design mobile reliable routing protocol based on greedy routing structure. In this paper, we propose a new routing protocol for greedy forwarding based on throughput energy aware multi-path routing protocol(GFTEM), which is based on selection of next hop node that has the highest throughput and closer to destination node. GFTEM performance is seen and compared against Ad hoc on-demand distance vector routing protocol (AODV), Dynamic MANET on-demand routing protocol(DYMO) and greedy perimeter stateless routing for wireless networks (GPSR). The OMNET++ simulator has been used to study the behavior of the protocols in terms of end-to-end delay, packet error rate and residual energy. The protocols has been tested under various sensor node speed and the simulations demonstrate that GFTEM has better end-to-end delay, packet loss ratio, with good energy efficiency compared to GPSR, AODV, DYMO routing protocols.

Securing AOMDV protocol in mobile adhoc network with elliptic curve cryptography

Abstract: Mobile Adhoc Network (MANET) is comprised of mobile nodes where each mobile node acts as both router and terminal. While acting as a router a reliable routing protocol is chosen ensuring the packet to reach its destination and an agent is responsible for the transmission of packet while acting as a terminal. In this paper, we implemented secure packet transmission in mobile adhoc network (MANET) through Adhoc On Demand Multipath Distance Vector (AOMDV) routing protocol. AOMDV, a multipath extension of AODV (Adhoc On Demand Distance Vector) routing protocol, is more reliable than its parent protocol, though not completely restraint from attacks. To keep the packets secure in an adversary environment with multiple attackers is the main objective. Elliptic Curve Cryptography (ECC) has been chosen to secure the packets against blackhole attack. Elliptic Curve Cryptography provides security with smaller key size compared to other public-key encryption. We configured three different types of environment using NS-2.35 which is a discrete event network simulator; a secure environment without malicious activity, a hostile environment with blackhole attackers and with ECC implementation by the agent and analyzed their performance.

Neural networks for MANET AODV: an optimization approach

Abstract: To find a route with good stability and less cost is a hot issue because of MANET's mobility. AODV is one of the most widely used routing protocols in MANET because of its wide application, good performance and expansion. However, AODV is only an optional route instead of an optimized one. In this paper, continuous Hopfield Neural Networks is used to optimize the route to seek an optimal or nearly-optimal route, which can improve the usability and survivability of MANET. The simulation results show that CHNN-AODV is more effective and advantageous than AODV in the measurement of packet receiving rate, end-to-end average delay and routing recovery frequency.

Design and performance analysis of mobile Ad hoc network with reactive routing protocols

Abstract: A Mobile Ad Hoc Network (MANET) is a group of several wireless mobile nodes, that communicate with each other without requiring any pre-existing infrastructure, forming an arbitrary topology and there is no centralized administration present. In wireless MANET, each mobile node can act as a receiver and a router and they are free to move randomly. Because of the dynamic topology of the MANETs, routing is one of the crucial issues in these network structures. Routing protocols help in setting up communication between mobile nodes and they also affect the performance of the network. A variety of routing protocols have been designed for MANET. This paper shows design and performance analysis of Mobile Ad hoc Networks, using the reactive routing protocols like AODV which is Ad hoc On-demand Distance Vector and AOMDV which is Ad hoc On-demand Multipath Distance Vector. The simulation is performed using the network simulation software NS2.

Wormhole Attack Detection Technique in Mobile Ad Hoc Networks

Abstract: A wormhole attack is harmful attack against routing protocols in ad hoc network where node attracts packets from one location and retransmits them to other location using long range link within the network. A wormhole attack can be easily launched between two attacker nodes without compromising the mobile nodes. Most of routing protocols don't have any defending technique against wormhole activities; so in the presence of attacker nodes malicious activities may occur and disrupt network communication by tamper the data or forward the message to unknown location of the network to disrupt it functionality. Several routing protocols have been proposed to defend against wormhole attack in mobile ad hoc networks by adapting synchronization clocks, GPS or any special hardware. In this research article, we proposed a novel wormhole detection technique which identifies the wormhole link by calculating the maximum end to end delay between two nodes within the communication range. Mobile nodes do not need to be equipped with GPS, clock synchronized or any other type of special hardware. The simulation results prove that proposed scheme detects wormhole attack.