The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Behavior-based intrusion detection in mobile phone systems
Journal of Parallel and Distributed Computing - Problems in parallel and distributed computing: Solutions based on evolutionary paradigms
A Secure Routing Protocol for Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
ACSAC '96 Proceedings of the 12th Annual Computer Security Applications Conference
Strategies for enhancing routing security in protocols for mobile ad hoc networks
Journal of Parallel and Distributed Computing - Special issue on Routing in mobile and wireless ad hoc networks
Anonymous Connections and Onion Routing
SP '97 Proceedings of the 1997 IEEE Symposium on Security and Privacy
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
Traffic analysis-based unlinkability measure for IEEE 802.11b-based communication systems
WiSe '06 Proceedings of the 5th ACM workshop on Wireless security
Secure anonymous routing in ad hoc networks
COMPUTE '08 Proceedings of the 1st Bangalore Annual Compute Conference
Pseudonym-based cryptography for anonymous communications in mobile ad hoc networks
International Journal of Security and Networks
ARM: anonymous routing protocol for mobile ad hoc networks
International Journal of Wireless and Mobile Computing
A simplified anonymous dynamic source routing protocol for ad-hoc networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
Increasing base-station anonymity in wireless sensor networks
Ad Hoc Networks
SensorTrust: A resilient trust model for wireless sensing systems
Pervasive and Mobile Computing
TARF: a trust-aware routing framework for wireless sensor networks
EWSN'10 Proceedings of the 7th European conference on Wireless Sensor Networks
An overview of anonymous communications in mobile ad hoc networks
Wireless Communications & Mobile Computing
Exploiting architectural techniques for boosting base-station anonymity in wireless sensor networks
International Journal of Sensor Networks
Anonymous overlay network supporting authenticated routing
Information Sciences: an International Journal
Hi-index | 0.00 |
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.