TCSLP: A trace cost based source location privacy protection scheme in WSNs for smart cities

Source location privacy (SLP) protection is an emerging research topic in wireless sensor networks. Because the source location represents the valuable information of the target being monitored and tracked, it is of great practical significance to achieve a high degree of privacy of the source location. Although many studies based on phantom nodes have alleviates the protection of SLP to some extent. It is urgent to solve the problems, such as complicate the ac path between nodes, improve the centralized distribution of phantom nodes near the source nodes and reduce the network communication overhead. In this paper, protection scheme based on sector phantom routing (PSSPR) routing is proposed as a visible approach to address SLP issues. We use the coordinates of the center node V to divide sector domain, which act an important role in generating a new phantom node. The phantom nodes perform specified routing policies to ensure that they can choose various locations. In addition, the directed random route can ensure that data packets avoid the visible range when they move to the sink node hop by hop. Thus, the source location is protected. Theoretical analysis and simulation experiments show that this protocol achieves higher security of source node location with less communication overhead.

Source-location privacy (SLP) protection improves security in event monitoring wireless sensor networks (WSNs) for Internet of Things (IoT) applications. However, due to constrained energy resources, WSNs incur coverage holes that affect the level of SLP protection. Existing studies have ineffectively analysed the effects of coverage holes on SLP protection. Noting the limitation, this study investigated the coverage hole effects. Performance of various SLP routing protocols was evaluated based on the sensor node utilization ratio, attack success rate, end-to-end delay, and packet delivery ratio. Then, considering the challenge of limited battery power in IoT sensors, the performance gains and limitations of the protocols were identified. Simulation results demonstrate that the data dissemination SLP routing protocol (DIRP) outperforms other protocols. However, the performance of DIRP is significantly affected by coverage holes. The results suggest that for DIRP to be viable in IoT applications, the integration of distributed energy resources should be considered.

Privacy, especially source location privacy in many Wireless Sensor Networks (WSNs) applications plays an important role in the effectiveness of these applications. Exposure of source location information in these applications may put the monitored entities or subjects in danger. Many solutions are available based on various techniques, including random walk. Most existing random walk based source location privacy preservation proposals may not work well in critical applications, because of their insufficient safety period, high energy consumption, and data delivery delay. This article proposes a novel solution for source location privacy in WSNs based on a random walk routing, especially for patient attackers to improve safety period and energy efficiency. The proposed strategy forms an Isolated Adversary Zone (IAZ) by sacrificing a certain percentage of sensor nodes and entraps patient attackers in that zone. This approach will increase safety period and energy efficiency in compared to the existing approaches as an entrapped patient attacker will wait for long time to make an attack.

With a growing demand for the development of smart ocean projects, the Internet of Underwater Things (IoUT) integrating multiple networks will gradually become the mainstream, particularly for civil, commercial, and military scenarios. During development, however, the security aspect cannot be ignored. Faced with possible future battles on the ocean, this study focuses on underwater source location privacy protection for both static and mobile sources. By combining the Ekman drift model, location privacy protection is converted into multi-round gaming between the source and adversary, in which two ways of gaming on nodes, autonomous underwater vehicle (AUV), and adversary are adopted to protect the static source location. Because the location of the mobile source, such as underwater intelligent agent, changes regularly, the protection for this type of source is focused on the trajectory, preventing the mobile source from being tracked. This paper aims to protect the location privacy of the static source first and then initial attempts to protect the dynamic source location privacy. By fuzzing the remaining semantic information after the mobile source passes by, the trajectory of the mobile source is protected, thereby protecting its location privacy. Compared with existing algorithms, the simulation results of the proposed scheme indicate the probability that the source has been captured. Furthermore, the results show that the period of safety of the proposed algorithm is longer than that of a multi-hop-based location privacy protection scheme but shorter than that of an autonomous underwater vehicle based scheme. Although the difference in the energy consumption of the nodes among the compared schemes is little increased, the delay varies significantly.

