The design of lightweight secure AODV protocol based on game theory and cryptology

GCS-AODV (Game theory and Cryptology based Secure AODV), a lightweight secure AODV protocol based on game theory and cryptology is proposed. One-hop neighbor detection is integrated into route maintenance phase, without any communication overhead. Forward game and ring expanding search solve the scalability problem. Normandy game is utilized to select the secure route. Message authentication code (MAC) guarantees the integrity and non-reputation of game information in route request (RREQ) and route reply (RREP). To best of our knowledge, our paper used both cryptology and game theory together for the first time. The only computation intense operation in GCS-AODV is hash function. So GCS-AODV is lightweight both in communication and computation. The scalability and security of GCS-AODV are simulated by using JiST/SWANS. Simulation results show that GCS-AODV performs well when the network is dense and reduces packet loss ratio by 10% under black hole attack.