Keywords: anonymous routing, pair-wise key, symmetric cryptography, wireless sensor networks, network security
Received March 19, 2009; revised July 20, 2009; accepted September 21, 2009.
Communicated by Rong-Hong Jan.
| Previous | [ 1] | [ 2] | [ 3] | [ 4] | [ 5] | [ 6] | [ 7] | [ 8] | [ 9] | [ 10] | [ 11] | [ 12] | [ 13] | [ 14] | [ 15] | [ 16] | [ 17] | [ 18] | [ 19] | [ 20] | [ 21] | [ 22] | [ 23] | [ 24] | [ 25] |
¡@
JEHN-RUEY JIANG1, JANG-PING SHEU1,2, CHING TU1 AND JIH-WEI WU1,3
1Department of Computer Science and Information Engineering
National Central University
Chungli, 320 Taiwan
2Department of Computer Science
National Tsing Hua University
Hsinchu, 300 Taiwan
3Department of Informational Management
Lan-Yang Institute of Technology
Ilan, 261 Taiwan
How to secure data communication is an important problem in wireless sensor networks
(WSNs). General solutions to the problem are to encrypt the packet payload with
symmetric keys. But those solutions only prevent the packet content from being snooped
or tampered. Adversaries still can learn of network topology by the traffic analysis attack
for starting devastating attacks such as the denial-of-service attack and the like. In this
paper, we propose an anonymous path routing (APR) protocol for WSNs. In APR, data are
encrypted by pair-wise keys and transmitted with anonyms between neighboring sensor
nodes and anonyms between the source and destination nodes of a multi-hop communication
path. The encryption prevents adversaries from disclosing the data, and the anonymous
communication prevents adversaries from observing the relation of the packets for
further attacks. We implement APR on the MICAz platform to evaluate its overheads for
demonstrating its applicability in practical WSNs.
Received March 19, 2009; revised July 20, 2009; accepted September 21, 2009.
Communicated by Rong-Hong Jan.