Shapiro-Wilk Test to Detect The Routing Attacks In MANET

Abstract

In the last recent years, the number of wireless devices has been growing and the security challenges increases too. Mobile Ad hoc Network (MANET) considers as a part of wireless network that connects mobile devices by using wireless channels without infrastructure. MANET use specific protocols to ensure the connectivity and exchange data between the source and destination. Optimized Link State Routing Protocol (OLSR) is a table-driven protocol that keep the route to all destination at any times, unfortunately it can be affected by many active routing attacks that reduce its performance by dropping the exchange packets or stopping the forward of data. In this paper we present a new approach to detect any active routing attacks by using the concept of Shapiro-Wilk test. Our method of detection is easy to implement and does not require any modification in the standard version of OLSR routing protocol as we will demonstrate by NS-3 simulations the detection of Black hole, Worm hole and Node isolation attacks that consider as most known attacks in MANET. A real experience is done by creating a small ad hoc network that connect six wireless devices by using OLSR protocol and finally we detect the presence of an active routing attack by applying our proposed method.

Analysis of Application the Device with Non-standart Scanner Installation for Rail Condition Monitoring

“…Next, the correspondence of results distribution in the data groups to the normal probability law was determined. For this purpose, the graphical method and the Shapiro-Wilk test [20] were used as shown in Fig. 9.…”

Multi point relay set selection algorithm based on fruit fly-inspired optimizers

“…While maintaining the optimal scent concentration value and position x, the fruit fly population will utilize visual navigation to fly towards that location as bestSmell = Smellbest (4) and . bestindex) X(:, = X_axis (5) Step 7. Start the iterative optimization process and perform mutation, validation, crossover, and validation operations in sequential order in each iteration.…”

“…The simulated topology map is shown below: In Figure 3, according to the standard MPR selection steps described earlier, the selected MPR set is [2,4,6,7,8,10,12,13], with a length of 8. However, the actual optimal MPR set is [3,5,7,9,11,13], with a length of 6.…”

“…This design significantly reduces control message overhead, making OLSR perform well in large-scale and high-density mobile networks. However, due to the imperfect nature of the standard MPR algorithm, the consideration of energy, security and other factors was not taken into account [4][5][6]. Moreover, it may fail to find the optimal solution set in certain situations, resulting in a less-than-expected reduction in overhead [7].…”