{
  "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.",
  "abstract_shown": true,
  "affiliations": [],
  "article_type": null,
  "arxiv": "2609.33753",
  "author_total": 2,
  "authors": [
    {
      "name": "Zijian Zhang"
    },
    {
      "name": "Yuan Shen"
    }
  ],
  "bibtex": "https://research.draconitic.com/paper/583grn22tr563.bib",
  "cited_by": 0,
  "doi": "10.48550/arxiv.2609.33753",
  "fulltext_url": null,
  "id": "583grn22tr563",
  "issns": [],
  "landing_url": "https://arxiv.org/abs/2609.33753",
  "language": null,
  "licence": "CC0-1.0",
  "licence_label": "CC0",
  "licence_source": "article",
  "licence_url": "http://creativecommons.org/publicdomain/zero/1.0/",
  "metadata_licence": "CC0-1.0",
  "native_subjects": [
    [
      "arxiv",
      "cs.IR"
    ],
    [
      "arxiv",
      "cs.IT"
    ],
    [
      "arxiv",
      "cs.SY"
    ],
    [
      "arxiv",
      "eess.SP"
    ],
    [
      "arxiv",
      "eess.SY"
    ],
    [
      "arxiv",
      "math.IT"
    ],
    [
      "openalex",
      "1705|Energy Efficient Wireless Sensor Networks"
    ]
  ],
  "openalex": "W7214740863",
  "pdf_url": "https://arxiv.org/pdf/2609.33753",
  "pmcid": null,
  "pmid": null,
  "published": "2026-09-27",
  "publisher": null,
  "ris": "https://research.draconitic.com/paper/583grn22tr563.ris",
  "sources": [
    {
      "first_seen": "2026-10-30T12:25:17Z",
      "native_id": "2609.33753",
      "source": "arxiv",
      "url": "https://arxiv.org/abs/2609.33753"
    }
  ],
  "subjects": [
    {
      "field": "mathematics",
      "origin": "arxiv:math.IT",
      "subfield": "general"
    }
  ],
  "title": "Concurrent Coded Signal-Multiplexing Ranging for Half-Duplex Asynchronous Networks",
  "title_text": "Concurrent Coded Signal-Multiplexing Ranging for Half-Duplex Asynchronous Networks",
  "type": "preprint",
  "updated_at": "2026-10-30T12:25:17Z",
  "url": "https://research.draconitic.com/paper/583grn22tr563",
  "venue": "arXiv",
  "versions": []
}