Location Privacy Of Nodes Research Articles

Location privacy protection of nodes in the perception layer of the Internet of things based on Radio Frequency Identification location aware algorithm

AbstractTo ensure the security of node location privacy in the perception layer of the Internet of Things, this study proposes a location privacy protection method based on RFID location awareness algorithm. This method first introduces an adaptive multi tree anti‐collision algorithm based on collision trees when perceiving and locating the location information of nodes in the perception layer of the Internet of Things, to prevent signal collisions between multiple readers and writers. Then, based on the obtained node location results, a IoT perception layer node location privacy protection scheme based on virtual ring strategy is used to randomly initiate directed co hop routing using the virtual nodes generated after random walking, avoiding the visible area of the source node location, and transmitting data to the aggregation node in the form of the shortest routing path to protect the privacy and security of the node location. Finally, experiments are carried out to prove the progressiveness of the proposed method. The experimental results show that this method can prolong the security period of the source and aggregation nodes in the perception layer of the Internet of Things, protect the privacy and security of node positions, and has great application value.

Node Location Privacy Protection in Unattended Wireless Sensor Networks

Node location protection is critical to the wireless sensor networks (WSN), especially for unattended environment. However, due to most of the static deployment and the limitations in energy, storage, and communication capabilities of the sensors, WSNs are vulnerable to various location (and derivative) attacks. In this work, we study the node location privacy protection issue from both aspects of attacks and defenses. First, we present a new two-phase location attack for two important types of nodes (including base station and source node). It can locate a base station node within few amounts of local wireless transmission monitoring and then reversely trace the location of the source node. Different from existing methods, the proposed attack determines the node location based on the transmission direction, which can break through existing defenses. Then, to defend against such attacks, we design a pseudospiral-based routing protocol for WSN. We analyze the performance of parameters such as routing probability, maximum detectable angle, hop count, and number of loops based on PU SBRF, MoRF, and PLAUDIT methods. The theory analysis and confrontation experiment of attack and defense show that the proposed scheme can protect the location privacy of the target node with moderate communication and computation overhead.

C2S2‐LOOP: Circular Chessboard‐Based Secure Source Location Privacy Model Using ECC‐ALO in WSN

Source location privacy (SLP) is a serious issue in wireless sensor networks (WSN) since Eavesdroppers tries to determine the source location. Hunting Animals in Forest is considered as an example for SLP. Many conventional schemes have been proposed for SLP in WSN, namely, Random Walk Routing, and Fake Messages Transmission, which cause critical issues (less safety period, packet delivery latency, and high energy consumption). Furthermore, the security analysis is not properly investigated in any previous work. In this paper, we propose a new model called the circular chessboard‐based secure source location privacy model (C2S2‐LOOP) with the following tasks: key generation, network topology management (clustering), intercluster routing (travel plan), and data packets encryption. All sensor nodes are deployed in a circular chessboard (Circular Field) and the key generation (PUK, SEK) is invoked using elliptic curve cryptography (ECC) with Ant Lion Optimization algorithm, which mitigate the issues of conventional ECC. Then, the network topology is managed using clustering where residual energy of the nodes is used for Cluster Head (CH) selection. Intercluster routing is implemented using packet traversing using clockwise and anticlockwise directions, which are mainly concerned with establishing a secure route between the source to the destination node. To ensure data security, we present the Chaotic Artificial Neural Network (C‐ANN) in which encryption is executed. Assume that CH near to the source node has a high trust value, then it traverses (clock‐wise) real packets towards sink node and similarly in the left side region (anticlockwise), fake packets are transmitted. Network simulations (OMNeT++) are evaluated and compared with the previous approaches, and finally, our proposed scheme concludes that it maintains not only source node location privacy (large safety period) and also reduces energy consumption by more than 40% and latency by more than 35%.

SPS and DPS: Two New Grid-Based Source Location Privacy Protection Schemes in Wireless Sensor Networks.

Wireless Sensor Networks (WSNs) have been widely deployed to monitor valuable objects. In these applications, the sensor node senses the existence of objects and transmitting data packets to the sink node (SN) in a multi hop fashion. The SN is a powerful node with high performance and is used to collect all the information sensed by the sensor nodes. Due to the open nature of the wireless medium, it is easy for an adversary to trace back along the routing path of the packets and get the location of the source node. Once adversaries have got the source node location, they can capture the monitored targets. Thus, it is important to protect the source node location privacy in WSNs. Many methods have been proposed to deal with this source location privacy protection problem, and most of them provide routing path diversity by using phantom node (PN) which is a fake source node used to entice the adversaries away from the actual source node. But in the existing schemes, the PN is determined by the source node via flooding, which not only consumes a lot of communication overhead, but also shortens the safety period of the source node. In view of the above problems, we propose two new grid-based source location privacy protection schemes in WSNs called grid-based single phantom node source location privacy protection scheme (SPS) and grid-based dual phantom node source location privacy protection scheme (DPS) in this paper. Different from the idea of determining the phantom node by the source node in the existing schemes, we propose to use powerful sink node to help the source node to determine the phantom node candidate set (PNCS), from which the source node randomly selects a phantom node acting as a fake source node. We evaluate our schemes through theoretical analysis and experiments. Experimental results show that compared with other schemes, our proposed schemes are more efficient and achieves higher security, as well as keeping lower total energy consumption. Our proposed schemes can protect the location privacy of the source node even in resource-constrained wireless network environments.

