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.

中文翻译：

---

拦截隐形网络

我们调查了一个未被充分研究的威胁：隐形路由器网络（S-Routers）, 将消息中继到隐藏的目的地. S-Router 沿多个短距离、低能量跳的路径中继通信，以避免通过三角测量进行远程定位。移动设备调用拦截器可以检测到 S-Router 的通信，但仅当 Interceptor 靠近发送 S-Router 时。我们检查一组移动拦截器的算法，以找到目的地由 S-Router 中继的通信。根据算法的数量进行比较交流回合之前目的地找到，即数据从源传输到目标的轮次目的地. 我们分析评估算法并使用模拟，包括针对 S-Router 的参数优化策略。我们的主要结果是一个拦截器算法，它限制了预期数量交流回合通过 S-Router 数量的拟线性项。对于 S-Router 在每一轮（“连续”）传输的情况，我们提出了一种改进此界限的算法。