Achieving K-anonymity in mobile ad hoc networks

A zone-based K-anonymity routing protocol is proposed and investigated, the goal of which is to achieve destination anonymity in positioning routing algorithms. Under this protocol, the source sends the data to an anonymity zone, where the destination node and a number of other nodes are located. The data is flooded within the anonymity zone so that to a tracer is not able to guess which is the destination node. The paper presents the details of the protocol design and proposes two approaches for anonymity zone management. In particular, we have found out that initially setting anonymity zone large can help to meet the destination anonymity requirement for longer time at a relatively low control overhead.

[1]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[2]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[3]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[4]  Xiaoxin Wu VPDS: Virtual Home Region Based Distributed Position Service in Mobile Ad Hoc Networks , 2005, 25th IEEE International Conference on Distributed Computing Systems (ICDCS'05).

[5]  Latanya Sweeney,et al.  k-Anonymity: A Model for Protecting Privacy , 2002, Int. J. Uncertain. Fuzziness Knowl. Based Syst..

[6]  David R. Karger,et al.  A scalable location service for geographic ad hoc routing , 2000, MobiCom '00.