Azzedine Boukerche
ABSTRACT
A mobile ad hoc network consists of mobile nodes that can move freely in an open environment. Communicating nodes in a wireless and mobile ad hoc network usually seek the help of other intermediate nodes to establish communication channels. In such an open environment, malicious intermediate nodes can be a threat to the security and/or anonymity of the exchanged data between the mobile nodes. While data encryption can protect the content exchanged between nodes, routing information may reveal valuable information about end users and their relationships. The main purposes of this paper are to study the possibility of achieving anonymity in ad hoc networks, and propose an anonymous routing protocol, similar to onion routing concept used in wired networks. Our protocol includes a mechanism to establish a trust among mobile nodes while avoiding untrustworthy nodes during the route discovery process. The major objective of our protocol is to allow only trustworthy intermediate nodes to participate in the routing protocol without jeopardizing the anonymity of the communicating nodes. We present our scheme, and report on its performance using an extensive set of simulation set of experiments using ns-2 simulator. Our results indicate clearly that anonymity can be achieved in mobile ad hoc networks, and the additional overhead of our scheme to DSR is reasonably low when compared to a non-secure DSR ad hoc routing protocol.
- Anonymity on the Internet. <http://www.sendfakemail.com/~raph/remailer-list.html>, Accessed Jun. 2004.]]Google Scholar
- Boukerche, A., El-Khatib, K., and Xu, L. Secure Routing Protocols for mobile Ad Hoc Networks. Technical Report, TR-2004, University of Ottawa.]]Google Scholar
- Boukerche, A. and Notare, M. Neural Fraud Based Intrusion Detection for Mobile Phone Operations, IEEE BioSP3, 2001]]Google Scholar
- Boukerche, A. and Notare, M. Behavior Based Intrusion Detection in Mobile Phone Systems, Journal of Parallel and Distributed Computing. 2002.]] Google ScholarDigital Library
- Broch, J., Maltz, D. A., Johnson, D. B., Hu, Y-C., and Jetcheva, J. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proc. ACM MOBICOM, pages 85--97, Oct. 1998.]] Google ScholarDigital Library
- Chaum, D. Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Communications of the ACM, 24.2, (Feb 1981) 84--88.]] Google ScholarDigital Library
- Chaum, D. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptography, 1.1, (1988) 65--75.]] Google ScholarDigital Library
- Electronic Frontiers Georgia (EFGA). Anonymous remailer information. http://anon.efga.org/Remailers/.]]Google Scholar
- Freedman, M. J., Morris, R. Tarzan: A peer-to-peer anonymizing network layer. In Proceedings of the First International Workshop on Peer-to-Peer Systems (Cambridge, MA, Mar. 2002).]] Google ScholarDigital Library
- Goldberg, I., and Shostack, A. Freedom network 1.0 architecture, November 1999.]]Google Scholar
- Johnson, D. and Maltz, D. Dynamic source routing in ad hoc wireless networks. T. Imielinski and H. Korth, editors, Mobile computing, Kluwer Academic, 1996.]]Google ScholarCross Ref
- Johnson, D. B., Maltz, D. A., and Broch, J. DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. In Ad Hoc Networking, ch. 5, pp. 139--172. Addison-Wesley, 2001.]] Google ScholarDigital Library
- Korba L., Song, R., and Yee, G. <http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/y/Yee:George.html>Anonymous Communications for Mobile Agents. MATA 2002 <http://www.informatik.uni-trier.de/~ley/db/conf/mata/mata2002.html>: 171--181]] Google ScholarDigital Library
- Lundberg, J. Routing Security in Ad Hoc Networks. Tech. Rep. Tik-110.501, Helsinki University of Technology, 2000.]]Google Scholar
- May, T. C. <http://www2.pro-ns.net/~crypto/chapter8.html>, Accessed June 2004.]]Google Scholar
- NS-2, available at <http://www.isi.edu/nsnam/ns/>]]Google Scholar
- Papadimitratos, P. and Haas, Z. J. Secure Routing for Mobile Ad hoc Networks <http://wnl.ece.cornell.edu/Publications/cnds02.pdf>. SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), San Antonio, TX, January 27--31, 2002.]]Google Scholar
- Perkins, C. E. and E. Royer, M. Ad hoc on demand distance vector (AODV) routing. <http://www.ietf.org/internet-drafts/>draft-ietf-manet-aodv-00.txt, 1997. IETF Internet Draft.]]Google Scholar
- Reed, M., Syverson, P., and Goldschlag, D. Proxies for anonymous routing. In 12th Annual Computer Security Applications Conference, (Dec. 1995), 95--104.]] Google ScholarDigital Library
- Reiter, M. K. and Rubin, A. D. Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security, 1.1, (Nov. 1998), 66--92.]] Google ScholarDigital Library
- Rennhard, M. MorphMix: Peer-to-Peer based Anonymous Internet Usage with Collusion Detection. Technical Report Nr. 147, TIK, ETH Zurich, Switzerland, August 2002]]Google ScholarDigital Library
- Sanzgiri, K., Dahill, B., Levine, B. N., Shields, C., and Belding-Royer, E. M. A Secure Routing Protocol for Ad Hoc Networks <http://papers/ad-hoc-network/aran.icnp02.ps>, In Proceedings of 2002 IEEE International Conference on Network Protocols (ICNP), Nov. 2002.]] Google ScholarDigital Library
- Syverson, P. F., Goldschlag, D. M., and Reed, M. G. Anonymous connections and onion routing. In Proceedings of the IEEE Symposium on Security and Privacy (Oakland, California, May1997), 44--54.]] Google ScholarDigital Library
- Venkatraman, L., Agrawal, D.P. Strategies for enhancing routing security in protocols for mobile ad hoc networks, in Journal of Parallel and Distributed Computing, 63.2 (February 2003), Special issue on Routing in mobile and wireless ad hoc networks, Pages: 214 -- 227, Year of Publication: 2003, ISSN:0743-7315]] Google ScholarDigital Library
- Yi, S., Naldurg, P., and Kravets, R. Security-Aware Ad Hoc Routing Protocol for Wireless Networks <http://papers/ad-hoc-network/secuaware_routi_adhoc%5B1%5D.ps><http://papers/ad-hoc-network/secuaware_routi_adhoc%5B1%5D.ps> The 6th World Multi-Conference on Systemics, Cybernetics and Informatics (SCI 2002), 2002.]]Google Scholar
Index Terms
- A novel solution for achieving anonymity in wireless ad hoc networks
Recommendations
Bloom filter based secure and anonymous DSR protocol in wireless ad hoc networks
Wireless ad hoc networks, especially in the hostile environment, are vulnerable to traffic analysis which allows the adversary to trace the routing messages and the sensitive data packets. Anonymity mechanism in ad hoc networks is a critical securing ...
Link Stability Approach and Scalability Method on ODMRP in Ad Hoc Networks
CNSR '09: Proceedings of the 2009 Seventh Annual Communication Networks and Services Research ConferenceAn ad hoc network is a dynamically reconfigurable wireless network with no fixed wired infrastructure. The primary concerns in ad hoc networks are bandwidth limitation and unpredictable dynamic topology. The On-Demand Multicast Routing Protocol (ODMRP) ...
Highly stable and adaptive clustering with efficient routing in wireless ad hoc networks
The association and disassociation of mobile nodes to and from the clusters in wireless ad hoc networks disturb the stability of the network and, therefore, the reconfiguration of clusterheads is unavoidable. This paper proposes a Weight Based Adaptive ...
Comments