scholarly journals Traffic Rerouting Strategy against Jamming Attacks in WSNs for Microgrid

2012 ◽  
Vol 8 (4) ◽  
pp. 234029 ◽  
Author(s):  
Yujin Lim ◽  
Hak-Man Kim ◽  
Tetsuo Kinoshita
Keyword(s):  
Performance Comparison ◽  
Level Of Service ◽  
Delivery Ratio ◽  
Traffic Flows ◽  
Jamming Attacks ◽  
Jamming Attack ◽  
End To End Delay ◽  
Multiple Paths ◽  
Service Degradation ◽  
Conventional Scheme

In a microgrid as an energy infrastructure, the vulnerability against jamming attacks is fatal. Thus, the ability to deal with jamming attacks and maintain an acceptable level of service degradation in presence of the attacks is needed. To solve the problem, we propose a traffic rerouting scheme in wireless communication infrastructure for islanded microgrid. We determine disjoint multiple paths as candidates of a detour path and then select the detour path among the candidates in order to reduce the effect of jamming attack and distribute traffic flows on different detour paths. Through performance comparison, we show that our scheme outperforms a conventional scheme in terms of packet delivery ratio and end-to-end delay.

Research of Ad Hoc Network Routing Based on NS2 by Performance Comparison

2014 ◽  
Vol 989-994 ◽  
pp. 4633-4636
Author(s):  
Xiao Long Tan ◽  
Jia Zhou ◽  
Wen Bin Wang
Keyword(s):  
Routing Protocols ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Network Routing ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
Routing Overhead ◽  
Packet Delivery ◽  
End To End Delay ◽  
Ns2 Simulation

In recent years,the ad hoc network has been paid extensive attention due to its characteristics of non-center and self-organization.Firstly this paper introduces three typical routing protocols AODV,DSDV,DSR,and the principles of them; then,adopts the NS2 simulation platform to simulate the performance of end-to-end delay,routing overhead and packet delivery ratio by changing the number of nodes and the paused time of nodes.Finally,by comparing the simulating results, the comparison conclusion is provided.

scholarly journals Performance Comparison of IACO,AODV Networking Routing Protocols

2011 ◽  
pp. 33-37
Author(s):  
Miss Shweta Mod ◽  
Mr. Jitendra Prithvira
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Routing Protocols ◽  
Ad Hoc ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
End To End Delay ◽  
Distance Vector ◽  
Mobile Ad Hoc ◽  
Hoc Networks

There are several standard protocols for Mobile Ad hoc Networks (MANET) that have been developed for devices with higher computing features. The Efficient routing protocols can provide significant benefits to mobile ad hoc networks, in terms of both performance and reliability. Many routing protocols for such networks have been proposed so far. Amongst the most popular ones are Ad hoc On-demand Distance Vector (AODV), Improved Ant Colony Optimization (IACO). In this paper we present our observations regarding the performance comparison of the above protocols in mobile ad hoc networks (MANETs). We perform extensive simulations, using NS-2 simulator. The Average end-to-end delay and the Packet Delivery Ratio have been considered as the two performance parameters

Jamming Attacks and Countermeasures in Wireless Sensor Networks

2010 ◽  
pp. 334-352 ◽  
Author(s):  
Sun Yan-qiang ◽  
Wang Xiao-dong
Keyword(s):  
Sensor Networks ◽  
Signal To Noise Ratio ◽  
Denial Of Service ◽  
Future Research ◽  
Delivery Ratio ◽  
Jamming Attacks ◽  
Jamming Attack ◽  
Timing Channel ◽  
Wireless Medium ◽  
Radio Signals

