اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMinimal Overhead ARQ Sharing Strategies for URLLC in Multi-Hop Networks
112
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The problem of achieving ultra-reliable and low-latency communication (URLLC) in multi-terminal networks has gained traction in the recent past owing to new wireless applications in vehicular networks. In the context of multi-hop networks, which is a classic example for multi-party communication, recent studies have shown that automatic-repeat-request (ARQ) based decode-and-forward (DF) strategies are suitable for URLLC since the idea of distributing a given number of ARQs across the nodes provides fine control on the features of reliability and latency. Inspired by these developments, in this work, we propose a cooperative ARQ sharing strategy for URLLC in multi-hop networks. At the heart of the proposed scheme lies the idea that every node is given the knowledge of the number of ARQs allotted to its preceding node in addition to the ARQs allotted to itself. As a result, each node only needs to count the number of unsuccessful attempts of its preceding node, and then borrow the unused ARQs, thereby improving the reliability feature with no compromise in the latency constraint. Using packet-drop-probability (PDP) as the reliability metric for the proposed cooperative strategy, we formulate an optimization problem of minimizing the PDP subject to a sum constraint on the total number of ARQs allotted across all the nodes. Supported by theoretical analysis on the behavior of PDP, we present low-complexity algorithms to compute near-optimal ARQ distributions for our strategy, and show that our strategy outperforms the existing non-cooperative strategies.
قيم البحث
اقرأ أيضاً
Unmanned aerial vehicles (UAVs) have emerged as a promising solution to provide wireless data access for ground users in various applications (e.g., in emergence situations). This paper considers a UAV-enabled wireless network, in which multiple UAVs
are deployed as aerial base stations (BSs) to serve users distributed on the ground. Different from prior works that ignore UAVs backhaul connections, we practically consider that these UAVs are connected to the core network through a ground gateway node via rate-limited multi-hop wireless backhauls. We also consider that the air-to-ground (A2G) access links from UAVs to users and the air-to-air (A2A) backhaul links among UAVs are operated over orthogonal frequency bands. Under this setup, we aim to maximize the common (or minimum) throughput among all the ground users in the downlink of this network subject to the flow conservation constraints at the UAVs, by optimizing the UAVs deployment locations, jointly with the bandwidth and power allocation of both the access and backhaul links. However, the common throughput maximization is a non-convex optimization problem that is difficult to be solved optimally. To tackle this issue, we use the techniques of alternating optimization and successive convex programming (SCP) to obtain a locally optimal solution. Numerical results show that the proposed design significantly improves the common throughput among all ground users as compared to other benchmark schemes.
Energy harvesting multi-hop networks allow for perpetual operation of low cost, limited range wireless devices. Compared with their battery operated counterparts, the coupling of energy and data causality constraints with half duplex relay operation
makes it challenging to operate such networks. In this paper, a throughput maximization problem for energy harvesting two-hop networks with decode-and-forward half-duplex relays is investigated. For a system with two parallel relays, various combinations of the following four transmission modes are considered: Broadcast from the source, multi-access from the relays, and successive relaying phases I and II. Optimal transmission policies for one and two parallel relays are studied under the assumption of non-causal knowledge of energy arrivals and finite size relay data buffers. The problem is formulated using a convex optimization framework, which allows for efficient numerical solutions and helps identify important properties of optimal policies. Numerical results are presented to provide throughput comparisons and to investigate the impact of multiple relays, size of relay data buffers, transmission modes, and energy harvesting on the throughput.
We consider the problem of two wireless networks operating on the same (presumably unlicensed) frequency band. Pairs within a given network cooperate to schedule transmissions, but between networks there is competition for spectrum. To make the probl
em tractable, we assume transmissions are scheduled according to a random access protocol where each network chooses an access probability for its users. A game between the two networks is defined. We characterize the Nash Equilibrium behavior of the system. Three regimes are identified; one in which both networks simultaneously schedule all transmissions; one in which the denser network schedules all transmissions and the sparser only schedules a fraction; and one in which both networks schedule only a fraction of their transmissions. The regime of operation depends on the pathloss exponent $alpha$, the latter regime being desirable, but attainable only for $alpha>4$. This suggests that in certain environments, rival wireless networks may end up naturally cooperating. To substantiate our analytical results, we simulate a system where networks iteratively optimize their access probabilities in a greedy manner. We also discuss a distributed scheduling protocol that employs carrier sensing, and demonstrate via simulations, that again a near cooperative equilibrium exists for sufficiently large $alpha$.
The classical definition of network delay has been recently augmented by the concept of information timeliness, or Age of Information (AoI). We analyze the network delay and the AoI in a multi-hop satellite network that relays status updates from sat
ellite 1, receiving uplink traffic from ground devices, to satellite K, using K-2 intermediate satellite nodes. The last node, K, is the closest satellite with connectivity to a ground station. The satellite formation is modeled as a queue network of M/M/1 systems connected in series. The scenario is then generalized for the case in which all satellites receive uplink traffic from ground, and work at the same time as relays of the packets from the previous nodes. The results show that the minimum average AoI is experienced at a decreasing system utilization when the number of nodes is increased. Furthermore, unloading the first nodes of the chain reduces the queueing time and therefore the average AoI. These findings provide insights for designing multi-hop satellite networks for latency-sensitive applications.
This paper studies low-latency streaming codes for the multi-hop network. The source is transmitting a sequence of messages (streaming messages) to a destination through a chain of relays where each hop is subject to packet erasures. Every source mes
sage has to be recovered perfectly at the destination within a delay constraint of $T$ time slots. In any sliding window of $T+1$ time slots, we assume no more than $N_j$ erasures introduced by the $j$th hop channel. The capacity in case of a single relay (a three-node network) was derived by Fong [1], et al. While the converse derived for the three-node case can be extended to any number of nodes using a similar technique (analyzing the case where erasures on other links are consecutive), we demonstrate next that the achievable scheme, which suggested a clever symbol-wise decode and forward strategy, can not be straightforwardly extended without a loss in performance. The coding scheme for the three-node network, which was shown to achieve the upper bound, was ``state-independent (i.e., it does not depend on specific erasure pattern). While this is a very desirable property, in this paper, we suggest a ``state-dependent (i.e., a scheme which depends on specific erasure pattern) and show that it achieves the upper bound up to the size of an additional header. Since, as we show, the size of the header does not depend on the field size, the gap between the achievable rate and the upper bound decreases as the field size increases.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
