One-Hop Listening Based ARQs for Low-Latency Communication in Multihop Networks

• Published in: IEEE transactions on wireless communications Vol. 22; no. 2; pp. 1044 - 1059
• Main Authors: Goel, Jaya, Harshan, J.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.02.2023; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: ARQs; Automatic repeat request; cooperative protocols; Decoding; Delays; high reliability; Listening; Low latency communication; low-latency; multi-hop networks; Network latency; Network reliability; Nodes; Optimization; Protocols; Reliability engineering; Spread spectrum communication; Upper bounds; Vehicles; Wireless communication; Wireless communications; Wireless networks
• ISSN: 1536-1276; 1558-2248
• DOI: 10.1109/TWC.2022.3200683

Inspired by emerging applications in vehicular networks, we address the problem of achieving high-reliability and low-latency communication in multi-hop wireless networks. We propose a new family of Automatic-Repeat-Requests (ARQs) based cooperative strategies wherein high end-to-end reliability is obtained using packet re-transmissions at each hop while the low-latency constraint is met by imposing an upper bound on the total number of packet retransmissions across the network. A hallmark of our strategies is the one-hop listening capability wherein nodes utilize the unused ARQs of their preceding node just by counting the number of failed attempts due to decoding errors. We further extend the idea of one-hop listening to multi-hop listening, wherein a set of consecutive nodes form clusters to utilize the unused ARQs of the preceding nodes, beyond its nearest neighbour, to further improve reliability. Thus, our strategies provide the high-reliability feature with no compromise in the original latency-constraint. For the proposed strategies, we solve non-linear optimization problems on distributing the ARQs across the nodes so as to minimize packet drop probability (PDP) subject to a total number of ARQs in the network. Through extensive theoretical results on PDP and delay profiles, we show that the proposed strategies outperform the best-known strategies in this space.