论文标题
QF-MAC：自适应，本地频道跳跃以避免无线网眼的干扰
QF-MAC: Adaptive, Local Channel Hopping for Interference Avoidance in Wireless Meshes
论文作者
论文摘要
通过为多个通道上的多拉迪奥访问，可以显着提高具有潜在恶意外部或内部干扰的无线网络网络的吞吐量效率。为了可靠地减轻干扰的效果，频率多样性（例如，频道跳跃）和时间多样性（例如，载体sense多次访问）通常利用以安排通信渠道。但是，在有限的渠道上进行多拉迪奥调度，以最大程度地减少干扰效果并在存在并发网络流的存在下最大程度地提高网络性能仍然是一个具有挑战性的问题。多拉迪奥斯的渠道调度计划的实践性不仅揭示了实现网络容量的差距，而且还揭示了大量的沟通开销。 本文提出了一种自适应频道跳跃算法，用于多拉迪奥通信，Quickfire Mac（QF-MAC），该算法仅使用单跳社区的协调来分配每节点，每节点``local''通道跳跃序列。 QF-MAC在低控制开销的情况下实现了吞吐量和潜伏期的实质性增强。 QF-MAC还可以针对网络动态（即移动性和外部干扰）以及选择性干扰攻击者实现鲁棒性，其中全球频道跳跃序列（例如TSCH）无法维持交流性能。我们的仿真结果在跨网络密度，尺寸和同意流的各种配置的情况下，在出现和不存在迁移率的情况下，在QF-MAC的性能上量化了QF-MAC的性能增长。
The throughput efficiency of a wireless mesh network with potentially malicious external or internal interference can be significantly improved by equipping routers with multi-radio access over multiple channels. For reliably mitigating the effect of interference, frequency diversity (e.g., channel hopping) and time diversity (e.g., carrier sense multiple access) are conventionally leveraged to schedule communication channels. However, multi-radio scheduling over a limited set of channels to minimize the effect of interference and maximize network performance in the presence of concurrent network flows remains a challenging problem. The state-of-the-practice in channel scheduling of multi-radios reveals not only gaps in achieving network capacity but also significant communication overhead. This paper proposes an adaptive channel hopping algorithm for multi-radio communication, QuickFire MAC (QF-MAC), that assigns per-node, per-flow ``local'' channel hopping sequences, using only one-hop neighborhood coordination. QF-MAC achieves a substantial enhancement of throughput and latency with low control overhead. QF-MAC also achieves robustness against network dynamics, i.e., mobility and external interference, and selective jamming attacker where a global channel hopping sequence (e.g., TSCH) fails to sustain the communication performance. Our simulation results quantify the performance gains of QF-MAC in terms of goodput, latency, reliability, communication overhead, and jamming tolerance, both in the presence and absence of mobility, across diverse configurations of network densities, sizes, and concurrent flows.
