并发编码信号复用测距用于半双工异步网络
Concurrent Coded Signal-Multiplexing Ranging for Half-Duplex Asynchronous Networks
- Tsinghua University（清华大学）
- Beijing National Research Center for Information Science and Technology, Tsinghua University（清华大学北京信息科学与技术国家研究中心）
机构由 AI 辅助整理，请以论文原文为准。
AI总结：
针对信号复用网络测距顺序操作导致周期线性增长的问题，提出并发编码框架，通过二进制码字协调并发传输，实现轮次对数增长，并设计低复杂度调度算法，仿真验证有效性。
AI中文摘要：
信号复用网络测距（SM-NR）在节点对之间共享广播，但其顺序操作导致测距周期随网络规模线性增长。本文针对异步半双工网络提出了一种并发编码SM-NR（CC-SM-NR）框架。首先，CC-SM-NR协议通过二进制发送-监听码字协调并发传输。由这些码字定义的发送-监听调度确保了在有限并发限制下的互易观测。然后，我们推导了无并发限制下发送-监听轮次的确切最小值，该最小值随网络规模对数增长。为考虑实际场景，我们建立了有限并发限制下码字常权重可行性的必要且充分条件。随后，我们提出了一种低复杂度调度算法，在常权重码字类内实现最小轮次数。为支持更高的观测冗余，该调度设计通过贪心构造进行扩展。最后，仿真结果证明了所提方案在网络测距中的有效性。
英文摘要：
Signal-multiplexing network ranging (SM-NR) shares broadcasts across node pairs, but its sequential operation leads to a ranging cycle that grows linearly with network size. This paper proposes a concurrent coded SM-NR (CC-SM-NR) framework for asynchronous half-duplex networks. Firstly, the CC-SM-NR protocol coordinates concurrent transmissions through binary transmit-listen codewords. The transmit-listen schedule defined by these codewords ensures reciprocal observations subject to a finite concurrency limit. Then, we derive the exact minimum number of transmit-listen rounds without a concurrency limit, which reveals that the minimum grows logarithmically with network size. To account for practical scenarios, we establish the necessary and sufficient conditions for the constant-weight feasibility of codewords under a finite concurrency limit. Subsequently, we propose a low-complexity scheduling algorithm that achieves the minimum round count within the constant-weight codeword class. To support higher observation redundancy, this scheduling design is extended through a greedy construction. Finally, simulation results demonstrate the effectiveness of the proposed schemes for network ranging.
