Abstract:
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 invalidationbased 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 a family 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. 1
Citations
|
1338
|
Dynamic Source Routing in Ad Hoc Wireless Networks, in
– Johnson, Maltz
- 1996
|
|
409
|
Z.: Securing Ad Hoc Networks
– Zhou, Haas
- 1999
|
|
354
|
Mitigating routing misbehavior in mobile ad hoc networks
– Marti, Guili, et al.
- 2001
|
|
306
|
Ariadne: A secure on-demand routing protocol for ad hoc networks
– Hu, Perrig, et al.
- 2002
|
|
260
|
Performance Comparison of Two On-demand Routing Protocols for Ad Hoc Networks
– Das, Perkins, et al.
- 2000
|
|
194
|
Multicast operation of the ad hoc on-demand distance vector routing protocol
– Royer, Perkins
- 1999
|
|
190
|
Packet leashes: A defense against wormhole attacks in wireless networks
– Hu, Perrig, et al.
- 2003
|
|
180
|
A secure routing protocol for ad hoc networks
– Dahill, Levine, et al.
- 2002
|
|
178
|
The quest for security in mobile ad hoc networks
– Hubaux, Buttyan, et al.
|
|
177
|
Sleepers and workaholics: Caching strategies in mobile environments
– Barbara, Imielinski
- 1994
|
|
163
|
A pairwise key pre-distribution scheme for wireless sensor networks
– Du, Deng, et al.
|
|
134
|
Intrusion detection in wireless ad hoc networks
– Zhang, Lee
- 2000
|
|
131
|
Efficient authentication and signing of multicast streams over lossy channels
– Perrig, Canetti, et al.
- 2000
|
|
58
|
Performance analysis of the CONFIDANT protocol: Cooperation of nodes – fairness in dynamic ad hoc networks
– Buchegger, Boudec
|
|
47
|
Detection and handling of MAC layer misbehavior in wireless networks
– Kyasanur, Vaidya
|
|
43
|
A Scalable Low-Latency Cache Invalidation Strategy for Mobile Environments
– Cao
- 2001
|
|
41
|
An Interleaved Hop-by-Hop Authentication Scheme for Filtering of Injected False Data
– Zhu, Setia, et al.
|
|
37
|
Effective location-guided tree construction algorithms for small group multicast
– Chen, Nahrstedt
|
|
30
|
On-Demand Multicast Routing
– Lee, Su, et al.
- 2000
|
|
28
|
Supporting cooperative caching in ad hoc networks
– Yin, Cao
- 2004
|
|
21
|
CUP: Controlled update propagation in peer-to-peer networks
– Roussopoulos, Baker
- 2003
|
|
19
|
Establishing Pairwise Keys
– Liu, Ning
|
|
17
|
Group rekeying for filtering false data in sensor networks: A predistribution and local collaboration-based approach
– Zhang, Cao
- 2005
|
|
10
|
The CMU Monarch Projects Wireless and Mobility Extensions to ns. http://www.monarch.cs.cmu.edu/cmu-ns.html
– Project
- 1999
|
|
8
|
Cooperative Cache-Based Data Access in Ad Hoc Networks
– Cao, Yin, et al.
- 2004
|
|
5
|
Prioritized Overlay Multicast in Mobile Ad Hoc Environments
– Xiao
- 2004
|