All-Direction Random Routing for Source-Location Privacy Protecting against Parasitic Sensor Networks

Abstract

Wireless sensor networks are deployed to monitor the surrounding physical environments and they also act as the physical environments of parasitic sensor networks, whose purpose is analyzing the contextual privacy and obtaining valuable information from the original wireless sensor networks. Recently, contextual privacy issues associated with wireless communication in open spaces have not been thoroughly addressed and one of the most important challenges is protecting the source locations of the valuable packages. In this paper, we design an all-direction random routing algorithm (ARR) for source-location protecting against parasitic sensor networks. For each package, the routing process of ARR is divided into three stages, i.e., selecting a proper agent node, delivering the package to the agent node from the source node, and sending it to the final destination from the agent node. In ARR, the agent nodes are randomly chosen in all directions by the source nodes using only local decisions, rather than knowing the whole topology of the networks. ARR can control the distributions of the routing paths in a very flexible way and it can guarantee that the routing paths with the same source and destination are totally different from each other. Therefore, it is extremely difficult for the parasitic sensor nodes to trace the packages back to the source nodes. Simulation results illustrate that ARR perfectly confuses the parasitic nodes and obviously outperforms traditional routing-based schemes in protecting source-location privacy, with a marginal increase in the communication overhead and energy consumption. In addition, ARR also requires much less energy than the cloud-based source-location privacy protection schemes.

Shortest Path Routing With Risk Control for Compromised Wireless Sensor Networks

“…To save energy, only the changed reputations are delivered and the sink node uses historical data for the nodes with unchanged reputations. Then the suspicious nodes can be detected by a reputation threshold and they can be divided into clusters by proper clustering algorithms (e.g., k-means and DBSCAN) [26]- [28] based on their locations. In this paper, the similarities between the suspicious nodes are defined as the Euclidean distance.…”

Strategic Location-Based Random Routing for Source Location Privacy in Wireless Sensor Networks

“…The source node starts sending event packets periodically to the sink node based on a multi-hop routing communication scheme. The network employs the k-nearest neighbor tracking approach [9] to track the asset. Nodes may follow a sleeping schedule, and are kept silent when no asset is detected.…”

“…Tree-based diversionary routing scheme was included in the analysis because it is one of the more recent proposed schemes which provide very high source location privacy. The random walk of the phantom single-path routing scheme was set to 20% of the hops between the source and the sink nodes [9]. The network simulation parameters are summarized in Table 1.…”

“…In phantom single-path routing and directional random routing, the selection of the next-hop node always obeys a constant rule which leads to short routing paths for source nodes in near-sink regions. Additionally, if the packets are from the same source node in the near-sink region, the routing paths become strongly related to each other and get closer and closer to each other, thus leading to poor privacy [8,9]. …”

An Untraceable Data Sharing Scheme in Wireless Sensor Networks

“…At the border of the cloud, the fake source nodes send the shares to the sink node independently. To hinder the adversary locating the cloud easily, we integrate the All-direction Random Routing algorithm (ARR) [21] into our scheme. In the ARR scheme, the relay node is defined as the nearest node to the virtual location that is randomly selected by the source node.…”