Performance Probability Analysis of Lightweight Identification Protocol

摘要

Lightweight cryptography is an efficient security mechanism for resource constraint devices. Cryptography is broadly classified into lightweight primitives and protocols. Lightweight protocols are further classified as identification, authentication, yoking, tag and ownership transfer etc. In this work tree based lightweight identification mechanism is proposed with probability analysis to protect the system from various attacks : mafia fraud attack and sybil attack. Performance analysis shows that Ad-hoc On demand Distance Vector (AODV) routing protocol outperforms Dynamic Source Routing (DSR) protocol for 50, 100 and 150 nodes. Percentage increase in throughput is more than 30% and decrease in delay is less than 40% for both protocols.