Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Reference
C. Adjih, T. Clausen, P. Jacquet, A. Laouiti, P. Minet, P. Muhlethaler, A. Qayyum, and L. Viennot. Optimized Link State Routing Protocol. Internet Draft.
G. Ateniese, A. Herzberg, H. Krawczyk, and G. Tsudik. Untraceable Mobility or How to Travel Incognito. Computer Networks, 31(8):871–884, 1999.
ATM Forum. Asynchronous Transfer Mode. http://www.atmforum.org/.
D. Balfanz, G. Durfee, N. Shankar, D. K. Smetters, J. Staddon, and H.-C. Wong. Secret Handshakes from Pairing-Based Key Agreements. In IEEE Symposium on Security and Privacy, pages 180–196, 2003.
A. R. Beresford and F. Stajano. Location Privacy in Pervasive Computing. IEEE Pervasive Computing, 2(1):46–55, 2003.
O. Berthold, H. Federrath, and S. K¨opsell. Web MIXes: A system for anonymous and unobservable Internet access. In H. Federrath, editor, DIAU’00, Lecture Notes in Computer Science 2009, pages 115–129, 2000.
R. Blom. An Optimal Class of Symmetric Key Generation System. In T. Beth, N. Cot, and I. Ingemarsson, editors, EUROCRYPT’ 84, Lecture Notes in Computer Science 209, pages 335–338, 1985.
A. Boukerche, K. El-Khatib, L. Xu, and L. Korba. SDAR: A SecureDistributed Anonymous Routing Protocol for Wireless and Mobile Ad Hoc Networks. In 29th IEEE International Conference on Local Computer Networks (LCN’04), pages 618–624, 2004.
J. Broch, D. A. Maltz, D. B. Johnson, Y.-C. Hu, and J. Jetcheva. A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols. In ACM MOBICOM, pages 85–97, 1998.
M. Brown, D. Cheung, D. Hankerson, J. L. Hernandez, M. Kurkup, and A. Menezes. PGP in Constrained Wireless Devices. In USENIX Security Symposium (Security ’00), 2000.
D. L. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84–88, 1981.
D. L. Chaum. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology, 1(1):65–75, 1988.
W. Dai. PipeNet 1.1. http://www.eskimo.com/_weidai/pipenet.txt, 1996.
J. Deng, R. Han, and S. Mishra. Intrusion Tolerance and Anti-Traffic Analysis Strategies for Wireless Sensor Networks. In IEEE International Conference on Dependable Systems and Networks (DSN), pages 594–603, 2004.
W. Du, J. Deng, Y. S. Han, and P. K. Varshney. A Pairwise Key Pre-distribution Scheme for Wireless Sensor Networks. In ACM CCS, pages 42–51, 2003.
L. Eschenauer and V. D. Gligor. A Key-Management Scheme for Distributed Sensor Networks. In ACM CCS, pages 41–47, 2002.
S. Goldwasser and S. Micali. Probabilistic Encryption. Journal of Computer and System Sciences, 28(2):270–299, 1984.
M. Gruteser and D. Grunwald. Anonymous Usage of Location-Based ServicesThrough Spatial and Temporal Cloaking. In MobiSys03, 2003.
Q. He, D. Wu, and P. Khosla. Quest for Personal Control over Mobile Location Privacy. IEEE Communications Magazine, 42(5):130–136, 2004.
Y.-C. Hu and H. J. Wang. A Framework for Location Privacy in WirelessNetworks. In ACM SIGCOMM Asia Workshop, 2005.
P. G. Ifju, S. M. Ettinger, D. Jenkins, Y. Lian, W. Shyy, and M. Waszak. Flexible-wing-based Micro Air Vehicles. In $40th$AIAA Aerospace Sciences Meeting, 2002.
P. G. Ifju, S. M. Ettinger, D. Jenkins, and L. Martinez. Composite materials for Micro Air Vehicles. SAMPE Journal, 37(4):7–13, 2001.
A. Jerichow, J. M¨uller, A. Pfitzmann, B. Pfitzmann, and M. Waidner. Real-Time MIXes: A Bandwidth-Efficient Anonymity Protocol. IEEE Journal on Selected Areas in Communications, 16(4), 1998.
S. Jiang, N. Vaidya, and W. Zhao. A MIX Route Algorithm for Mix-net in Wireless Ad hoc Networks. In IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS), 2004.
D. B. Johnson and D. A. Maltz. Dynamic Source Routing in Ad Hoc Wireless Networks. In T. Imielinski and H. Korth, editors, Mobile Computing, volume 353, pages 153–181. Kluwer Academic Publishers, 1996.
D. Kesdogan, J. Egner, and R. Buschkes. Stop-and-go MIXes Providing Probabilistic Security in an Open System. Second International Workshop on Information Hiding (IH’98), Lecture Notes in Computer Science 1525, pages 83–98, 1998.
J. Kong. Anonymous and Untraceable Communications in Mobile Wireless Networks. PhD thesis, University of California, Los Angeles, June 2004.
J. Kong and X. Hong. ANODR: ANonymous On Demand Routing with Untraceable Routes for Mobile Ad-hoc Networks. In ACM MOBIHOC’03, pages 291–302, 2003.
J. Kong, X. Hong, and M. Gerla. A New Set of Passive Routing Attacks in Mobile Ad Hoc Networks. In IEEE MILCOM, 2003.
F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-Correcting Codes. Amsterdam, The Netherlands, North-Holland, 1988.
R. Motwani and P. Raghavan. Randomized algorithms. Cambridge University Press, 1995.
National Institute of Standards and Technology. Advanced Encryption Standard. http://csrc.nist.gov/encryption/aes/, 2001.
D. Niculescu and B. Nath. Ad hoc positioning system (APS). In IEEE GLOBECOM, 2001.
R. Ogier, M. Lewis, and F. Templin. Topology Dissemination Based on Reverse-Path Forwarding (TBRPF). http://www.ietf.org/internet-drafts/draft-ietf-manet-tbrpf-07.txt, March 2003.
C. Ozturk, Y. Zhang, and W. Trappe. Source-Location Privacy in Energy-Constrained Sensor Network Routing. In ACM SASN, pages 88–93, 2004.
C. E. Perkins and E. M. Royer. Ad-Hoc On-Demand Distance Vector Routing.In IEEE WMCSA’99, pages 90–100, 1999.
C. E. Perkins, E. M. Royer, and S. Das. Ad-hoc On Demand Distance Vector (AODV) Routing. http://www.ietf.org/rfc/rfc3561.txt, July 2003.
A. Pfitzmann and M. K¨ohntopp. Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology. In H. Federrath, editor, DIAU’00, Lecture Notes in Computer Science 2009, pages 1–9, 2000.
A. Pfitzmann, B. Pfitzmann, and M. Waidner. ISDNMixes:Untraceable Communication with Very Small Bandwidth Overhead. In GI/ITG Conference: Communication in Distributed Systems, pages 451–463, 1991.
A. Pfitzmann and M. Waidner. Networks Without User Observability: Design Options. In F. Pichler, editor, EUROCRYPT’ 85, Lecture Notes in Computer Science 219, pages 245–253, 1986.
C. Rackoff and D. R. Simon. Cryptographic defense against traffic analysis. In Symposium on the Theory of Computation (STOC), pages 672–681, 1993.
M. G. Reed, P. F. Syverson, and D. M. Goldschlag. Anonymous Connections and Onion Routing. IEEE Journal on Selected Areas in Communications, 16(4),1998.
M. K. Reiter and A. D. Rubin. Crowds: Anonymity for Web Transactions. ACM Transactions on Information and System Security, 1(1):66–92, 1998.
D. Samfat, R. Molva, and N. Asokan. Untraceability in Mobile Networks. In ACM MOBICOM, pages 26–36, 1995.
Scalable Network Technologies (SNT). QualNet. http://www.qualnet.com/.
Y. Shang, W. Ruml, Y. Zhang, and M. P. J. Fromherz. Localization from Mere Connectivity. In ACM MOBIHOC, pages 201–212, 2003.
G. S. Vernam. Cipher Printing Telegraph Systems for Secret Wire and Radio Telegraphic Communications. Journal American Institute of Electrical Engineers, XLV:109–115, 1926.
J. Yoon, M. Liu, and B. Noble. Sound Mobility Models. In ACM MOBICOM, pages 205–216, 2003.
Y. Zhang, W. Liu, and W. Lou. Anonymous Communications in Mobile Ad Hoc Networks. In IEEE INFOCOM, 2005.
J. Kong, X. Hong, M. Gerla. An Identity-free and On Demand Routing Scheme against Anonymity Threats in Mobile Ad-hoc Networks. IEEE Transactions on Mobile Computing, to appear 2007.
X. Hong, J. Kong, M. Gerla, “Mobility Changes Anonymity: New Passive Threats in Mobile Ad Hoc Networks”, Wireless Communications & Mobile Computing (WCMC), Special Issue of Wireless Network Security, Vol. 6, Issue 3, May 2006, Page(s):281–293.
L. Yang, M. Jakobsson, S. Wetzel. “Discount Anonymous On Demand Routing for Mobile Ad hoc Networks,” in the proceedings of SECURECOMM ‘06.
C. E. Perkins and P. Bhagwat, Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers, ACM SIGCOMM, pp. 234–244, 1994.
R. Song and L. Korba and G. Yee. AnonDSR: Efficient Anonymous DynamicSource Routing for Mobile Ad-Hoc Networks, ACM Workshop on Security of Ad Hoc and Sensor Networks (SASN), 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Kong, J., Liu, J., Hong, X., Wu, D., Gerla, M. (2007). On Performance Cost of On-demand Anonymous Routing Protocols in Mobile Ad Hoc Networks. In: Makki, S.K., Reiher, P., Makki, K., Pissinou, N., Makki, S. (eds) Mobile and Wireless Network Security and Privacy. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-71058-7_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-71058-7_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-71057-0
Online ISBN: 978-0-387-71058-7
eBook Packages: EngineeringEngineering (R0)