scholarly journals Secured Routing in Mobile Ad hoc Networks (MANETs)

Author(s):  
S. Maharaja ◽  
R. Jeyalakshmi ◽  
A.V. Sabarish Kanna ◽  
M. Deva Priya

A Mobile Adhoc Network (MANET) is prone to attacks. Adversaries take hold of the network, thus degrading their performance. Various attacks are prevalent in MANET, out of which Byzantine attack plays a vital role. A node or group of nodes present in the routing path between the source and the destination may be compromised due to Byzantine attack. In this paper, Cohen Kappa Reliability Coefficient based Mitigation (CKRCM) mechanism is proposed to deal with these attacks. The intermediate nodes are monitored by their neighbors for a timestamp. If the monitoring node does not receive an acknowledgment, then the nodes are perceived to be attacked. The trustworthiness of the nodes is built by computing the trusts and reliabilities of the nodes. It is seen that the proposed scheme outperforms the existing scheme in terms of Throughput, Packet Delivery Ratio (PDR) and Packet Loss Ratio (PLR).

Author(s):  
Vu Khanh Quy ◽  
Pham Minh Chuan ◽  
Le Anh Ngoc

Mobile ad-hoc networks (MANETs) is a set of mobile devices that can self-configuration, self-established parameters to transmission in-network. Although limited inability, MANETs have been applied in many domains to serve humanity in recent years, such as disaster recovery, forest fire, military, intelligent traffic, or IoT ecosystems. Because of the movement of network devices, the system performance is low. In order to MANETs could more contribution in the future of the Internet, the routing is a significant problem to enhance the performance of MANETs. In this work, we proposed a new delay-based protocol aim enhance the system performance, called performance routing protocol based on delay (PRPD). In order to analyze the efficiency of the proposed solution, we compared the proposed protocol with traditional protocols. Experiment results showed that the PRPD protocol improved packet delivery ratio, throughput, and delay compared to the traditional protocols.


2019 ◽  
Vol 2019 ◽  
pp. 1-17 ◽  
Author(s):  
Ngoc T. Luong ◽  
Tu T. Vo ◽  
Doan Hoang

Request route flooding attack is one of the main challenges in the security of Mobile Ad Hoc Networks (MANETs) as it is easy to initiate and difficult to prevent. A malicious node can launch an attack simply by sending an excessively high number of route request (RREQ) packets or useless data packets to nonexistent destinations. As a result, the network is rendered useless as all its resources are used up to serve this storm of RREQ packets and hence unable to perform its normal routing duty. Most existing research efforts on detecting such a flooding attack use the number of RREQs originated by a node per unit time as the threshold to classify an attacker. These algorithms work to some extent; however, they suffer high misdetection rate and reduce network performance. This paper proposes a new flooding attacks detection algorithm (FADA) for MANETs based on a machine learning approach. The algorithm relies on the route discovery history information of each node to capture similar characteristics and behaviors of nodes belonging to the same class to decide if a node is malicious. The paper also proposes a new flooding attacks prevention routing protocol (FAPRP) by extending the original AODV protocol and integrating FADA algorithm. The performance of the proposed solution is evaluated in terms of successful attack detection ratio, packet delivery ratio, and routing load both in normal and under RREQ attack scenarios using NS2 simulation. The simulation results show that the proposed FAPRP can detect over 99% of RREQ flooding attacks for all scenarios using route discovery frequency vector of sizes larger than 35 and performs better in terms of packet delivery ratio and routing load compared to existing solutions for RREQ flooding attacks.


Author(s):  
Hutaf Salah Al-Deen Natoureah ◽  
Huda Abd El-Raheem Karajeh ◽  
Alaa' Abd El-Aziz Abu Serhan