Guaranteeing security of the sensor network is a challenging job due to the open wireless medium and energy constrained hardware. Jamming style Denial-of-Service attacks is the transmission of radio signals that disrupt communications by decreasing the signal to noise ratio. These attacks can easily be launched by jammer through, either bypassing MAC-layer protocols or emitting a radio signal targeted at blocking a particular channel. In this chapter, we survey different jamming attack models and metrics, and figure out the difficulty of detecting and defending such attacks. We also illustrate the existed detecting strategies involving signal strength and packet delivery ratio and defending mechanisms such as channel surfing, mapping jammed region, and timing channel. After that, we explore methods to localize a jammer, and propose an algorithm Geometric-Covering based Localization. Later, we discuss the future research issues in jamming sensor networks and corresponding countermeasures.

scholarly journals Simulation based comparison of routing protocols in wireless multihop adhoc networks

2021 ◽  
Vol 11 (4) ◽  
pp. 3186
Author(s):  
Ali H. Wheeb ◽  
Marwa T. Naser
Keyword(s):  
Routing Protocols ◽  
Ad Hoc ◽  
Performance Metrics ◽  
Performance Comparison ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
End To End Delay ◽  
Simulation Based ◽  
End To End

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.

Catechize Global Optimization through Leading Edge Firefly Based Zone Routing Protocol

2020 ◽  
Vol 13 (2) ◽  
pp. 147-157 ◽  
Author(s):  
Neha Sharma ◽  
Sherin Zafar ◽  
Usha Batra
Keyword(s):  
Global Optimization ◽  
Routing Protocol ◽  
Firefly Algorithm ◽  
Leading Edge ◽  
Packet Delivery Ratio ◽  
Delivery Ratio ◽  
Packet Delivery ◽  
Zone Routing Protocol ◽  
End To End Delay ◽  
End To End

Background: Zone Routing Protocol is evolving as an efficient hybrid routing protocol with an extremely high potentiality owing to the integration of two radically different schemes, proactive and reactive in such a way that a balance between control overhead and latency is achieved. Its performance is impacted by various network conditions such as zone radius, network size, mobility, etc. Objective: The research work described in this paper focuses on improving the performance of zone routing protocol by reducing the amount of reactive traffic which is primarily responsible for degraded network performance in case of large networks. The usage of route aggregation approach helps in reducing the routing overhead and also help achieve performance optimization. Methods: The performance of proposed protocol is assessed under varying node size and mobility. Further applied is the firefly algorithm which aims to achieve global optimization that is quite difficult to achieve due to non-linearity of functions and multimodality of algorithms. For performance evaluation a set of benchmark functions are being adopted like, packet delivery ratio and end-to-end delay to validate the proposed approach. Results: Simulation results depict better performance of leading edge firefly algorithm when compared to zone routing protocol and route aggregation based zone routing protocol. The proposed leading edge FRA-ZRP approach shows major improvement between ZRP and FRA-ZRP in Packet Delivery Ratio. FRA-ZRP outperforms traditional ZRP and RA-ZRP even in terms of End to End Delay by reducing the delay and gaining a substantial QOS improvement. Conclusion: The achievement of proposed approach can be credited to the formation on zone head and attainment of route from the head hence reduced queuing of data packets due to control packets, by adopting FRA-ZRP approach. The routing optimized zone routing protocol using Route aggregation approach and FRA augments the QoS, which is the most crucial parameter for routing performance enhancement of MANET.

scholarly journals An Effective and Efficient Adaptive Probability Data Dissemination Protocol in VANET

Data ◽  
2018 ◽  
Vol 4 (1) ◽  
pp. 1 ◽  
Author(s):  
John Sospeter ◽  
Di Wu ◽  
Saajid Hussain ◽  
Tesfanesh Tesfa
Keyword(s):  
Data Dissemination ◽  
Probabilistic Approach ◽  
Mobile Network ◽  
Delivery Ratio ◽  
Network Resources ◽  
Network Resource ◽  
V2v Communication ◽  
End To End Delay ◽  
End To End ◽  
Road Segments

