期刊文献+

移动自组网中匿名通信方案

ANONYMOUS COMMUNICATION SCHEME FOR MOBILE AD HOC NETWORKS
下载PDF
导出
摘要 由于传统Ad hoc通信协议通常采用过多的公钥运算,导致路由建立时间延长。传统的基于公/私钥的签名方案暴露了节点的身份信息,不能满足匿名性的需求。针对以上问题提出了一种适用于小型Ad Hoc网络的可认证的匿名通信协议。通过移动代理对源节点和目标节点进行判别并对节点信息进行隐藏,降低了网络延迟。通过成员函数动态建立的路由控制信息,解决了单个节点的离线造成路径中断的问题。理论分析和仿真结果表明,该协议较传统协议在路由建立时间和信息投递率方面有较大的提高。另外该协议建立的匿名链接具有双向性,在一定程度上降低了协议损耗。 Conventional ad hoc communication protocols often execute too much public key computations,consuming a longer time for route construction.Conventional public/private key signature scheme exposes node identification information,which breaches the anonymity requirement.To tackle the above problem the thesis proposes an authenticable anonymous communication protocol suitable for small ad hoc networks.The protocol depends on mobile agents to identify source and destination nodes and conceal node information,so that the network delay is reduced;it also depends on member functions to dynamically construct router control information to avoid router discontinuity due to the dropping of any single node.Both theoretical analysis and simulation results show that,the novel protocol is superior over conventional protocols on either router construction delay or information transmission rate.In addition,the anonymous links established by the protocol are bi-directional,so that its overhead is reduced to a certain extent.
作者 柳杰 王晓明
出处 《计算机应用与软件》 CSCD 2011年第4期40-43,共4页 Computer Applications and Software
基金 国家自然科学基金(61070164 60773083) 广东省科技创新项目(2010B010600025)
关键词 移动自组网 移动代理 匿名通信 成员函数 Mobile ad hoc network Mobile agent Anonymous communication Member function
  • 相关文献

参考文献1

二级参考文献14

  • 1CHAUM D. Untraceable electronic mail, return addresses, and digital pseudonyms [J]. Communications of the ACM, 1981,24 (2):84 -88.
  • 2SOLA M, OHTA M, MAENO T. Scalability of intemet multicast protocols[ C/OL]. [ 2008 - 01 - 01 ]. http://www.cnaf. infn. it/-ferrari/papers/muhi/scale/scale. htm.
  • 3REED M, SYVERSON P, GOLDSCHLAG D. Anonymous connections and onion muting [ J]. IEEE Journal of Selected Areas in Communications, 1998, 16(4): 482-494.
  • 4GOLDSCHLAG D, REED M, SYVERSON P. Onion routing for anonymous and private internet connections[ J]. Communications of the ACM, 1999, 42(2) :39 -41.
  • 5CHAUM D. The dining cryptographers problem: Unconditional sender and recipient untraceability [ J ]. Journal of Cryptology. 1988, 1(1): 65-75.
  • 6KONG JIE-JUN, HONG XIAO-YAN, GERLA M. ANODR: ANonymous on demand routing with untraceable routes for mobile Ad-hoc networks[ C]// Proceedings of ACM International Symposium on Mobile Ad hoc Networking & Computing ( MobiHoc 2003 ). New York: ACM Press, 2003:291 - 302.
  • 7BOUKERCHE A, EI-KHATIB K, XU L, et al. A novel solution for achieving anonymity in wireless ad hoc networks[ C]// Proceedings of the I st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks. New York: ACM Press, 2004:30-38.
  • 8ZHU BO, WANG ZHI-GUO, KANKANHALLI M S, et al. Anonymous secure routing in mobile Ad Hoc networks[ C]//Proceedings of The 29th Annual IEEE Conference on Local Computer Networks (LCN' 2004). New York:ACM Press, 2004: 16-18.
  • 9ZHANG YAN-CHAO, LIU WEI, LUO WEN-JING. Anonymous communications in mobile ad hoc networks[ C]//Proceedings of the 24th International Conference of the IEEE Communications Society (INFOCOM 2005). Washington, DC: IEEE Press, 2005:13 - 17.
  • 10SEYS S, PRENEEL B. ARM: Anonymous routing protocol for mobile Ad Hoc networks[ C]// Proceedings of the 20th International Conference on Advanced Information Networking and Applications(AINA'06). Washington, DC: IEEE Computer Society, 2006:133 - 137.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部