Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2106.07709

Eavesdropper and Jammer Selection in Wireless Source Localization Networks

Cuneyd Ozturk·Sinan Gezici
View original source ↗Read source document ↗Export metadata ↓

Abstract

We consider a wireless source localization network in which a target node emits localization signals that are used by anchor nodes to estimate the target node position. In addition to target and anchor nodes, there can also exist eavesdropper nodes and jammer nodes which aim to estimate the position of the target node and to degrade the accuracy of localization, respectively. We first propose the problem of eavesdropper selection with the goal of optimally placing a given number of eavesdropper nodes to a subset of possible positions in the network to estimate the target node position as accurately as possible. As the performance metric, the Cramer-Rao lower bound (CRLB) related to the estimation of the target node position by eavesdropper nodes is derived, and its convexity and monotonicity properties are investigated. By relaxing the integer constraints, the eavesdropper selection problem is approximated by a convex optimization problem and algorithms are proposed for eavesdropper selection. Moreover, in the presence of parameter uncertainty, a robust version of the eavesdropper selection problem is developed. Then, the problem of jammer selection is proposed where the aim is to optimally place a given number of jammer nodes to a subset of possible positions for degrading the localization accuracy of the network as much as possible. A CRLB expression from the literature is used as the performance metric, and its concavity and monotonicity properties are derived. Also, a convex optimization problem and its robust version are derived after relaxation. Moreover, the joint eavesdropper and jammer selection problem is proposed with the goal of placing certain numbers of eavesdropper and jammer nodes to a subset of possible positions. Simulation results are presented to illustrate performance of the proposed algorithms.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Cuneyd Ozturk, Sinan Gezici. 2021-06-14. Eavesdropper and Jammer Selection in Wireless Source Localization Networks. https://doi.org/10.1109/tsp.2021.3098465

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