全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

Low Computational Load Anonymous Routing Protocol for Ad-hoc Networks
一种低运算量Ad-hoc网络匿名路由协议

Keywords: Bilinear pairing,Zero knowledge proofs,Energy efficiency,Low end-end delay,Anonymous routing,Ad-hoc networks
双线性对,零知识证明,低能耗,低时延,匿名路由,Ad-hoc网络

Full-Text   Cite this paper   Add to My Lib

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...

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133