Location Verification Algorithm Research Articles

Location verification algorithm of wearable sensors for wireless body area networks.

BACKGROUND: Knowledge of the location of sensor devices is crucial for many medical applications of wireless body area networks, as wearable sensors are designed to monitor vital signs of a patient while the wearer still has the freedom of movement. However, clinicians or patients can misplace the wearable sensors, thereby causing a mismatch between their physical locations and their correct target positions. An error of more than a few centimeters raises the risk of mistreating patients.OBJECTIVE: The present study aims to develop a scheme to calculate and detect the position of wearable sensors without beacon nodes.METHODS: A new scheme was proposed to verify the location of wearable sensors mounted on the patient’s body by inferring differences in atmospheric air pressure and received signal strength indication measurements from wearable sensors. Extensive two-sample tests were performed to validate the proposed scheme.RESULTS: The proposed scheme could easily recognize a 30-cm horizontal body range and a 65-cm vertical body range to correctly perform sensor localization and limb identification.CONCLUSIONS: All experiments indicate that the scheme is suitable for identifying wearable sensor positions in an indoor environment.

Location verification algorithm of wearable sensors for wireless body area networks

Location verification algorithm of wearable sensors for wireless body area networks

Location Verification of Wireless Internet Clients: Evaluation and Improvements

Client Presence Verification (CPV) was proposed in previous literature as a delay-based location verification algorithm that iteratively estimates Internet delays to corroborate assertions about a client’s geographic presence in a prescribed region, e.g., before granting access to a location-based service. We evaluate CPV’s performance in the presence of clients that use 802.11 networks by analyzing the following factors: the number of such clients in the network, how far adversaries are from their true locations, and the number of CPV iterations required to neutralize the effect of wireless networks. We use a mix of real-world traffic measurements from PlanetLab and existing wireless-delay probability models to create the evaluation datasets. The results indicate that, while wireless delays affect CPV’s performance (e.g., from 3 to $\sim$ 4.7 percent false reject/accept rates), CPV can mitigate the impact of such delays by performing more delay measurements prior to location verification. This work highlights the importance of including mitigation capabilities while designing security-sensitive applications and protocols to deal with the effect of wireless delays. This will become increasingly important with the ubiquitous use of mobile devices that is expected to increase with the introduction of new computing and communication paradigms such as the Internet of Things.

Collaborative Localization and Location Verification in WSNs.

Localization is one of the most important technologies in wireless sensor networks. A lightweight distributed node localization scheme is proposed by considering the limited computational capacity of WSNs. The proposed scheme introduces the virtual force model to determine the location by incremental refinement. Aiming at solving the drifting problem and malicious anchor problem, a location verification algorithm based on the virtual force mode is presented. In addition, an anchor promotion algorithm using the localization reliability model is proposed to re-locate the drifted nodes. Extended simulation experiments indicate that the localization algorithm has relatively high precision and the location verification algorithm has relatively high accuracy. The communication overhead of these algorithms is relative low, and the whole set of reliable localization methods is practical as well as comprehensive.

SGOR: Secure and scalable geographic opportunistic routing with received signal strength in WSNs

Wireless sensor networks (WSNs) are inherently susceptible to attacks as malicious nodes can disrupt the communication from any other node to the sink. To address a wide range of attacks, we propose a novel and comprehensive approach called Secure and Scalable Geographic Opportunistic Routing with received signal strength (SGOR), satisfying the requirements of both security and scalability in WSNs. Unlike most of previous secure protocols relying on infrastructure like anchor nodes, a distributed location verification algorithm is presented to utilize the received signal strength to address the location spoofing attack. As one of opportunistic geographic routings, SGOR provides the property of robustness by taking full advantage of the broadcast nature of wireless channels, and scalability for being inherited from geographic routing. Moreover, an ambient-sensitive trust model is proposed to defend against more kinds of attackers in SGOR. The theoretical results are given to demonstrate the effectiveness and robustness of SGOR to survive more severe attacks. In extensive simulations, we compare SGOR with four other representative protocols. The results show that SGOR achieves about two times higher packet delivery rate with acceptable overhead, particularly in large and highly hostile networks.

Location-aware, Trust-based Detection and Isolation of Compromised Nodes in Wireless Sensor Networks

The detection and isolation of compromised nodes in wireless sensor networks is a difficult task. However, failure to identify and isolate compromised nodes results in significant security breaches which lowers the integrity of gathered data. Using a reputation-based trust framework for wireless sensor networks we introduce a location-aware, trust-based protocol that detects and isolates compromised nodes. We employ a secure cluster formation algorithm to facilitate the establishment of trusted clusters via pre-distributed keys. Reputation and trust is built over time through the monitoring of neighboring nodes. Our scheme provides a mechanism for developing reputation and trust so that a device can determine whether other devices have been compromised, and take corrective action, through negative information sharing and independent trust-based decision making. We also present a simple location verification algorithm that utilizes the received signal strength information in the process of verifying reported location information. The effectiveness of our approach in the detection and isolation of compromise nodes is validated through simulation. The results indicate that our scheme provides an effective mechanism for detecting and isolating compromised colluding nodes.

Secure probabilistic location verification in randomly deployed wireless sensor networks

Security plays an important role in the ability to deploy and retrieve trustworthy data from a wireless sensor network. Location verification is an effective defense against attacks which take advantage of a lack, or compromise, of location information. In this work, a secure probabilistic location verification method for randomly deployed dense sensor networks is proposed. The proposed Probabilistic Location Verification (PLV) algorithm leverages the probabilistic dependence of the number of hops a broadcast packet traverses to reach a destination and the Euclidean distance between the source and the destination. A small number of verifier nodes are used to determine the plausibility of the claimed location, which is represented by a real number between zero and one. Using the calculated plausibility metric, it is possible to create arbitrary number of trust levels in the location claimed. Simulation studies verify that the proposed solution provides high performance in face of various types of attacks.

Location verification and trust management for resilient geographic routing

In this paper, we consider the security of geographic routing (GR) protocols. In GR, neighbors exchange their location information. Based on this information, a node forwards packets to the neighbor that is closest to the destination. Although GR is widely used in ad hoc and wireless sensor networks, its security has rarely been studied; there are a number of attacks that are possible on GR. In one attack, misbehaving nodes can falsify their location information. Also, malicious nodes can drop packets that they need to forward towards the destination. The first contribution of the paper is to propose a location verification algorithm to address the attacks falsifying the location information. The second contribution of the paper is to propose approaches for trust-based multi-path routing, aiming to defeat attacks on GR. We discuss the proposed approaches in detail, outlining possible attacks and defenses against them. In addition, we show, via simulation, how trust-based route selection is able to circumvent attackers and route around them. This paper summarizes and extends results reported by the authors in a previous article [K.-D.K. Nael, B. Abu-Ghazaleh, K. Liu, Towards resilient routing in WSNs, in: Proceedings of the First IEEE/ACM Workshop on QoS and Security in Wireless Networks (Q2SWinet 2005), 2005, pp. 71–78].