Integrated Key based Strict Friendliness Verification of Neighbors in MANET

Integrated Key based Strict Friendliness Verification of Neighbors in   MANET
Notice: This research summary and analysis were automatically generated using AI technology. For absolute accuracy, please refer to the [Original Paper Viewer] below or the Original ArXiv Source.

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.


💡 Research Summary

**
The paper introduces a novel security mechanism called Strict Friendliness Verification (SFV) designed for Mobile Ad‑hoc Networks (MANETs) to counter two of the most damaging attacks in such environments: Wormhole attacks and Sybil attacks. The core idea is to generate a dynamic “integrated key” for every transmitted packet by combining three independent security attributes: (1) a symmetric node identifier that is randomly generated for each packet, (2) the current geographic coordinates of the communicating nodes, and (3) the measured round‑trip time (RTT) between sender and receiver. Each attribute contributes a distinct line of defense. The symmetric identifier prevents an adversary from pre‑creating multiple fake identities, thereby mitigating Sybil attacks. The geographic location provides a physical‑space verification; a Wormhole attack, which artificially links two distant points, will inevitably produce a location mismatch that can be detected instantly. RTT, being directly proportional to physical distance, serves as a complementary timing check that further validates the plausibility of the reported positions.

The integrated key is constructed by feeding the three attributes into a cryptographic hash function (e.g., SHA‑256) and then encrypting the result with a standard symmetric cipher such as AES‑128 or AES‑256. The key length meets the minimum recommended size for commercial security (≥128 bits), allowing the scheme to be deployed without any modification to existing encryption modules. Because the key is regenerated for each packet, any replay or reuse of a previously captured packet will fail the decryption test, and the packet is discarded as coming from an “unfriendly” node.

To evaluate the approach, the authors built a comprehensive simulation environment using NS‑3. The network consists of 50 to 200 mobile nodes moving according to a random‑walk mobility model. Each node is equipped with a directional antenna having a 120‑degree beamwidth, enabling the study of dynamic range adjustments. Two attack scenarios were modeled: (a) a Wormhole attack where two malicious nodes are linked by a high‑speed out‑of‑band channel, and (b) a Sybil attack where a single physical node generates multiple counterfeit IDs. The results show that SFV detects malicious nodes with a success rate exceeding 95 % in both scenarios. Normal traffic experiences a packet loss rate of less than 2 %, which is a 1.5‑fold improvement over conventional authentication‑based routing protocols such as SAODV. Moreover, when the directional antenna’s beam is narrowed (dynamic range control), the aggregate throughput rises by roughly 15 % and the average end‑to‑end delay drops by about 8 ms, demonstrating that the additional cryptographic processing does not impose a prohibitive overhead.

From a key‑management perspective, SFV eliminates the need for a Public Key Infrastructure (PKI) or pre‑distributed certificates. Nodes generate and exchange keys autonomously, and the short key‑renewal interval incurs negligible computational cost, making the scheme suitable for resource‑constrained devices. The authors acknowledge that the accuracy of location data and the precision of RTT measurements are critical; environments with GPS denial or severe multipath fading could degrade performance, and they suggest incorporating error‑correction or sensor‑fusion techniques in future work.

In summary, the paper demonstrates that an integrated key that fuses identity, spatial, and temporal information can simultaneously thwart Wormhole and Sybil attacks while preserving, or even enhancing, network performance. The authors propose further extensions such as combining SFV with beamforming antenna arrays and machine‑learning‑based anomaly detection to build a more robust, adaptive security framework for next‑generation MANET deployments.


Comments & Academic Discussion

Loading comments...

Leave a Comment