Node Location Privacy Protection Based on Differentially Private Grids in Industrial Wireless Sensor Networks

Wireless sensor networks (WSNs) are widely applied in industrial application with the rapid development of Industry 4.0. Combining with centralized cloud platform, the enormous computational power is provided for data analysis, such as strategy control and policy making. However, the data analysis and mining will bring the issue of privacy leakage since sensors will collect varieties of data including sensitive location information of monitored objects. Differential privacy is a novel technique that can prevent compromising single record benefits. Geospatial data can be indexed by a tree structure; however, existing differentially private release methods pay no attention to the concrete analysis about the partition granularity of data domains. Based on the overall analysis of noise error and non-uniformity error, this paper proposes a data domain partitioning model, which is more accurate to choose the grid size. A uniform grid release method is put forward based on this model. In order to further reduce the errors, similar cells are merged, and then noise is added into the merged cells. Results show that our method significantly improves the query accuracy compared with other existing methods.

Performance Analysis of Location Privacy Preserving Scheme for MANETs

We consider the problem of preserving node's location privacy which is essential for minimizing the attacks during multi-hop routing in MANETs. As by intercepting and analyzing the transmitted packets, intermediate nodes (conventionally, assumed to be trustworthy) can track sender and receiver nodes, and can also trace the route between them. Earlier approaches attempts to preserve the location privacy by changing node-IDs or masking the location information, but results in high cost and degradation of service quality. To overcome these drawbacks, this paper presents: 1) a novel rough set based Location Privacy Preserving (LPP) scheme during route establishment; and 2) an efficient Data Transfer scheme for Location Privacy Preserving based Routes (DTLPPR) during data transfer. Analysis of trustworthiness of neighbor nodes using Discrete Time Markov Chain, and proposed scheme in terms of location privacy and route untraced ability is presented. Analytical work is validated using simulations.

무선 센서 네트워크에서의 통신 경로 은닉

무선 센서 네트워크에 대한 전역 도청에 대응하여 통신 경로 상의 노드들을 은닉하기 위해서는 네트워크 전반에 걸쳐 수많은 속임수용 더미 패킷들이 발행되어야한다. 이 논문에서는 모바일 싱크(기지국)와 근원지들을 포함하는 일정 크기의 원 형태 내에 존재하는 노드들로 국한되는 플러딩 기반의 데이터 전송 프로토콜을 제안하여 노드들의 위치 기밀을 유지하고 생성되는 더미 패킷들의 수를 감축하고자 한다. 플러딩 크기는 보안 수준과 통신 비용을 고려하여 결정할 수 있다. 제안 프로토콜을 설계하고 주요 특성을 검증한다. Tremendous amount of dummy packets are generally generated for faking over a wireless sensor network so as to keep the location privacy of nodes on the communication paths against the global eavesdropping. In this paper, a scoped-flooding protocol is designed for transferring data between each source and mobile sink(aka, basestation) where, the only nodes within the scope are allowed to issue dummy packets at every idle time so that the location privacy of the nodes on the paths is kept and the amount of dummy packets is reduced to the extend of the flooding scope. The size of the flooding diameter can be taken into consideration of the privacy level and the communication cost. We design a detailed specification of the protocol and verify several properties.

A Deviated Location and Updated Node Identity based Security Scheme for Preserving Source Node Location Privacy in Wireless Sensor Network

With a increased area of the applications of WSN, the security mechanisms are rising issue of outmost concern. The most important challenges threatening the successful installation of sensor systems is its privacy. Many privacy-related issues has been addressed by security mechanisms, but one sensor network privacy issue that cannot be adequately addressed by network security is source-location privacy One important class of sensor-driven applications is to monitor a valuable resources. For instance, sensors will be deployed in places like natural habitats to monitor the activities of endangered animals, or may be used in military purposes. In these asset monitoring applications, it is important to provide security to the source sensor’s location. In this paper, we had proposed security scheme for preserving source node location privacy. We had developed a model assuming that attacker can monitor traffic in small area instead of whole network. Finally, we proposed a deviated location and updated node identity based scheme for efficiently protecting source node from hotspot locating attack. The protection scheme has shown the better performance which is proved by simulation results. The protection scheme has recovered the network performance in presence of attacker and provides attack free environment. General Terms Privacy, WSN, TCP