|Table of Contents|

Local-repair Mechanism for Anonymity Routing Algorithm in Ad Hoc

《南京理工大学学报》(自然科学版)[ISSN:1005-9830/CN:32-1397/N]

Issue:
2009年05期
Page:
643-647
Research Field:
Publishing date:

Info

Title:
Local-repair Mechanism for Anonymity Routing Algorithm in Ad Hoc
Author(s):
ZHU Xi-zhiZHANG HongLIU Feng-yu
School of Computer Science and Technology,NUST,Nanjing 210094,China
Keywords:
local-repair anonymity routing Ad Hoc
PACS:
TN929.5
DOI:
-
Abstract:
In view of the limitation of the researches on anonymous routing algorithm in Ad Hoc networks in the routing discovery procedure,the routing maintenance procedure is investigated.The local repair mechanism is introduced into the anonymous routing and a secure and efficient algorithm is proposed.It can repair the route rapidly based on a local discovery,significantly improving the performance of the anonymous routing algorithm.Theoretic analysis proves the security.Simulation shows that when the average speed of node is 20 m/s,the delay is reduced by 13%,the delivery rate is increased by 1.5%,and the controlling packets are reduced by 15%.The faster the nodes move,the better the performance of local repair mechanism is.

References:

[ 1] Kong J, HongX, SanadidiM, eta.l Mobility changes anonymity: MobileAdHoc networks needefficient a-nonymous routing[ A]. Proc IEEE SymposiumCom-putersandCommunication ( ISCC. 05) [ C]. IEEE, 2005, 57- 62.
[ 2] ReedM, SyversonP, GoldschlagD. Anonymousconnec-tionsandonion routing[ J]. IEEEJournal onSelected Areas in Communications, Special Issue on Copyright andPrivacyProtection, 1998, 16(4): 482-494.
[ 3] DingledineR, MathewsonN, SyversonP. TOR: The second-generationonionrouter[A]. Proceedingsof the 13thUSENIX Security Symposium[ C]. SanDiego, CA: The 13thUSENIX Security Symposium, 2004. 13: 21-21.
[ 4] Kong J, Hong X, GerlaM. ANODR: anonymous on demandroutingwithuntraceable routes formobileAd-Hoc networks[A]. Proceedings ofACM International SymposiumonMobileAdHocNetworking andCompu-ting (MobHi oc . 03) [ C]. Annapolis: ACM Press, 2003. 291-302.
[ 5] Kong J, Hong X, GerlaM. An identity-free andon-demand routing scheme against anonymity threats in mobile AdHoc networks[ J]. IEEETransactions on MobileComputing, 2007, 6( 8): 888-902.
[ 6] ZhuB, WanZ, KankanhalliM, et a.l Anonymousse-cure routing inmobile Ad-Hoc networks[ A]. Pro-ceeddingsof the29thAnnual IEEEInternationalCon-ference onLocalComputerNetworks (LCN. 04) [C]. IEEE, 2004, 102-108.
[ 7] QianL, Song N, LiX. Secure anonymous routing in clusteredmultihopwirelessAdHocnetworks[A]. In-formation Sciences and Systems, 2006 40th Annual Conference[C]. IEEE, 2006, 1619-1624.
[ 8] 吴振强,马建峰. 一种无线AdHoc网络动态混淆匿名算法[ J]. 计算机研究与发展, 2007, 44(4): 560-566.
[ 9] PerkinsC, BeldingRoyer E, DasS. RFC3561: Adhoc on-demanddistancevector (AODV) routing[ EB/OL]. http: //www. iet.f org/rfc/rfc3561. txt, 2003-07.
[ 10] PfitzmannA, KohntoppM. Anonymity, unobservabil-i ty andpseudonymity: a proposal for terminology[A]. Designing Privacy Enhancing Technology: Design Is-sues in Anonymity and Observability[ C]. Berlin: Springer-Verlag, 2009. 1-9.
[ 11] WrightM, Adler M, Levine BN, et a.l Defending anonymous communication against passive logging attacks[A]. IEEESymposiumonSecurity andPrivacy [ C]. IEEE, 2003, 28- 41.
[ 12] Fall K, Varahdan K. The NSManual[ EB/OL]. http: / /www. is.iedu/nsnam/ns/doc/ index. htm,l 2007 -09-03.

Memo

Memo:
-
Last Update: 2012-11-19