Competitive throughput in multi-hop wireless networks despite adaptive jamming
Competitive throughput in multi-hop wireless networks despite adaptive jamming
复制标题
DOI：
10.1007/s00446-012-0180-x
复制
发表时间：
2012-09
影响因子：
1.3
通讯作者：
A. Richa;C. Scheideler;S. Schmid;Jin Zhang
中科院分区：
文献类型：
--
作者：
A. Richa;C. Scheideler;S. Schmid;Jin Zhang
本文提出了一个简单的本地媒体访问控制协议，称为玉，多跳无线网络与一个单一的信道，可证明是强大的自适应对抗性干扰。无线网络被建模为一组节点在平面上任意分布的单位圆盘图。除了这些节点之外，还有对抗性干扰器，它们知道协议及其整个历史，并且可以在任意时间步长的任意部分（其中是任意常数）内干扰任何节点处的无线信道。我们假设节点可以执行冲突检测（除非它们自己传输），但它们无法区分拥塞传输和常规消息的冲突。尽管如此，我们表明，通过有效地利用不可预测的时间段，在该介质是可用的，thatJade实现了渐近最佳的吞吐量。
This article presents a simple local medium access control protocol, calledJade, for multi-hop wireless networks with a single channel that is provably robust against adaptive adversarial jamming. The wireless network is modeled as a unit disk graph on a set of nodes distributed arbitrarily in the plane. In addition to these nodes, there are adversarial jammers that know the protocol and its entire history and that are allowed to jam the wireless channel at any node for an arbitrary-fraction of the time steps, whereis an arbitrary constant. We assume that nodes can perform collision detection (unless they are transmitting themselves), but that they cannot distinguish between jammed transmissions and collisions of regular messages. Nevertheless, we show thatJadeachieves an asymptotically optimal throughput by efficiently exploiting the unpredictable time periods in which the medium is available.