An Energy-efficient and Real-time Anonymous Routing Protocol for Ad hoc Networks

Anonymous routing in ad hoc networks has been one of the major concerns over the past few years. Most researches have only focused on the route anonymity without considering energy efficiency and real-time performance which are also major concerns in ad hoc networks. In this paper, we propose a novel efficient anonymous routing protocol which provides not only anonymity but also energy efficiency and real-time performance in ad hoc networks. Our analysis and simulation study verify that our protocol is much better than existing anonymous routing protocols on the aspects of energy efficiency and real-time performance.

[1]  Amos Fiat,et al.  Zero Knowledge Proofs of Identity , 1987, STOC.

[2]  Azzedine Boukerche,et al.  SDAR: a secure distributed anonymous routing protocol for wireless and mobile ad hoc networks , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[3]  Xiaoyan Hong,et al.  An Identity-Free and On-Demand Routing Scheme against Anonymity Threats in Mobile Ad Hoc Networks , 2007, IEEE Transactions on Mobile Computing.

[4]  Xiaoyan Hong,et al.  ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks , 2003, MobiHoc '03.

[5]  Ronggong Song,et al.  AnonDSR: efficient anonymous dynamic source routing for mobile ad-hoc networks , 2005, SASN '05.

[6]  Deborah Estrin,et al.  Advances in network simulation , 2000, Computer.

[7]  Jun Pan,et al.  MASR: An Efficient Strong Anonymous Routing Protocol for Mobile Ad Hoc Networks , 2009, 2009 International Conference on Management and Service Science.

[8]  Xiaoyan Hong,et al.  On Performance Cost of On-demand Anonymous Routing Protocols in Mobile Ad Hoc Networks , 2007 .

[9]  Jianfeng Ma,et al.  An Efficient Anonymous Routing Protocol for Mobile Ad Hoc Networks , 2009, 2009 Fifth International Conference on Information Assurance and Security.

[10]  Yuguang Fang,et al.  MASK: anonymous on-demand routing in mobile ad hoc networks , 2006, IEEE Transactions on Wireless Communications.

[11]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[12]  Nasser Yazdani,et al.  Chain-Based Anonymous Routing for Wireless Ad Hoc Networks , 2007, 2007 4th IEEE Consumer Communications and Networking Conference.

[13]  Zbigniew Kotulski,et al.  ANAP: Anonymous Authentication Protocol in Mobile Ad hoc Networks , 2006, ArXiv.

[14]  Dong Hoon Lee,et al.  A3RP : Anonymous and Authenticated Ad Hoc Routing Protocol , 2008, 2008 International Conference on Information Security and Assurance (isa 2008).

[15]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..

[16]  Silvio Micali,et al.  The knowledge complexity of interactive proof-systems , 1985, STOC '85.

[17]  Amos Fiat,et al.  Zero-knowledge proofs of identity , 1987, Journal of Cryptology.

[18]  Ronggong Song,et al.  A robust anonymous ad hoc on-demand routing , 2009, MILCOM 2009 - 2009 IEEE Military Communications Conference.