97 research outputs found
Secure Routing Environment with Enhancing QoS in Mobile Ad-Hoc Networks
A mobile adhoc network is infrastructure-free and self configured network connected without wire. As it is infrastructure-free and no centralized control, such type of network are suitable only for conditional inter communication link. So initially maintaining Quality of Service and security aware routing is a difficult task. The main purpose of QoS aware routing is to find an optimal secure route from source to destination which will satisfy two or more QoS constrain. In this paper, we propose a net based multicasting routing scheme to discovery all possible secure path using Secure closest spot trust certification protocol (SCSTC) and the optimal link path is derived from Dolphin Echolocation algorithm (DEA). The numerical result and performance analysis clearly describe that our provided proposal routing protocol generates better packet delivery ratio, decreases packet delay reduces overhead in secured environment
Simulation based comparison of routing protocols in wireless multihop adhoc networks
Routing protocols are responsible for providing reliable communication between the source and destination nodes. The performance of these protocols in the ad hoc network family is influenced by several factors such as mobility model, traffic load, transmission range, and the number of mobile nodes which represents a great issue. Several simulation studies have explored routing protocol with performance parameters, but few relate to various protocols concerning routing and Quality of Service (QoS) metrics. This paper presents a simulation-based comparison of proactive, reactive, and multipath routing protocols in mobile ad hoc networks (MANETs). Specifically, the performance of AODV, DSDV, and AOMDV protocols are evaluated and analyzed in the presence of varying the number of mobile nodes, pause time, and traffic connection numbers. Moreover, Routing and QoS performance metrics such as normalized routing load, routing packet, packet delivery ratio, packet drop, end-to-end delay, and throughput are measured to conduct a performance comparison between three routing protocols. Simulation results indicate that AODV outperforms the DSDV and AOMDV protocols in most of the metrics. AOMDV is better than DSDV in terms of end-to-end delay. DSDV provides lower throughput performance results. Network topology parameters have a slight impact on AODV Performance
An Optimised and Efficient Routing Protocol Application for IoV: A Review
Mobile ad hoc network (MANET) is a wireless network without a centralised administrator, where each node acts as a router forwarding data packets to other nodes. The study compares the performance of three routing protocols (AODV, OLSR, and DSDV) using the NS2 simulator under various mobility models. The proposed work introduces a modified protocol, MAODV, which combines the features of AODV protocols to optimise energy consumption, minimise transmissions, and find an optimum path for data transmission. The proposed method is compared with the standard AODV protocol. It shows better average throughput and packet delivery ratio results in a vehicular ad hoc network (VANET) scenario
Securing routing protocols in mobile ad hoc networks
A Mobile Ad Hoc Network (MANET) is more prone to security threats than other
wired and wireless networks because of the distributed nature of the network.
Conventional MANET routing protocols assume that all nodes cooperate without
maliciously disrupting the operation of the protocol and do not provide defence
against attackers. Blackhole and flooding attacks have a dramatic negative impact
while grayhole and selfish attacks have a little negative impact on the performance
of MANET routing protocols.
Malicious nodes or misbehaviour actions detection in the network is an important
task to maintain the proper routing protocol operation. Current solutions
cannot guarantee the true classification of nodes because the cooperative nature
of the MANETs which leads to false exclusions of innocent nodes and/or good
classification of malicious nodes. The thesis introduces a new concept of Self-
Protocol Trustiness (SPT) to discover malicious nodes with a very high trustiness
ratio of a node classification. Designing and implementing new mechanisms that
can resist flooding and blackhole attacks which have high negative impacts on
the performance of these reactive protocols is the main objective of the thesis.
The design of these mechanisms is based on SPT concept to ensure the high
trustiness ratio of node classification. In addition, they neither incorporate the
use of cryptographic algorithms nor depend on routing packet formats which make
these solutions robust and reliable, and simplify their implementations in different
MANET reactive protocols.
Anti-Flooding (AF) mechanism is designed to resist flooding attacks which relies
on locally applied timers and thresholds to classify nodes as malicious. Although
AF mechanism succeeded in discovering malicious nodes within a small time, it
has a number of thresholds that enable attacker to subvert the algorithm and
cannot guarantee that the excluded nodes are genuine malicious nodes which was
the motivation to develop this algorithm. On the other hand, Flooding Attack
Resisting Mechanism (FARM) is designed to close the security gaps and overcome
the drawbacks of AF mechanism. It succeeded in detecting and excluding more
than 80% of flooding nodes within the simulation time with a very high trustiness
ratio.
Anti-Blackhole (AB) mechanism is designed to resist blackhole attacks and relies
on a single threshold. The algorithm guarantees 100% exclusion of blackhole nodes
and does not exclude any innocent node that may forward a reply packet. Although
AB mechanism succeeded in discovering malicious nodes within a small time, the
only suggested threshold enables an attacker to subvert the algorithm which was
the motivation to develop it. On the other hand, Blackhole Resisting Mechanism
(BRM) has the main advantages of AB mechanism while it is designed to close
the security gaps and overcome the drawbacks of AB mechanism. It succeeded in
detecting and excluding the vast majority of blackhole nodes within the simulation
time
The Modified Secure AODV Routing Protocol for Black Hole Attack in Manet
Mobile Adhoc Network is gathering of portable nodes which are actively structuring a momentary network without utilizing any pre accessible network infrastructure or central management. Each node in MANET not only provides as a specific terminal but also performs as a router to form a route. While a source node plans to send data to an intended node, packets are moved from the middle nodes. An Adhoc routing protocol is a classical method that supervises how nodes opt any route and in which manner they have to route packets among computing devices in a MANET. Because of different factors with lack of infrastructure, deficiency of already established trust relationship among the various nodes and dynamic topology, the MANET routing protocols are weak to different routing attacks. In contrast to conventional wired networks, such type attacks are executed simply in MANET because of the unsupervised entrance to the wireless medium. The malicious exploitation of various routing information results in the diffusion of wrong routing information which could eventually guide to network failure. One of these attacks in the existing wireless routing protocol like Ad-hoc on demand Distance Vector (AODV) Routing protocol is the Black Hole Attack against network truthfulness. In this attack, the data packets doesn’t arrive at the destination node, thus data loss happens. There is number of detection and protection methods to reduce the intruder that achieve the black hole attack. Therefore, this paper proposes Modified Secure AODV routing protocols (MSAODV) found on threshold evaluation and cryptographic verification. In this paper, the black hole attack and the proposed MSAODV protocols are simulated in the Network Simulator NS-2 under different MANET circumstances and their performances are evaluated on various parameters like Packet drop ratio, routing overload, throughput etc. Keywords: AODV, Black hole, gray hole, worm hole attack, MANET, AOMD
Predicting and Recovering Link Failure Localization Using Competitive Swarm Optimization for DSR Protocol in MANET
Portable impromptu organization is a self-putting together, major construction-less, independent remote versatile hub that exists without even a trace of a determined base station or government association. MANET requires no extraordinary foundation as the organization is unique. Multicasting is an urgent issue in correspondence organizations. Multicast is one of the effective methods in MANET. In multicasting, information parcels from one hub are communicated to a bunch of recipient hubs all at once, at a similar time. In this research work, Failure Node Detection and Efficient Node Localization in a MANET situation are proposed. Localization in MANET is a main area that attracts significant research interest. Localization is a method to determine the nodes’ location in the communication network. A novel routing algorithm, which is used for Predicting and Recovering Link Failure Localization using a Genetic Algorithm with Competitive Swarm Optimization (PRLFL-GACSO) Algorithm is proposed in this study to calculate and recover link failure in MANET. The process of link failure detection is accomplished using mathematical modelling of the genetic algorithm and the routing is attained using the Competitive Swarm optimization technique. The result proposed MANET method makes use of the CSO algorithm, which facilitates a well-organized packet transfer from the source node to the destination node and enhances DSR routing performance. Based on node movement, link value, and endwise delay, the optimal route is found. The main benefit of the PRLFL-GACSO Algorithm is it achieves multiple optimal solutions over global information. Further, premature convergence is avoided using Competitive Swarm Optimization (CSO). The suggested work is measured based on the Ns simulator. The presentation metrix are PDR, endwise delay, power consumption, hit ratio, etc. The presentation of the proposed method is almost 4% and 5% greater than the present TEA-MDRP, RSTA-AOMDV, and RMQS-ua methods. After, the suggested method attains greater performance for detecting and recovering link failure. In future work, the hybrid multiway routing protocols are presented to provide link failure and route breakages and liability tolerance at the time of node failure, and it also increases the worth of service aspects, respectively
- …