一种低运算量Ad-hoc网络匿名路由协议  

Low Computational Load Anonymous Routing Protocol for Ad-hoc Networks

作　　者：刘方斌[1] 张琨[1] 张宏[1] 

机构地区：[1]南京理工大学计算机学院,南京210094

出　　处：《计算机科学》2011年第11期48-53,共6页Computer Science

基　　金：国家自然科学基金(90718021;61003210);江苏省自然科学基金(SBK201022379)资助

摘　　要：Ad-hoc网络节点运算能力差,能量有限且移动速度高,而公钥运算量大,能耗高,运算周期长,所以公钥运算不适合于Ad-hoc网络。已提出的匿名路由协议却含有大量的公钥运算。为了降低公钥运算量,将双线性对和零知识证明应用于匿名路由协议中,提出一种新的匿名路由协议——低运算量的Ad-hoc网络匿名路由协议,该协议大幅降低了公钥运算量。实验结果表明,该协议建立匿名路由所消耗的能量少,时延低。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 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 efficiency and end-end delay.

关 键 词：双线性对 零知识证明 低能耗 低时延 匿名路由 AD-HOC网络 

分 类 号：TN918[电子电信—通信与信息系统]