Concurrent Coded Signal-Multiplexing Ranging for Half-Duplex Asynchronous Networks

2026-09-27

AI Summary

This study addresses the problem in signal-multiplexed network ranging (SM-NR) where sequential operations cause the ranging period to scale linearly with network size. To overcome this limitation, we propose a concurrent coding SM-NR framework that leverages binary transmit-listen codewords to coordinate concurrent transmissions across asynchronous half-duplex networks. Specifically, this work establishes feasibility conditions for constant-weight codes under bounded concurrency and designs a low-complexity optimal scheduling algorithm. Our analysis reveals that the minimum number of required rounds exhibits logarithmic growth, thereby achieving logarithmic scaling of the ranging period relative to network size. Simulation results validate the effectiveness of the proposed scheme in enhancing observation redundancy.

Abstract

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.

Problem

• Network Ranging
• Signal-Multiplexing
• Half-Duplex Networks
• Asynchronous Networks
• Concurrent Transmission

Innovation

• Signal-Multiplexing Ranging
• Half-Duplex Asynchronous Networks
• Transmit-Listen Codewords
• Low-Complexity Scheduling
• Constant-Weight Feasibility