Mobile network topology changes dynamically over time because of the high velocity of vehicles. Therefore, the concept of the data dissemination scheme in a VANET environment has become an issue of debate for many research scientists. The main purpose of VANET is to ensure passenger safety application by considering the critical emergency message. The design of the message dissemination protocol should take into consideration effective data dissemination to provide a high packet data ratio and low end-to-end delay by using network resources at a minimal level. In this paper, an effective and efficient adaptive probability data dissemination protocol (EEAPD) is proposed. EEAPD comprises a delay scheme and probabilistic approach. The redundancy ratio (r) metric is used to explain the correlation between road segments and vehicles’ density in rebroadcast probability decisions. The uniqueness of the EEAPD protocol comes from taking into account the number of road segments to decide which nodes are suitable for rebroadcasting the emergency message. The last road segment is considered in the transmission range because of the probability of it having small vehicle density. From simulation results, the proposed protocol provides a better high-packet delivery ratio and low-packet drop ratio by providing better use of the network resource within low end-to-end delay. This protocol is designed for only V2V communication by considering a beaconless strategy. the simulations in this study were conducted using Ns-3.26 and traffic simulator called “SUMO”.

scholarly journals Analisis Kinerja GPSR dan AODV pada VANET dengan Skema Pengimbangan Beban Trafik

2018 ◽  
Vol 6 (2) ◽  
pp. 207
Author(s):  
RENDI DIAN PRASETIA ◽  
DOAN PERDANA ◽  
RIDHA MULDINA NEGARA
Keyword(s):  
Load Balancing ◽  
Routing Protocol ◽  
Mean Value ◽  
Packet Delivery Ratio ◽  
Traffic Load ◽  
Delivery Ratio ◽  
Vehicle Traffic ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End

ABSTRAKSalah satu permasalahan di kota-kota besar adalah kemacetan lalu lintas yang disebabkan karena tidak mencukupinya ruas jalan, volume kendaraan yang begitu besar, persebaran kendaraan yang tidak merata dan lain-lain. Salah satu solusinya adalah para pengendara dapat menggunakan aplikasi peta digital pada smartphone-nya. Oleh karena itu perlu dilakukan pengimbangan beban trafik kendaraan. Pada penelitian ini akan dibahas mengenai kinerja VANET yang menggunakan protokol routing GPSR dan AODV dengan skema pengimbangan beban trafik kendaraan dengan pengaruh kepadatan node. Perancangan sistem simulasi terbagi menjadi dua subsistem yaitu subsistem mobilitas dan jaringan. Kemudian dilakukan pengimbangan beban trafik kendaraan, dan kinerja VANET akan diamati. Performansi dievaluasi dengan average end to end delay, throughput, dan packet delivery ratio. Nilai rata-rata throughput, PDR, delay untuk GPSR adalah 142.21 Kbps, 87.47 %, dan 82.83 ms. Sedangkan AODV adalah 119.81 Kbps, 86.67 %, dan 103.21 ms. Dari hasil penelitian nilai QoS performansi dari routing protocol GPSR lebih baik dari pada AODV pada VANET.Kata kunci: Vanet, Pengimbangan Beban, GPSR, AODV.ABSTRACTOne of the problems in big cities is congestion. The congestion is caused byinsufficient road segment, large volume of vehicles, unbalanced spread ofvehicles and others. One solution is that riders can use digital map applications on their smartphones. Therefore it is necessary to balancing the traffic load of vehicles. In this research will be discussed about VANET performance using GPSR and AODV routing protocol with vehicle traffic load balancing scheme with node density influence. The design of the simulation system is divided into two subsystems namely mobility and network subsystem. Then balancing the vehicle traffic load, and VANET performance will be observed. Performance is evaluated with the average end to end delay, throughput, and packet delivery ratio. The mean value of throughput, PDR, delay for GPSR respectively 142.21 Kbps, 87.47%, and 82.83 ms. While AODV is 119.81 Kbps, 86.67%, and 103.21 ms. From the simulation results can be concluded that the performance of GPSR is better than AODV on VANET. Keywords: Vanet, Load Balancing, GPSR, AODV.

