Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
ACSAC '96 Proceedings of the 12th Annual Computer Security Applications Conference
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
A novel solution for achieving anonymity in wireless ad hoc networks
PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Anonymous Secure Routing in Mobile Ad-Hoc Networks
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
AnonDSR: efficient anonymous dynamic source routing for mobile ad-hoc networks
Proceedings of the 3rd ACM workshop on Security of ad hoc and sensor networks
HOP: achieving efficient anonymity in MANETs by combining HIP, OLSR, and pseudonyms
Companion to the 21st ACM SIGPLAN symposium on Object-oriented programming systems, languages, and applications
A survey on anonymous routing protocols in MANET
ICNVS'10 Proceedings of the 12th international conference on Networking, VLSI and signal processing
Providing mobile users' anonymity in hybrid networks
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
ACM SIGSOFT Software Engineering Notes
AOS: an anonymous overlay system for mobile ad hoc networks
Wireless Networks
Probabilistic real-time routing protocol for mobile ad-hoc networks based on IEEE 802.11b
ACS'11 Proceedings of the 11th WSEAS international conference on Applied computer science
Providing Users’ Anonymity in Mobile Hybrid Networks
ACM Transactions on Internet Technology (TOIT)
An anonymous distributed routing protocol in mobile ad-hoc networks
The Journal of Supercomputing
| Hi-index | 0.00 |
A mobile ad hoc network consists of mobile nodes that communicate in an open wireless medium. Adversaries can launch analysis against the routing information embedded in the routing message and data packets to detect the traffic pattern of the communications, thereby obtaining sensitive information of the system, such as the identity of a critical node. In order to thwart such attacks, anonymous routing protocols are developed. For the purposes of security and robustness, an ideal anonymous routing protocol should hide the identities of the nodes in the route, in particular, those of the source and the destination. Multiple routes should be established to increase the difficulty of traffic analysis and to avoid broken paths due to node mobility. Existing schemes either make the unrealistic and undesired assumption that certain topological information about the network is known to the nodes, or cannot achieve all the properties described in the above. In this paper, we propose an anonymous routing protocol with multiple routes called ARMR, which can satisfy all the required properties. In addition, the protocol has the flexibility of creating fake routes to confuse the adversaries, thus increasing the level of anonymity. In terms of communication efficiency, extensive simulation is carried out. Compared with AODV and MASK, our ARMR protocol gives a higher route request success rate under all situations and the delay of our protocol is comparable to the best of these two protocols.