Decorrelating wireless sensor network traffic to inhibit traffic analysis attacks

被引:62
作者
Deng, Jing [1 ]
Han, Richard [1 ]
Mishra, Shivakant [1 ]
机构
[1] Univ Colorado, Dept Comp Sci, Boulder, CO 80309 USA
关键词
Sensor network security; Traffic analysis;
D O I
10.1016/j.pmcj.2005.12.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Typical packet traffic in a sensor network reveals pronounced patterns that allow an adversary analyzing packet traffic to deduce the location of a base station. Once discovered, the base station can be destroyed, rendering the entire sensor network inoperative, since a base station is a central point of data collection and hence failure. This paper investigates a suite of decorrelation countermeasures aimed at disguising the location of a base station against traffic analysis attacks. A set of basic countermeasures is described, including hop-by-hop reencryption of the packet to change its appearance, imposition of a uniform packet sending rate, and removal of correlation between a packet's receipt time and its forwarding time. More sophisticated countermeasures are described that introduce randomness into the path taken by a packet. Packets may also fork into multiple fake paths to further confuse an adversary. A technique is introduced to create multiple random areas of high communication activity called hot spots to deceive an adversary as to the true location of the base station. The effectiveness of these countermeasures against traffic analysis attacks is demonstrated analytically and via simulation using three evaluation criteria: total entropy of the network, total overhead/energy consumed, and the ability to frustrate heuristic-based search techniques to locate a base station. (C) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码:159 / 186
页数:28
相关论文
共 26 条
[1]  
Ahn L.V., 2003, 10 ACM C COMP COMM S, P112
[2]   Routing through the mist: Privacy preserving communication in ubiquitous computing environments [J].
Al-Muhtadi, J ;
Campbell, R ;
Kapadia, A ;
Mickunas, MD ;
Yi, S .
22ND INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS, PROCEEDINGS, 2002, :74-83
[3]   Random key predistribution schemes for sensor networks [J].
Chan, HW ;
Perrig, A ;
Song, D .
2003 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2003, :197-213
[4]  
Cook S.A., 1971, P 3 ANN ACM S THEOR, P151, DOI DOI 10.1145/800157.805047
[5]  
Deng J., 2004, IEEE 2014 INT C DEP
[6]  
Dingledine R, 2004, USENIX ASSOCIATION PROCEEDINGS OF THE 13TH USENIX SECURITY SYMPOSIUM, P303
[7]  
DU W, 2003, 10 ACM C COMP COMM S
[8]  
Eschenauer L., 2002, C COMP COMM SEC CCS
[9]   Onion Routing for anonymous and private Internet connections [J].
Goldschlag, D ;
Reed, M ;
Syverson, P .
COMMUNICATIONS OF THE ACM, 1999, 42 (02) :39-41
[10]  
Guan Y., 1999, 1999 IEEE MIL COMM C