Concurrent Coded Signal-Multiplexing Ranging for Half-Duplex Asynchronous Networks
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.
Related
- A Parallel Algebraic Multigrid Preconditioned Iterative Method Based on an MPI Process Grouping Strategy for Asynchronous Concurrent Execution of the Setup and Solve Phases
- Graph neural networks for sampling-invariant embeddings of organized signal sets
- State-Dependent Phase-Type Queueing Networks for Urban Traffic Signal Control
- How Does Probabilistic Constellation Shaping Control Ranging Sidelobe Levels in ISAC?
- A Spike-Driven Neuromorphic Framework for Asynchronous Population-Based Optimisation
BibTeX
@misc{zhang2026concurrent,
title = {{Concurrent Coded Signal-Multiplexing Ranging for Half-Duplex Asynchronous Networks}},
author = {Zijian Zhang and Yuan Shen},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.33753},
eprint = {2609.33753},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.33753},
note = {CC0},
}
RIS
TY - UNPB
TI - Concurrent Coded Signal-Multiplexing Ranging for Half-Duplex Asynchronous Networks
AU - Zijian Zhang
AU - Yuan Shen
PY - 2026
DA - 2026/09/27
PB - arXiv
DO - 10.48550/arxiv.2609.33753
UR - https://arxiv.org/abs/2609.33753
AB - 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.
ER -