A concurrent coded SM-NR (CC-SM-NR) framework for asynchronous half-duplex networks is proposed and a low-complexity scheduling algorithm is proposed that achieves the minimum round count within the constant-weight codeword class.
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.
Through extensive simulations, it is demonstrated that the stable throughput achieved by the proposed deterministic scheme closely approaches the density-evolution threshold of randomized convolutional coded Poisson receivers (CCPR), including spatially coupled <inline-formula> <tex-math notation="LaTeX">$D$ </tex-math...
Bo Yang, Cheng-Shang Chang, Duan-Shin Lee· IEEE Transactions on Communi...· 0 citations
Vehicle-to-everything (V2X) sidelink and uplink broadcast must deliver safety-critical and application-layer data reliably under fast time-varying fading, intermittent packet erasures, and exposure to passive eavesdroppers. Fixed-rate physical-layer codes are poorly matched to these conditions because link quality and...
Pegah Sharifi, Hassan Khodaiemehr, Khadijeh Bagheri et al.· 0 citations
This paper introduces intentional symbol-level asynchronicity as an interference-management mechanism for the uplink of cell-free networks. Rather than treating timing offsets as impairments, user-specific delays are deliberately assigned to reduce multiuser interference and improve spectral efficiency. A scalable rece...
Network coding lets the nodes of a network combine messages rather than merely forward them. In undirected networks, where the two directions of an edge share its capacity, Li and Li conjectured in 2004 that coding offers no advantage over fractional routing; the conjecture has been confirmed for many special classes b...
Under the external-memory model specified in this paper, the deterministic sorting algorithm formally verified the algorithm's correctness and I/O complexity bound in Lean~4.0 is formally verified.
The cloud radio access network (C-RAN) mitigates inter-cell interference by jointly processing the observations of distributed remote units (RUs) at a centralized unit (CU), but limited fronthaul capacity forces each RU to compress its received signal. Under transform-compress-forward, an RU transforms its signal and q...
Su-Bin Shin, Jaeho Lee, Seok-Hwan Park et al.· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.