Secure Data Collection in Wireless Sensor Networks Using Randomized Dispersive Routes

Abstract

Abstract-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 multi-path 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 energyefficient, 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.Index Terms-Randomized multi-path routing, wireless sensor network, secure data delivery.

Energy-efficient and reliable data collection in wireless sensor networks

“…Due to their hostile and unattended environment, there is a very high chance of nodes being compromised in a WSN. A compromised node (CN) attack is an attack in which an adversary compromises a certain subset of nodes to passively intercept data packets traversing the compromised nodes [8,9]. Through simulations, this paper validates the vulnerability of secret sharing schemes under the relaxation of a secure area around the BS.…”

“…In addition, the presence of an adversary near the BS was not considered in their approach. The work in [9] addresses the shortcomings of H-SPREAD by using the randomized and highly dispersive nature of routing. This approach increased security compared to H-SPREAD with the help of random dispersion.…”

“…With advances in technology, today's sensor nodes can gather and process more data, leading to the creation of new applications in recent years. To achieve cost effectiveness, sensor nodes are not typically equipped with tamper-proof facilities [1][2][3][4][5][6][7][8][9][10][11][12][13]. Due to their hostile and unattended environment, there is a very high chance of nodes being compromised in a WSN.…”

Detection of Insider Selective Forwarding Attack Based on Monitor Node and Trust Mechanism in WSN

“…Karlof and Wagner [9] mentioned k disjoint multipath routing avoidance can completely defend against selective forwarding involving at most k compromised nodes. Several works illustrating that multipath routing defends against packet dropping attack can be found in [10] [11]. Although using this mechanism can make the information transmitted to BS more effectively, the communication cost is very high.…”

Security against Selective Forward Attack in Wireless Sensor Network

“…As long as the malicious nodes, including compromised nodes and outside jammers, cause more packet loss than a normal node does at a certain channel error rate, the attacks are always detectable. Tao Shu et al [10] proposed a mechanism that generates randomized multi-path routes. Under their design, the route taken by the "shares" of different packets change over time.…”