Networks without user observability
Computers and Security
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Crowds: anonymity for Web transactions
ACM Transactions on Information and System Security (TISSEC)
The broadcast storm problem in a mobile ad hoc network
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A framework for scalable global IP-anycast (GIA)
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Untraceable electronic mail, return addresses, and digital pseudonyms
Communications of the ACM
Tarzan: a peer-to-peer anonymizing network layer
Proceedings of the 9th ACM conference on Computer and communications security
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
MIXes in Mobile Communication Systems: Location Management with Privacy
Proceedings of the First International Workshop on Information Hiding
k-anonymity: a model for protecting privacy
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Minimizing broadcast latency and redundancy in ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
P5: A Protocol for Scalable Anonymous Communication
SP '02 Proceedings of the 2002 IEEE Symposium on Security and Privacy
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Scalable Location Management Scheme in Mobile Ad-Hoc Networks
LCN '01 Proceedings of the 26th Annual IEEE Conference on Local Computer Networks
Responder Anonymity and Anonymous Peer-to-Peer File Sharing
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
VPDS: Virtual Home Region Based Distributed Position Service in Mobile Ad Hoc Networks
ICDCS '05 Proceedings of the 25th IEEE International Conference on Distributed Computing Systems
AO2P: Ad Hoc On-Demand Position-Based Private Routing Protocol
IEEE Transactions on Mobile Computing
Tor: the second-generation onion router
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
Towards an information theoretic metric for anonymity
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
A formal treatment of onion routing
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Position-based routing in ad hoc networks
IEEE Communications Magazine
Anonymous connections and onion routing
IEEE Journal on Selected Areas in Communications
Optimizing Pseudonym Updation in Vehicular Ad-Hoc Networks
Transactions on Computational Science IV
Maximizing anonymity of a vehicle through pseudonym updation
Proceedings of the 4th Annual International Conference on Wireless Internet
Privacy preserving continuous multimedia streaming in MANETs
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
| Hi-index | 0.00 |
A zone-based anonymous positioning routing protocol for ad hoc networks, enabling anonymity of both source and destination, is proposed and analyzed. According to the proposed algorithm, a source sends data to an anonymity zone, where the destination node and a number of other nodes are located. The data is then flooded within the anonymity zone so that a tracer is not able to determine the actual destination node. Source anonymity is also enabled because the positioning routing algorithms do not require the source ID nor its position for the correct routing. We develop anonymity protocols for both routeless and route-based data delivery algorithms. To evaluate anonymity, we propose a "measure of anonymity" and we develop an analytical model to evaluate it. By using this model we perform an extensive analysis of the anonymity protocols to determine the parameters that most impact the anonymity level.