|
计算机科学 2011
Low Computational Load Anonymous Routing Protocol for Ad-hoc Networks
|
Abstract:
Nodes in Ad-hoc networks are limited in energy,have poor computational ability and move fast,and public key encryptions have heavy computational load,consume a lot of energy and have long computational cycle time,so public key encryptions are adapted for the Ad-hoc networks.The proposed anonymous routing protocols have a lot of public key encryptions.To reduces public key encryptions,we applied bilinear pairing and Zero Knowledge Proofs into anonymous routing protocol,and proposed a new anonymous routing pr...