TY - GEN
T1 - Defend against cache consistency attacks in wireless ad hoc networks
AU - Zhang, Wensheng
AU - Cao, Guohong
PY - 2005
Y1 - 2005
N2 - Caching techniques can be used to reduce bandwidth consumption and data access delay in wireless ad hoc networks. When cache is used, cache consistency issues must be addressed. To maintain strong cache consistency in some strategic scenarios (e.g., battle fields), the invalidation-based approach is preferred due to its low overhead. However, this approach may suffer from some security attacks. For example, a malicious node (intruder) may drop, insert or modify invalidation messages to mislead the receivers to use stale data or unnecessarily invalidate the data that is still valid. In this paper, we propose a solution based on the IR-based cache invalidation strategy to prevent intruders from dropping or modifying the invalidation messages. Although digital signatures can be used to protect IRs, it has significantly high overhead in terms of computation and bandwidth consumption. To address this problem, we propose afamily of randomized grouping based schemes for intrusion detection and damage recovery. Extensive analysis and simulations are used to evaluate the proposed schemes. The results show that our solution can achieve a good level of security with low overhead.
AB - Caching techniques can be used to reduce bandwidth consumption and data access delay in wireless ad hoc networks. When cache is used, cache consistency issues must be addressed. To maintain strong cache consistency in some strategic scenarios (e.g., battle fields), the invalidation-based approach is preferred due to its low overhead. However, this approach may suffer from some security attacks. For example, a malicious node (intruder) may drop, insert or modify invalidation messages to mislead the receivers to use stale data or unnecessarily invalidate the data that is still valid. In this paper, we propose a solution based on the IR-based cache invalidation strategy to prevent intruders from dropping or modifying the invalidation messages. Although digital signatures can be used to protect IRs, it has significantly high overhead in terms of computation and bandwidth consumption. To address this problem, we propose afamily of randomized grouping based schemes for intrusion detection and damage recovery. Extensive analysis and simulations are used to evaluate the proposed schemes. The results show that our solution can achieve a good level of security with low overhead.
UR - https://www.scopus.com/pages/publications/33749527576
UR - https://www.scopus.com/inward/citedby.url?scp=33749527576&partnerID=8YFLogxK
U2 - 10.1109/MOBIQUITOUS.2005.23
DO - 10.1109/MOBIQUITOUS.2005.23
M3 - Conference contribution
AN - SCOPUS:33749527576
SN - 0769523757
SN - 9780769523750
T3 - MobiQuitous 2005: Second Annual International Conference on Mobile and Ubiquitous Systems -Networking and Services
SP - 22
EP - 32
BT - MobiQuitous 2005
T2 - MobiQuitous 2005: Second Annual International Conference on Mobile and Ubiquitous Systems -Networking and Services
Y2 - 17 July 2005 through 21 July 2005
ER -