Search arXivSearch

arXiv · 1005.0072

HyberLoc: Providing Physical Layer Location Privacy in Hybrid Sensor Networks

Abstract

In many hybrid wireless sensor networks' applications, sensor nodes are deployed in hostile environments where trusted and un-trusted nodes co-exist. In anchor-based hybrid networks, it becomes important to allow trusted nodes to gain full access to the location information transmitted in beacon frames while, at the same time, prevent un-trusted nodes from using this information. The main challenge is that un-trusted nodes can measure the physical signal transmitted from anchor nodes, even if these nodes encrypt their transmission. Using the measured signal strength, un-trusted nodes can still tri-laterate the location of anchor nodes. In this paper, we propose HyberLoc, an algorithm that provides anchor physical layer location privacy in anchor-based hybrid sensor networks. The idea is for anchor nodes to dynamically change their transmission power following a certain probability distribution, degrading the localization accuracy at un-trusted nodes while maintaining high localization accuracy at trusted nodes. Given an average power constraint, our analysis shows that the discretized exponential distribution is the distribution that maximizes location uncertainty at the untrusted nodes. Detailed evaluation through analysis, simulation, and implementation shows that HyberLoc gives trusted nodes up to 3.5 times better localization accuracy as compared to untrusted nodes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Rania El-Badry, Ahmed Sultan, Moustafa Youssef. 2010-05-01. HyberLoc: Providing Physical Layer Location Privacy in Hybrid Sensor Networks. https://arxiv.org/abs/1005.0072

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Fundamental Scaling Laws of Covert Communication in the Presence of Block Fading

Covert communication is the undetected transmission of sensitive information over a communication channel. In wireless communication systems, channel impairments such as signal fading present challenges in the effective implementation and analysis of covert communication systems. This paper generalizes early work in the covert communication field by considering asymptotic results for the number of bits that can be covertly transmitted in $n$ channel uses on a block fading channel. Critical to the investigation is characterizing the performance of optimal detectors at the adversary. Matching achievable and converse results are presented.

cs.IT

Sequence Reconstruction over the Deletion Channel

In this paper, we consider the Levenshtein's sequence reconstruction problem in the case where the transmitted codeword is chosen from $\{0,1\}^n$ and the channel can delete up to $t$ symbols from the transmitted codeword. We determine the minimum number of channel outputs (assuming that they are distinct) required to reconstruct a list of size $\ell-1$ of candidate sequences, one of which corresponds to the original transmitted sequence. More specifically, we determine the maximum possible size of the intersection of $\ell \geq 3$ deletion balls of radius $t$ centered at $x_1, x_2, \dots, x_{\ell}$, where $x_i \in \{0,1\}^n$ for all $i \in \{1,2,\dots,\ell\}$ and $x_i \neq x_j$ for $i \neq j$, with $ n \geq t+\ell-1$ and $t \geq 1$.

cs.IT

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT