Integrated Key Based Strict Friendly Verification of Neighbors in MANET

Abstract

A novel Strict Friendliness Verification (SFV) scheme based on the integrated key consisting of symmetric node identity, geographic location and round trip response time between the sender and the receiver radio in MANET is proposed. This key is dynamically updated for encryption and decryption of each packet to resolve Wormhole attack and Sybil attack. Additionally, it meets the minimal key lengths required for symmetric ciphers to provide adequate commercial security. Furthermore, the foe or unfriendly node detection is found significantly increasing with the lower number of symmetric IDs. This paper presents the simulation demonstrating the performance of SFV in terms of dynamic range using directional antenna on radios (or nodes), and the performance in terms of aggregate throughput, average end to end delay and packet delivered ratio.

Wireless Sensor Network Security Enhancement Using Directional Antennas: State of the Art and Research Challenges

“…Vaman and Shakhakarmi [ 51 ] proposed an integrated key (a type of cryptographic key that encloses a symmetric node’s ID, geographic location of the node and round trip response time)-based Strict Friendliness Verification (SFV) of neighboring nodes. As a result, a set of verifier nodes discover the Sybil nodes by dynamically changing the symmetric node’s ID every time a new wireless connection is established, and by encrypting/decrypting each packet by different integrated keys.…”

“…Another method that uses directional information gathered by trusted nodes to cope with wormhole attack is described in the case of MANETs [ 51 ], but can be also used in WSNs. The mechanism in based on symmetric node IDs, round trip response times and real time location information obtained by directional antennas.…”

Untitled

“…We assume that the background Position, Location and Tracking (PL&T) algorithm that determines the locations of all mobile nodes continuously and the Cluster Head (CH) keeps track of all the PL&Ts of nodes within each cluster [40,41]. Periodically, CH broadcasts the snapshots of all nodes and their PL&T within the cluster.…”

“…Once the zone is realized, the references that have good PL&Ts are used for determining the target node locations. These references are selected using the zone and maintaining proper geometry such that no angle is less than 30 degrees or greater than 150 degrees in the triangular formation of the references for two dimensional PL&T operation [40,41]. If the angles violate these rules, the accuracy of prediction of PL&T is compromised.…”

A Novel Routing Technique for Mobile Ad Hoc Networks (Manet)

“…Lowest ID Clustering Algorithm As we stated before, each node is assigned with a unique ID and it can be used to identify the malicious and friendly nodes in the network [41,42]. According to lowest ID clustering algorithm, each node broadcast their own ID within the cluster and each node receives other node's ID as well as it has its own node ID and it compare all the IDs from available list and select the node with minimum node ID (lowest ID) as a Cluster head for that cluster and other nodes works as cluster members [43].…”