An adversary can deploy parasitic sensor nodes into wireless sensor networks to collect radio traffic distributions and trace back messages to their source nodes. Then, he can locate the monitored targets around the source nodes with a high probability. In this paper, a Source-location privacy Protection scheme based on Anonymity Cloud (SPAC) is proposed. We first design a light-weight (t, n)-threshold message sharing scheme and map the original message to a set of message shares which are shorter in length and can be processed and delivered with minimal energy consumption. Based on the shares, the source node constructs an anonymity cloud with an irregular shape around itself to protect its location privacy. Specifically, an anonymity cloud is a set of active nodes with similar radio actions and they are statistically indistinguishable from each other. The size of the cloud is controlled by the preset number of hops that the shares can walk in the cloud. At the border of the cloud, the fake source nodes independently send the shares to the sink node through proper routing algorithms. At last, the original message can be recovered by the sink node once at least t shares are received. The simulation results demonstrate that the SPAC can strongly protect the source-location privacy in an efficient manner. Moreover, the message sharing mechanism of SPAC increases the confidentiality of network data and it also brings high tolerance for the failures of sensor nodes to the data transmission process.

A scheme for WSNs (wireless sensor networks) security is given by dividing sensing tetrahedron into clusters and using the symmetric polynomials in this paper.The sensing tetrahedron is divided into a number of small grids.All those sensor nodes, both ordinary sensor nodes and heterogeneous sensor nodes are distributed in the sensing tetrahedron.In a grid, all ordinary sensor nodes and heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.All the heterogeneous sensor nodes establish their shared keys through using the symmetric polynomials.At last, all sensor nodes establish their keys directly or indirectly in the whole sensing tetrahedron.Analysis and comparison demonstrate this scheme enhances the WSN security, has good network connectivity, saves node storage, reduces network computing load, and extends the network lifetime.

Heterogeneous network convergence and handover have become very hot in recent years. This paper proposed an efficient handover scheme in Multi-PAN Wireless Sensor Networks (WSNs). A number of edge nodes are set at the edge of each Personal Area Networks (PANs). A user equipment (UE), which has WSN and cellular network interface, acts as sensor node or mobile cluster head in WSN area. Thus, edge early warning can be acquired from edge nodes and neighbor channel information can be acquired with BS-assistance. Simulation results show that low transmission interrupted delay and low energy consumption can be achieved compared with conventional scheme in WSN.

For the vulnerability of wireless transmission medium wireless sensor networks (WSNs) face severe privacy problem. To protect the source location privacy, this paper proposes a novel Angle-Based Directed Random Walk (ABDRW) routing protocol, which makes the selection of phantom source more flexible and the distribution relatively uniform. What's more, this approach can generate more different phantom sources that are far away from the real source, and thus enhances the source location privacy protection. Comparing with several existing typical methods such as sector-based directed random walk, hop-based directed random walk and RRIN, our proposed ABDRW protocol can reach higher source location privacy protection through flexible selection and more uniform distribution of phantom source.

Wireless sensor networks (WSN) have the potential to be widely used in many areas for unattended event monitoring. Mainly due to lack of a protected physical boundary, wireless communications are vulnerable to unauthorized interception and detection. Privacy is becoming one of the major issues that jeopardize the successful deployment of wireless sensor networks. While confidentiality of the message can be ensured through content encryption, it is much more difficult to adequately address the source-location privacy. For WSN, source-location privacy service is further complicated by the fact that the sensor nodes consist of low-cost and low-power radio devices. Therefore, computationally intensive cryptographic algorithms (such as public-key cryptosystems) and large scale broadcasting-based protocols are not suitable for WSN. In this paper, we propose a scheme to provide both content confidentiality and source-location privacy through routing to randomly selected intermediate nodes. While being able to provide source-location privacy for WSN, our simulation results also demonstrate that the proposed scheme is efficient and can be used for practical applications.

Source location privacy is becoming an increasingly important property in wireless sensor network applications, such as asset monitoring. The original source location problem is to protect the location of a source in a wireless sensor network from a single distributed eavesdropper attack. Several techniques have been proposed to address the source location problem, where most of these apply some form of traffic analysis and engineering to provide enhanced privacy. One such technique, namely fake sources, has proved to be promising for providing source location privacy. Recent research has concentrated on investigating the efficiency of fake source approaches under various attacker models. In this paper, we (i) provide a novel formalisation of the source location privacy problem, (ii) prove the source location privacy problem to be NP-complete, and (iii) provide a heuristic that yields an optimal level of privacy under appropriate parameterisation. Crucially, the results presented show that fake sources can provide a high, sometimes optimal, level of privacy.

