TY - JOUR
T1 - Secure data collection in wireless sensor networks using randomized dispersive routes
AU - Shu, Tao
AU - Krunz, Marwan
AU - Liu, Sisi
N1 - Funding Information:
A preliminary version of this paper was presented at the IEEE INFOCOM 2009 Mini-Conference. Part of this work was conducted while M. Krunz was a visiting researcher at the University of Carlos III, Madrid, and IMDEA Networks, Spain. This research was supported in part by the US National Science Foundation (under Grants CNS-0721935, CNS-0904681, and IIP-0832238), Raytheon, and the “Connection One” center. Any opinions, findings, conclusions, or recommendations expressed in this paper are those of the author(s) and do not necessarily reflect the views of the US National Science Foundation.
PY - 2010/7
Y1 - 2010/7
N2 - Compromised node and denial of service are two key attacks in wireless sensor networks (WSNs). In this paper, we study data delivery mechanisms that can with high probability circumvent black holes formed by these attacks. We argue that classic multipath routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. So once the adversary acquires the routing algorithm, it can compute the same routes known to the source, hence, making all information sent over these routes vulnerable to its attacks. In this paper, we develop mechanisms that generate randomized multipath routes. Under our designs, the routes taken by the shares of different packets change over time. So even if the routing algorithm becomes known to the adversary, the adversary still cannot pinpoint the routes traversed by each packet. Besides randomness, the generated routes are also highly dispersive and energy efficient, making them quite capable of circumventing black holes. We analytically investigate the security and energy performance of the proposed schemes. We also formulate an optimization problem to minimize the end-to-end energy consumption under given security constraints. Extensive simulations are conducted to verify the validity of our mechanisms.
AB - Compromised node and denial of service are two key attacks in wireless sensor networks (WSNs). In this paper, we study data delivery mechanisms that can with high probability circumvent black holes formed by these attacks. We argue that classic multipath routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. So once the adversary acquires the routing algorithm, it can compute the same routes known to the source, hence, making all information sent over these routes vulnerable to its attacks. In this paper, we develop mechanisms that generate randomized multipath routes. Under our designs, the routes taken by the shares of different packets change over time. So even if the routing algorithm becomes known to the adversary, the adversary still cannot pinpoint the routes traversed by each packet. Besides randomness, the generated routes are also highly dispersive and energy efficient, making them quite capable of circumventing black holes. We analytically investigate the security and energy performance of the proposed schemes. We also formulate an optimization problem to minimize the end-to-end energy consumption under given security constraints. Extensive simulations are conducted to verify the validity of our mechanisms.
KW - Randomized multipath routing
KW - Secure data delivery
KW - Wireless sensor network
UR - http://www.scopus.com/inward/record.url?scp=77952986444&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77952986444&partnerID=8YFLogxK
U2 - 10.1109/TMC.2010.36
DO - 10.1109/TMC.2010.36
M3 - Article
AN - SCOPUS:77952986444
SN - 1536-1233
VL - 9
SP - 941
EP - 954
JO - IEEE Transactions on Mobile Computing
JF - IEEE Transactions on Mobile Computing
IS - 7
M1 - 5432179
ER -