<p class="Abstract">Abstract—The process of finding a route between the transmitter and the receiver node in the Mobile Adhoc Networks (MANets) is a renewed issue that is becoming more and more interesting to the researchers as this type of networks  grow and expand. The dynamic nature of MANET and the limited capabilities of wireless nodes in terms of memory size and battery charge are the most important obstacles to the routing (path-finding) process between nodes. In this research, we introduced a new protocol based on the well-known DSR protocol to add a mechanism that controls the RREQ Flooding process, which aims to reach more stable (life-long) routes while reducing the overhead of routing process caused by link breakage between nodes and reduce the overhead of network flooding with RREQ messages with each attempt to find a path. In this proposed mechanism, a specific group is selected from within the devices adjacent to the transmitter to be sent RREQ so that these devices are selected based on the stability evaluation criterion. The stability criterion is calculated based on three weighted factors: the speed of the node, the out-degree value (the number of adjacent nodes), and the number of tracks stored in the device memory. The proportion of devices selected is automatically changed adaptively to ensure that the expected throughput of this network is achieved. The proposed protocol was tested using simulation where results showed that ASDSR proved an enhancement in route stability about (0.13), and a decrease in the number of deleted routes by (9%), while maintaining the expected packet delivery ratio of the original DSR by about (0.86).</p>


Author(s):  
Tarek S. Sobh

Aim:: This work evaluates existing secure ant colony protocols of MANETs such as ASHFIK, AAMRP, and MANHSI with each other. Here, each node in the proposed ad hoc network protocols is known with a trust value. Each trust value represents the corresponding security level and a node with a higher trust value is authorized to monitor and lead as a core node its neighboring nodes. Background:: Trusted critical MANET is a secure wireless network that is used in different critical applications. Military battlefields are an example of these applications that force on people a number of needed things including robustness and reliable performance within high mobility situations and constraints (e.g. hostile attacks, cost, and battery limits). Objectives:: In this work, the extremely important similarity between the features of critical MANETs and the core-based routing protocols that are based-on ant colonies. Methods:: The metrics used in this evaluation are the availability, reliability, packet delivery ratio, and total overheads, while the performance is serious and stubborn because of the mobility of node, senders' number, and size of a multicast group. Results:: The results of the simulation show that ASHFIK provides better availability, reliability, Packet Delivery Ratio (PDR), and lower total overheads. In addition, the results show that ASHFIK remains consistent performance with a different group size of the network. It means a trusted and scalable network of ant colony core-based routing protocols. Conclusion:: here are existing different mobile ad hoc networks based-on ant colonies. According to our comparative study and state-of-the-art, the ASHFIK protocol can be used as a good routing protocol for critical MANETs that are based-on ant colonies.


Author(s):  
Kirti A. Adoni ◽  
Anil S. Tavildar ◽  
Krishna K. Warhade

Background: The performance of Mobile Ad-hoc Networks get severely degraded due to various attacks including Selfish Behaviour attack. The detection of malicious nodes and avoidance of such nodes for data forwarding is important to enhance the MANET’s performance. Methods: A probabilistic model based on Single Sided Laplacian distribution for the random ON/OFF switching time of this attack is proposed. The model is used to make appropriate decisions regarding assignment of trust levels to suspicious nodes. The proposed protocol, based on this trust along with Confidence values of nodes, referred to as OLSRT-C protocol is used to select the optimum path for data forwarding. Simulations are carried out using Network Simulator NS2.35. Results: The random behavior of Selfish Behaviour attack is analyzed by considering all the possible random parameters. The random deployment of mobile nodes, number of malicious nodes, number of times the malicious nodes switch and timing instances at which these nodes change their states are considered. From the results, it is observed that, the OLSRTC protocol gives stable performance for Packet Delivery Ratio and Routing Overheads whereas for OLSR protocol, Packet Delivery Ratio gradually reduces and Routing Overheads increase, for percentage of malicious nodes increase from 10% to 50%. For OLSRT-C protocol, Average Energy Consumption per node increases marginally compared to OLSR protocol. Conclusion: The proposed OLSRT-C protocol successfully mitigates randomized Selfish Behaviour attack with marginal increase in the Average Energy Consumption per node. The Protocol Efficacy for OLSRT-C protocol is much higher compared to OLSR protocol.


2021 ◽  
Vol 10 (1) ◽  
pp. 434-440
Author(s):  
Hussein M. Haglan ◽  
Salama A. Mostafa ◽  
Noor Zuraidin Mohd Safar ◽  
Aida Mustapha ◽  
Mohd. Zainuri Saringatb ◽  
...  

Mobile Ad-hoc Networks (MANETs) are independent systems that can work without the requirement for unified controls, pre-setup to the paths/routes or advance communication structures. The nodes/hubs of a MANET are independently controlled, which permit them to behave unreservedly in a randomized way inside the MANET. The hubs can leave their MANET and join different MANETs whenever the need arises. These attributes, in any case, may contrarily influence the performance of the routing conventions (or protocols) and the general topology of the systems. Along these lines, MANETs include uniquely planned routing conventions that responsively as well as proactively carry out the routing. This paper assesses and looks at the effectiveness (or performance) of five directing conventions which are AOMDV, DSDV, AODV, DSR and OLSR in a MANET domain. The research incorporates executing a simulating environment to look at the operation of the routing conventions dependent on the variable number of hubs. Three evaluation indices are utilized: Throughput (TH), Packet Delivery Ratio (PDR), and End-to-End delay (E2E). The assessment outcomes indicate that the AODV beats other conventions in the majority of the simulated scenarios.


2021 ◽  
Author(s):  
Udayakumar Allimuthu ◽  
K Mahalakshmi

Abstract MANET (Mobile Ad-hoc Networks) are distributed or delegated away from a central server, authoritative location of wireless networks that communicate without pre-existing structure. Ad-hoc networks are compromising the many types of attacks and routing. In MANET, the routing plays a vital role in terms of packets interaction and data transmission. Due to decentralized control, the MANET data transmission becomes insecure because of dispersed routing on the mobile ad-hoc nodes. Since the efficient route on MANET only controls the packets and does not simplify the route between the source to the destination, the maintenance of route interaction becomes a crucial process. Maintain effective data transactions over the MANET network, and it is essential to improve the route and locate the attacker. Nevertheless, MANET allows for route interaction against security threads. In this research article, four processing schemes are suggested to preserve the security measures against routing protocols. Especially in node communication, the rushing attacker has a significant impact on packet-based data transmission in MANET. Also, for this research, an Attacker detection automation of the Bees Colony Optimization (ADABCP) method is used, as a result of which the desired result is brought about in the effective attacker detection on the routing process. Moreover, the proposed Hybrid Random Late Detection (HRLD) routing protocol manages the MANET routing and overcomes the MANET congestion communication. The Swift Implicit Response Round Trip Time (SIRT) mechanism is generated by the Route Finding Manipulation (RFM) to enhance the performance. This RFM scheme helps to find the optimal routing in a secured manner. The proposed (SIRT-ADABCP-HRLD) approach was compared to the existing ESCT, ZRDM-LFPM, and ENM-LAC approaches, found to have improved by routing and data transmission. Compared to the conventional method, the method mentioned above achieves a better ratio for the end-to-end delay, communication overhead, packet delivery ratio, network lifetime, and energy consumption.


Now a day’s mobile ad-hoc network (MANET) is engaged by numerous scientists and endeavoring to be conveyed by and by. To accomplish this objective, these two components are a significant issue that we need to consider. The first is "overhead". As it were, messages that is not important to be sent when setting up a system association between versatile hubs. The following issue is the parcel sending rate from source to the goal hub that sufficiently high to ensure a successful system association. This paper is concentrating on improving the exhibition of the Location-Aided Routing Protocol (LAR) regarding overhead decrease by adjusting the calculation of the MANET course disclosure process. The consequence of the reproduction shows that the proposed convention can decrease overhead definitely, growing system lifetime and increment parcel sending rate while contrasting and other traditional conventions.


Sign in / Sign up

Export Citation Format

Share Document