Abstract
We investigate an understudied threat: networks of stealthy routers (S-Routers), relaying messages to a hidden destination. The S-Routers relay communication along a path of multiple short-range, low-energy hops, to avoid remote localization by triangulation. Mobile devices called Interceptors can detect communication by an S-Router, but only when the Interceptor is next to the transmitting S-Router. We examine algorithms for a set of mobile Interceptors to find the destination of the communication relayed by the S-Routers. The algorithms are compared according to the number of communicating rounds before the destination is found, i.e., rounds in which data is transmitted from the source to the destination. We evaluate the algorithms analytically and using simulations, including against a parametric, optimized strategy for the S-Routers. Our main result is an Interceptors algorithm that bounds the expected number of communicating rounds by a term quasilinear in the number of S-Routers. For the case where S-Routers transmit at every round ("continuously"), we present an algorithm that improves this bound.
| Original language | English |
|---|---|
| Article number | 10 |
| Journal | ACM Transactions on Sensor Networks |
| Volume | 17 |
| Issue number | 2 |
| DOIs | |
| State | Published - Jun 2021 |
Bibliographical note
Publisher Copyright:© 2021 ACM.
Funding
This work was supported by the Israeli Ministry of Science and Technology. Authors’ addresses: M. B. A. Bessos, Bar-Ilan University, 5290002, Ramat Gan, Israel; email: [email protected]; A. Herzberg, University of Connecticut, 371 Fairfield Way, Storrs, Connecticut, USA; email: [email protected]. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]. © 2021 Association for Computing Machinery. 1550-4859/2021/03-ART10 $15.00 https://doi.org/10.1145/3431223
| Funders | Funder number |
|---|---|
| Ministry of science and technology, Israel |
Keywords
- Stealthy networks interception