Modelling of Random Selfish Behavior Attack using Single Sided Laplacian Distribution and Performance Evaluation for High Security Communications in Mobile Ad-hoc Networks

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.

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.


Open Physics ◽  
2016 ◽  
Vol 14 (1) ◽  
pp. 498-507 ◽  
Author(s):  
Marjan Kuchaki Rafsanjani ◽  
Hamideh Fatemidokht ◽  
Valentina Emilia Balas

AbstractMobile ad hoc networks (MANETs) are a group of mobile nodes that are connected without using a fixed infrastructure. In these networks, nodes communicate with each other by forming a single-hop or multi-hop network. To design effective mobile ad hoc networks, it is important to evaluate the performance of multi-hop paths. In this paper, we present a mathematical model for a routing protocol under energy consumption and packet delivery ratio of multi-hop paths. In this model, we use geometric random graphs rather than random graphs. Our proposed model finds effective paths that minimize the energy consumption and maximizes the packet delivery ratio of the network. Validation of the mathematical model is performed through simulation.


2015 ◽  
Vol 2015 ◽  
pp. 1-18 ◽  
Author(s):  
Khalid A. Darabkh ◽  
Ola A. Alsukour

Due to its simplicity, efficiency, and robustness to mobility, the On-Demand Multicast Routing Protocol (ODMRP) becomes a standout amongst the most broadly utilized multicast routing protocols in mobile ad hoc networks (MANETs). However, the robustness of ODMRP comes at the expense of incurring a high control overhead to the network. The Enhanced ODMRP (EODMRP) proposed a dynamic refresh interval for the multicast mesh based on the network feedback on real disconnections experienced by the multicast network members. Veritably, EODMRP decreased the network control overhead at the cost of obtaining a low packet delivery ratio especially in high mobility conditions of the network. In this paper, two protocols, as improvements to both ODMRP and EODMRP, are proposed where the refresh interval is basically adapted based on the source moving speed and the number of disconnections reported by multicast members. Furthermore, we proposed an impressive local recovery to be employed in both protocols, which includes new setup and failure mechanisms that contribute effectively to boosting the performance of our proposed protocols. Since the majority of nodes in MANET rely on batteries, the main contribution of this research is to limit the amount of control information that is passed between nodes (i.e., reducing the control overhead over that in ODMRP) while maintaining a better packet delivery ratio than EODMRP.


Author(s):  
Osama H.S. Khader

In mobile ad hoc networks, routing protocols are becoming more complicated and problematic. Routing in mobile ad hoc networks is multi-hop because of the limited communication range of wireless radios. Since nodes in the network can move freely and randomly, an efficient routing protocol is needed in order for such networks to be able to perform well in such an environment. In this environment the routing strategy is applied such that it is flexible enough to handle large populations and mobility and be able to minimize the use of the battery. Also it should be designed to achieve maximum packet delivery ratio. Further more, the routing protocol must perform well in terms of fast convergence, low routing delay, and low control overhead traffic. In this paper an improved implementation of the Fisheye State Routing (FSR) protocols is presented, where a new selection routing criteria that utilizes a minimum number of hops is a selection metric. The results obtained from simulation indicate that the fewer number of hops used the better and more efficient the output for packet delivery ratio was generated.


2009 ◽  
pp. 2996-3011
Author(s):  
S. Shanmugavel ◽  
C. Gomathy

As mobile computing gains popularity, the need for ad hoc routing also continues to grow. In mobile ad hoc networks, the mobility of nodes and error prone nature of the wireless medium pose many challenges, including frequent route changes and packet losses. Such problems increase the packet delays and decrease the throughput. To meet with the dynamic queuing behaviour of Ad hoc networks, to provide QoS and hence to improve the performance, a scheduler can be used. This chapter presents a novel fuzzy based priority scheduler for mobile ad-hoc networks, to determine the priority of the packets. The performance of this scheduler is studied using GloMoSim and evaluated in terms of quantitative metrics such as packet delivery ratio, average end-to-end delay and throughput.


Sign in / Sign up

Export Citation Format

Share Document