MASK: anonymous on-demand routing in mobile ad hoc networks
- 6 September 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 5 (9), 2376-2385
- https://doi.org/10.1109/twc.2006.1687761
Abstract
The shared wireless medium of mobile ad hoc networks facilitates passive, adversarial eavesdropping on data communications whereby adversaries can launch various devastating attacks on the target network. To thwart passive eavesdropping and the resulting attacks, we propose a novel anonymous on-demand routing protocol, termed MASK, which can accomplish both MAC-layer and network-layer communications without disclosing real IDs of the participating nodes under a rather strong adversary model. MASK offers the anonymity of senders, receivers, and sender-receiver relationships in addition to node unlocatability and untrackability and end-to-end flow untraceability. It is also resistant to a wide range of attacks. Moreover, MASK preserves the high routing efficiency as compared to previous proposals. Detailed simulation studies have shown that MASK is highly effective and efficientKeywords
This publication has 10 references indexed in Scilit:
- Handbook of Applied CryptographyPublished by Taylor & Francis ,2018
- A general framework to construct stationary mobility models for the simulation of mobile networksIEEE Transactions on Mobile Computing, 2006
- Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc NetworksWireless Networks, 2005
- A secure routing protocol for ad hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Ad hoc On-Demand Distance Vector (AODV) RoutingPublished by RFC Editor ,2003
- ANODRPublished by Association for Computing Machinery (ACM) ,2003
- GloMoSim: a library for parallel simulation of large-scale wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Anonymous connections and onion routingIEEE Journal on Selected Areas in Communications, 1998
- Untraceable electronic mail, return addresses, and digital pseudonymsCommunications of the ACM, 1981
- How to share a secretCommunications of the ACM, 1979