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 publie 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 protocol一一an low computational load anonymous routing protocol for Ad-hoc networks(LCAR)，which reduces public key encryptions heavily. Our analysis and simulation study verify that our protocol is much better than existing anonymous routing protocols on the aspects of energy efficicncy and end-end delay.

Key words: Bilinear pairing, Zero knowledge proofs, Energy efficiency, Low end-end delay, Anonymous routing, Ad-hoc networks