scholarly journals PERFORMANCE COMPARISON WITH ACCESSIBILITY PREDICTION AND LINK BREAKAGE PREDICTION IN MANETS

2015 ◽  
pp. 48-54
Author(s):  
TEJAL ARVIND SONAWALE ◽  
SHIKHA NEMA
Keyword(s):  
Ad Hoc ◽  
Power Level ◽  
Performance Comparison ◽  
Delivery Ratio ◽  
Route Discovery ◽  
Network Resources ◽  
Average Delay ◽  
Network Bandwidth ◽  
Multiple Routes ◽  
Hoc Networks

Ad Hoc Networks face a lot of problems due to issues like mobility, power level, load of the network, bandwidth constraints, dynamic topology which lead to link breaks, node break down and increase in overhead. As nodes are changing their position consistently, routes are rapidly being disturbed, thereby generating route errors and new route discoveries. The need for mobility awareness is widely proclaimed. In our dissertation we present a scheme AOMDV-APLP that makes AOMDV aware of accessibility of neighbor nodes in the network. Nodes acquire the accessibility information of other nodes through routine routing operations and keep in their routing table. Based on this information route discovery is restricted to only “accessible” and “start” nodes. Further route with the strongest signal strength is selected from multiple routes using Link life value predicted by Link Breakage prediction technique. Simulation result shows that using accessibility and link life knowledge in route discovery process MAC overhead, routing overhead and average delay is reduced 3 times, and improve the Packet delivery ratio to a large extent than standard AOMDV which reflects effective use of network resources.

Secure Buffer-Based Routing Protocol for WMN

2017 ◽  
Vol 13 (1) ◽  
pp. 28-44
Author(s):  
Geetanjali Rathee ◽  
Hemraj Saini
Keyword(s):  
Routing Protocol ◽  
Performance Metrics ◽  
Packet Delivery Ratio ◽  
Secure Routing ◽  
Delivery Ratio ◽  
Link Failure ◽  
Packet Delivery ◽  
End To End Delay ◽  
End To End ◽  
Network Metrics

Secure routing is considered as one of a key challenge in mesh networks because of its dynamic and broadcasting nature. The broadcasting nature of mesh environment invites number of security vulnerabilities to come and affect the network metrics drastically. Further, any node/link failure of a routed path may reduce the performance of the entire network. A number of secure routing protocols have been proposed by different researchers but enhancement of a single network parameter (i.e. security) may affect another performance metrics significantly i.e. throughput, end to end delay, packet delivery ratio etc. In order to ensure secure routing with improved network metrics, a Secure Buffer based Routing Protocol i.e. SBRP is proposed which ensures better network performance with increased level of security. SBRP protocol uses buffers at alternate positions to fasten re-routing mechanism during node/link failure and ensures the security using AES encryption. Further the protocol is analyzed against mAODV protocol in both static and dynamic environment in terms of security, packet delivery ratio, end to end delay and network throughput.

scholarly journals Efficient Heuristic Based on Clustering Approach for OLSR

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Ali Choukri ◽  
Ahmed Habbani ◽  
Mohamed El Koutbi
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Delivery Ratio ◽  
Dynamic Nature ◽  
End To End Delay ◽  
Delay Control ◽  
Clustering Approach ◽  
Mobile Ad Hoc

Due to the dynamic nature of mobile ad hoc network (MANET), the quality of service (QoS) requires several improvements. The present papercomeswithin the framework of research to optimize QoS in MANET. In this paper, we propose a novel version of OLSR based on the clustering approach which is inspired from Lin and Chu heuristic and adapted to beimplemented inOLSR. We studied its stability and we compared its performances to those of standard OLSR. The metrics we used in evaluating network performances were average end-to-end delay, control routing overhead, and packet delivery ratio. Experimental results show that our alternative significantly reduces the traffic reserved to monitoring the network, which positively influences other performances such as throughput, delay, and loss.

Sign in / Sign up

Export Citation Format

Share Document