research-article

An Identity-Free and On-Demand Routing Scheme against Anonymity Threats in Mobile Ad Hoc Networks

Authors:

Mario GerlaAuthors Info & Claims

IEEE Transactions on Mobile Computing, Volume 6, Issue 8

Pages 888 - 902

https://doi.org/10.1109/TMC.2007.1021

Published: 01 August 2007 Publication History

Abstract

Introducing node mobility into the network also introduces new anonymity threats. This important change of the concept of anonymity has recently attracted attentions in mobile wireless security research. This paper presents identity-free routing and on-demand routing as two design principles of anonymous routing in mobile ad hoc networks. We devise ANODR (ANonymous On-Demand Routing) as the needed anonymous routing scheme that is compliant with the design principles. Our security analysis and simulation study verify the effectiveness and efficiency of ANODR.

References

[1]

C. Adjih, T. Clausen, P. Jacquet, A. Laouiti, P. Minet, P. Muhlethaler, A. Qayyum, and L. Viennot, “Optimized Link State Routing Protocol,” IETF Internet draft, work in progress, 2000.

[2]

J. Al-Muhtadi, R. Campbell, A. Kapadia, M. Mickunas, and S. Yi, “Routing through the Mist: Privacy Preserving Communication in Ubiquitous Computing Environments,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS '02), pp. 65-74, 2002.

Digital Library

[3]

American National Standard X9.17: Financial Institution Key Management (Wholesale), Am. Nat'l Standards Inst., 1985.

[4]

ATM Forum, “Asynchronous Transfer Mode,” http://www. atmforum.org/, 1999.

[5]

D. Balfanz, G. Durfee, N. Shankar, D.K. Smetters, J. Staddon, and H.-C. Wong, “Secret Handshakes from Pairing-Based Key Agreements,” Proc. IEEE Symp. Security and Privacy, pp. 180-196, 2003.

Digital Library

[6]

O. Berthold, H. Federrath, and S. Köpsell, “Web MIXes: A System for Anonymous and Unobservable Internet Access,” Proc. Workshop Design Issues in Anonymity and Unobservability (DIAU '00), H.Federrath, ed., pp. 115-129, 2000.

Digital Library

[7]

C. Bettstetter, H. Hartenstein, and X. Perez-Costa, “Stochastic Properties of the Random Waypoint Mobility Model,” ACM/Kluwer Wireless Networks, special issue on modeling and analysis of mobile networks, vol. 10, no. 5, pp. 555-567, 2004.

Digital Library

[8]

C. Bettstetter and C. Wagner, “The Spatial Node Distribution of the Random Waypoint Mobility Model,” Proc. German Workshop Mobile Ad Hoc Networks (WMAN '02), pp. 41-58, 2002.

Digital Library

[9]

M. Blum and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits,” Proc. Symp. Foundations of Computer Science (FOCS '82), pp. 112-117, 1982.

Digital Library

[10]

A. Boukerche, K. El-Khatib, L. Xu, and L. Korba, “SDAR: A Secure Distributed Anonymous Routing Protocol for Wireless and Mobile Ad Hoc Networks,” Proc. 29th IEEE Int'l Conf. Local Computer Networks (LCN '04), pp. 618-624, 2004.

Digital Library

[11]

D.L. Chaum, “Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms,” Comm. ACM, vol. 24, no. 2, pp. 84-88, 1981.

Digital Library

[12]

D.L. Chaum, “The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability,” J. Cryptology, vol. 1, no. 1, pp. 65-75, 1988.

Digital Library

[13]

N. Cressie, Statistics for Spatial Data. John Wiley and Sons, 1993.

[14]

W. Dai, “PipeNet 1.1,” http://www.eskimo.com/~weidai/pipenet.txt, 1996.

[15]

J. Deng, R. Han, and S. Mishra, “Intrusion Tolerance and Anti-Traffic Analysis Strategies for Wireless Sensor Networks,” Proc. IEEE Int'l Conf. Dependable Systems and Networks (DSN '04), pp.594-603, 2004.

Digital Library

[16]

C. Díaz, S. Seys, J. Claessens, and B. Preneel, “Towards Measuring Anonymity,” Proc. Privacy Enhancing Technologies Workshop (PET '02), pp. 54-68, 2002.

[17]

W. Du, J. Deng, Y.S. Han, and P.K. Varshney, “A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks,” Proc. ACM Conf. Computer and Comm. Security (CCS '03), pp. 42-51, 2003.

Digital Library

[18]

O. Goldreich, Foundations of Cryptography: Basic Tools, vol. 1. Cambridge Univ. Press, 2001.

Digital Library

[19]

O. Goldreich and L.A. Levin, “A Hard-Core Predicate for All One-Way Functions,” Proc. Symp. Theory of Computation (STOC '89), pp.25-32, 1989.

Digital Library

[20]

S. Goldwasser and S. Micali, “Probabilistic Encryption,” J.Computer and System Sciences, vol. 28, no. 2, pp. 270-299, 1984.

[21]

M. Gruteser and D. Grunwald, “Anonymous Usage of Location-Based Services through Spatial and Temporal Cloaking,” Proc. First Int'l Conf. Mobile Systems, Applications, and Services (MobiSys '03), 2003.

Digital Library

[22]

V. Gupta, S. Gupta, and D. Stebila, “Performance Analysis of Elliptic Curve Cryptography for SSL,” Proc. First ACM Workshop Wireless Security (WiSe '02), pp. 87-94, 2002.

Digital Library

[23]

Y.-C. Hu, A. Perrig, and D.B. Johnson, “Ariadne: A Secure On-demand Routing Protocol for Ad Hoc Networks,” Proc. MobiCom, pp. 12-23, 2002.

Digital Library

[24]

Y.-C. Hu and H.J. Wang, “A Framework for Location Privacy in Wireless Networks,” Proc. ACM SIGCOMM Asia Workshop, 2005.

[25]

A. Jerichow, J. Müller, A. Pfitzmann, B. Pfitzmann, and M. Waidner, “Real-Time MIXes: A Bandwidth-Efficient Anonymity Protocol,” IEEE J. Selected Areas Comm., vol. 16, no. 4, 1998.

Digital Library

[26]

S. Jiang, N. Vaidya, and W. Zhao, “A MIX Route Algorithm for Mix-net in Wireless Ad Hoc Networks,” Proc. IEEE Int'l Conf. Mobile Ad-Hoc and Sensor Systems (MASS '04), 2004.

[27]

D. Kesdogan, J. Egner, and R. Buschkes, “Stop-and-Go MIXes Providing Probabilistic Security in an Open System,” Proc. Second Int'l Workshop Information Hiding (IH '98), pp. 83-98, 1998.

[28]

J. Kong, “Formal Notions of Anonymity for Peer-to-Peer Networks,” Technical Report 2005/132, IACR Cryptology ePrint Archive, May 2005.

[29]

J. Kong and X. Hong, “ANODR: ANonymous on Demand Routing with Untraceable Routes for Mobile Ad-Hoc Networks,” Proc. MobiHoc, pp. 291-302, 2003.

Digital Library

[30]

J. Kong, X. Hong, and M. Gerla, “Modeling Ad-Hoc Rushing Attack in a Negligibility-Based Security Framework,” Proc. ACM Workshop Wireless Security (WiSe '06), pp. 55-64, 2006.

Digital Library

[31]

J. Kong, X. Hong, M. Sanadidi, and M. Gerla, “Mobility Changes Anonymity: Mobile Ad Hoc Networks Need Efficient Anonymous Routing,” Proc. IEEE Symp. Computers and Comm. (ISCC '05), 2005.

Digital Library

[32]

A.J. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press, 1996.

Digital Library

[33]

D. Niculescu and B. Nath, “Ad Hoc Positioning System (APS),” Proc. IEEE Global Telecomm. Conf. (GLOBECOM '01), 2001.

[34]

R. Ogier, M. Lewis, and F. Templin, “Topology Dissemination Based on Reverse-Path Forwarding (TBRPF),” IETF Internet draft, work in progress, Mar. 2003.

[35]

A. Pfitzmann and M. Köhntopp, “Anonymity, Unobservability, and Pseudonymity—A Proposal for Terminology,” Proc. Workshop Design Issues in Anonymity and Unobservability (DIAU '00), H.Federrath, ed., pp. 1-9, 2000.

Digital Library

[36]

A. Pfitzmann, B. Pfitzmann, and M. Waidner, “ISDNMixes: Untraceable Communication with Very Small Bandwidth Overhead,” Proc. GI/ITG Conf.: Comm. Distributed Systems, pp. 451-463, 1991.

Digital Library

[37]

C. Rackoff and D.R. Simon, “Cryptographic Defense against Traffic Analysis,” Proc. Symp. Theory of Computation (STOC '93), pp.672-681, 1993.

Digital Library

[38]

M.G. Reed, P.F. Syverson, and D.M. Goldschlag, “Anonymous Connections and Onion Routing,” IEEE J. Selected Areas in Comm., vol. 16, no. 4, 1998.

Digital Library

[39]

M.K. Reiter and A.D. Rubin, “Crowds: Anonymity for Web Transactions,” ACM Trans. Information and System Security, vol. 1, no. 1, pp. 66-92, 1998.

Digital Library

[40]

G. Resta and P. Santi, “An Analysis of the Node Spatial Distribution of the Random Waypoint Model for Ad Hoc Networks,” Proc. ACM Workshop Principles of Mobile Computing (POMC '02), pp. 44-50, 2002.

Digital Library

[41]

K. Sanzgiri, B. Dahill, B.N. Levine, C. Shields, and E. Royer, “A Secure Routing Protocol for Ad Hoc Networks,” Proc. IEEE Int'l Conf. Network Protocols (ICNP '02), 2002.

Digital Library

[42]

QualNet, “Scalable Network Protocols (SNT),” http://www. qualnet.com/, 2005.

[43]

A. Serjantov and G. Danezis, “Towards an Information Theoretic Metric for Anonymity,” Proc. Privacy Enhancing Technologies Workshop (PET '02), R. Dingledine and P. Syverson, eds., pp. 41-53, 2002.

[44]

C.E. Shannon, “Communication Theory of Secrecy Systems,” Bell System Technical J., vol. 28, no. 4, pp. 656-715, 1949.

[45]

R. Song, L. Korba, and G. Yee, “AnonDSR: Efficient Anonymous Dynamic Source Routing for Mobile Ad-Hoc Networks,” Proc. ACM Workshop Security of Ad Hoc and Sensor Networks (SASN '05), 2005.

Digital Library

[46]

L. Sweeney, “$k{\hbox{-}}{\rm Anonymity}$ : A Model for Protecting Privacy,” Int'l J. Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 10, no. 5, pp. 557-570, 2002.

Digital Library

[47]

J. Yoon, M. Liu, and B. Noble, “Sound Mobility Models,” Proc. MobiCom, pp. 205-216, 2003.

Digital Library

[48]

Y. Zhang, W. Liu, and W. Lou, “Anonymous Communications in Mobile Ad Hoc Networks,” Proc. INFOCOM, 2005.

Cited By

Zhang QZhang K(2022)Protecting Location Privacy in IoT Wireless Sensor Networks through Addresses AnonymitySecurity and Communication Networks10.1155/2022/24403132022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/2440313
Boulaiche MYounis M(2022)A multi-illusive voids approach for increasing base station anonymityCluster Computing10.1007/s10586-022-03811-z26:6(3997-4013)Online publication date: 12-Nov-2022
https://dl.acm.org/doi/10.1007/s10586-022-03811-z
Visalakshi PPrabakaran S(2020)Detection and prevention of spoofing attacks in mobile adhoc networks using hybrid optimization algorithmJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-18288138:2(1691-1704)Online publication date: 1-Jan-2020
https://dl.acm.org/doi/10.3233/JIFS-182881
Show More Cited By

Index Terms

An Identity-Free and On-Demand Routing Scheme against Anonymity Threats in Mobile Ad Hoc Networks
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
  2. Network types
    1. Mobile networks
    2. Wireless access networks

Recommendations

Landmark routing in ad hoc networks with mobile backbones
Special issue on Routing in mobile and wireless ad hoc networks

A mobile ad hoc network is usually assumed to be homogeneous, where each mobile node shares the same radio capacity. However, a homogeneous ad hoc network suffers from poor scalability. Recent research has demonstrated its performance bottleneck through ...
A novel solution based on mobile agent for anonymity in wireless and mobile ad hoc networks
Q2SWinet '07: Proceedings of the 3rd ACM workshop on QoS and security for wireless and mobile networks

In ad hoc networks, a collection of wireless hosts cooperates to transmit packets to each other, even if they are beyond their direct wireless transmission range. Recently, many proposed routing protocols provide routing services for ad hoc networks. In ...
Efficient on-demand routing for mobile ad hoc wireless access networks

In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the ...

Comments

Information & Contributors

Information

Published In

cover image IEEE Transactions on Mobile Computing

IEEE Transactions on Mobile Computing Volume 6, Issue 8

August 2007

142 pages

ISSN:1536-1233

Issue’s Table of Contents

Copyright © 2007.

Publisher

IEEE Educational Activities Department

United States

Publication History

Published: 01 August 2007

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

20
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Zhang QZhang K(2022)Protecting Location Privacy in IoT Wireless Sensor Networks through Addresses AnonymitySecurity and Communication Networks10.1155/2022/24403132022Online publication date: 1-Jan-2022
https://dl.acm.org/doi/10.1155/2022/2440313
Boulaiche MYounis M(2022)A multi-illusive voids approach for increasing base station anonymityCluster Computing10.1007/s10586-022-03811-z26:6(3997-4013)Online publication date: 12-Nov-2022
https://dl.acm.org/doi/10.1007/s10586-022-03811-z
Visalakshi PPrabakaran S(2020)Detection and prevention of spoofing attacks in mobile adhoc networks using hybrid optimization algorithmJournal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology10.3233/JIFS-18288138:2(1691-1704)Online publication date: 1-Jan-2020
https://dl.acm.org/doi/10.3233/JIFS-182881
Chakraborty BVerma SSingh K(2019)Differentially Private Location Privacy Preservation in Wireless Sensor NetworksWireless Personal Communications: An International Journal10.1007/s11277-018-6026-5104:1(387-406)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s11277-018-6026-5
Ward JYounis M(2019)Cross-layer traffic analysis countermeasures against adaptive attackers of wireless sensor networksWireless Networks10.1007/s11276-019-02003-925:5(2869-2887)Online publication date: 1-Jul-2019
https://dl.acm.org/doi/10.1007/s11276-019-02003-9
Chakraborty BVerma SSingh K(2018)Staircase based differential privacy with branching mechanism for location privacy preservation in wireless sensor networksComputers and Security10.1016/j.cose.2018.03.00277:C(36-48)Online publication date: 1-Aug-2018
https://dl.acm.org/doi/10.1016/j.cose.2018.03.002
Baroutis NYounis M(2017)Load-conscious maximization of base-station location privacy in wireless sensor networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2017.06.021124:C(126-139)Online publication date: 4-Sep-2017
https://dl.acm.org/doi/10.1016/j.comnet.2017.06.021
Rahul MArun EMohamed Shameem PRajeesh J(2017)An Augmented Routing Algorithm for Trusted Detection of Link Failures in MANETsWireless Personal Communications: An International Journal10.1007/s11277-016-3735-596:4(5185-5201)Online publication date: 1-Oct-2017
https://dl.acm.org/doi/10.1007/s11277-016-3735-5
Baroutis NYounis M(2016)Boosting Base-Station Anonymity in Wireless Sensor Networks through Illusive Multiple-Sink Traffic2016 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2016.7841637(1-7)Online publication date: 4-Dec-2016
https://dl.acm.org/doi/10.1109/GLOCOM.2016.7841637
Ward JYounis M(2016)An Energy-Efficient Cross-Layer Routing Approach for Wireless Sensor Networks Using Distributed Beamforming2016 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOCOM.2016.7841590(1-6)Online publication date: 4-Dec-2016
https://dl.acm.org/doi/10.1109/GLOCOM.2016.7841590
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents