Integrated Key based Strict Friendliness Verification of Neighbors in MANET
This addresses security vulnerabilities in MANETs for applications like military or emergency communications, but it appears incremental as it builds on existing verification methods with a new key-based approach.
The paper tackles security threats like Wormhole and Sybil attacks in Mobile Ad-hoc Networks (MANET) by proposing a Strict Friendliness Verification (SFV) scheme that uses an integrated key for dynamic packet encryption, resulting in improved foe node detection and performance metrics such as aggregate throughput and packet delivery ratio.
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.