Integrated Key based Strict Friendliness Verification of Neighbors in MANET

Details Integrated Key based Strict Friendliness Verification of Neighbors in MANET Integrated Key based Strict Friendliness Verification of Neighbors in MANET

2012-03-16

arxiv.org/abs/1203.3597v1

Computer Science

Cryptography and Security

6 pages, 12 figures, 2011 International Conference on Security Science and Technology(ICSST 2011)

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Integrated Key based Strict Friendliness Verification of Neighbors in MANET does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Integrated Key based Strict Friendliness Verification of Neighbors in MANET, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Integrated Key based Strict Friendliness Verification of Neighbors in MANET will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-349047