Source location privacy, occupying an unshakable status in wireless sensor networks, has a profound influence on the widespread application of wireless sensor networks (WSNs). Most privacy policies that introduce phantom nodes to the source location have the problem that the transmission path between the phantom node and the source is not diversified enough, and the phantom node area is close to the source. For this reason, a source location privacy protection scheme based on sector domain phantom routing is proposed. The scheme uses the sector domain and the coordinates of the central node <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$V$</tex> to increase the geographical position diversity of the phantom node, which completely avoids the visible and protects the security of the source location. Theoretical analysis and simulation results show that our scheme can enhance the security of source position.

There exist numerous strategies for Source Location Privacy (SLP) routing schemes. In this study, an experimental analysis of a few routing schemes is done to investigate the influence of the routing scheme algorithms on the privacy protection level and the network lifetime performance. The analysis involved four categories of SLP routing schemes. Analysis results revealed that the algorithms used in the representative schemes for tree-based and angle-based routing schemes incur the highest influence. The tree-based algorithm stimulates the highest energy consumption with the lowest network lifetime while the angle-based algorithm does the opposite. Moreover, for the tree-based algorithm, the influence is highly dependent on the region of the network domain.

Recently, Wireless Sensor Networks (WSNs) have been extensively employed in several tactical applications out of which target detection, habit monitoring, and earthquake monitoring. The open characteristic nature of WSNs makes it vulnerable to be attacked by an eavesdropper who aims at disrupting the network operation or access confidential information. Consequently, ensuring the security and privacy in WSNs is considered an essential issue and definitely cannot be left without proper investigations. There are two types of threats that may occur for the WSNs privacy, that are, contextual and content privacy. Location privacy is considered an example of contextual privacy. In this paper, three source privacy protection schemes, which are based on clustering methodology, are proposed to protect contextual privacy. These schemes are dynamic shortest path (DSP) scheme, dynamic tree (DT) scheme, and hybrid scheme. Interestingly, a grid-based clustering technique is adopted to divide the network into several square clusters. Matlab simulations are used to evaluate the performance of the three proposed schemes in terms of latency, energy consumption, and safety period. The results undoubtedly confirm the effectiveness of the proposed schemes. Very high safety period is achieved and an adequate amount of energy is consumed. Furthermore, acceptable latency is achieved when compared to the shortest path scheme.

Toward resolving the source-location privacy protection issue in Wireless Sensor Networks (WSNs), a Pseudo Normal Distribution-based Phantom Routing (PNDBPR) protocol is proposed in this paper. The proposed protocol is composed of two critical phases: 1) adjusting the value of minimum-hops between a phantom node and its source, and varying the area of the phantom node distribution region at the network deployment stage; 2) generating a set of Gaussian-distributed random real numbers using the Pseudo Random Generator when the source node is transmitting data packets, and calculating the corresponding random walk hops. Theoretical analyses and simulation results show that PNDBPR can dramatically improve the diversity and the dynamicity of the phantom nodes distribution at the expense of a slight increase in communication overheads when compared with the existing PUSBRF (Source Location Privacy Preservation Protocol in Wireless Sensor Network Using Source Based Restricted Flooding) and HBDRW(A hop-based directed random walk) protocols.

The sensor nodes are independent and work as sender, receiver and intermediate node in Wireless Sensor Network (WSN). The sensor nodes are forming the small network in which the one or more sender is sending data to one destination/s through intermediate nodes or sending information to Base Station (BS). The information collect by base station is further analyzed. The nodes are also static or mobile depends on the situation or conditions. The connection establishment and data sending is possible through routing protocols of WSN. The routing protocols of WSN are not same as traditional wireless routing protocols. One major issue on this network is security. The routing protocols are sending information to destination from particular source and the routing strategy is provides the better way of delivery in the network. The sensor nodes in network are performing through limited battery supply called node energy or power. The attacker are also affected the limited energy resource. In this paper the center of consideration is on the security issues related to WSN routing protocols. The routing in WSN remains a key issue because of that without accurately functioning of routing protocols, the network cleanly will not work the technique it's intended to. Unfortunately, routing also one of the most difficult to protect against attacks malicious activities because of the administration in WSN. The better protection scheme is provides the complete security from attacks and the secure routing is provides the better and trustful network performance.