Abstract
Cooperative caching is an effective approach to share cache copies among network nodes and then reduce data access cost in ad hoc networks. Since cached data may be privacy sensitive, privacy preservation should be considered. In this paper, we study this problem by achieving anonymity in cooperative caching. Our anonymous caching protocol borrows idea from anonymous routing protocols. Data query and access are realized based on anonymous hop-by-hop broadcasting. Pseudonyms are used in communications so as to protect the real identity. Security analysis confirms that our protocol can achieve sender anonymity, receiver anonymity, and communication anonymity. We also conduct simulations to evaluate the effect of anonymity mechanism on system performance. Different variants of anonymous caching algorithm and non-anonymous algorithms are simulated for comparisons. The results show that, anonymity will cause additional message cost and time cost, but the cost is reasonable. To the best of our knowledge, this is the first work on anonymity in cooperative caching.
Original language | English |
---|---|
Title of host publication | Proceedings - IEEE 10th International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2013 |
Pages | 64-72 |
Number of pages | 9 |
DOIs | |
Publication status | Published - 1 Dec 2013 |
Event | 10th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2013 - Hangzhou, China Duration: 14 Oct 2013 → 16 Oct 2013 |
Conference
Conference | 10th IEEE International Conference on Mobile Ad-Hoc and Sensor Systems, MASS 2013 |
---|---|
Country/Territory | China |
City | Hangzhou |
Period | 14/10/13 → 16/10/13 |
Keywords
- Ad hoc network
- Anonymity
- Cooperative caching
- Data cache
- Privacy
ASJC Scopus subject areas
- Computer Networks and Communications