اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLatency and timeliness in multi-hop satellite networks
173
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 satellite 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.
قيم البحث
اقرأ أيضاً
The 5G Phase-2 and beyond wireless systems will focus more on vertical applications such as autonomous driving and industrial Internet-of-things, many of which are categorized as ultra-Reliable Low-Latency Communications (uRLLC). In this article, an
alternative view on uRLLC is presented, that information latency, which measures the distortion of information resulted from time lag of its acquisition process, is more relevant than conventional communication latency of uRLLC in wireless networked control systems. An AI-assisted Situationally-aware Multi-Agent Reinforcement learning framework for wireless neTworks (SMART) is presented to address the information latency optimization challenge. Case studies of typical applications in Autonomous Driving (AD) are demonstrated, i.e., dense platooning and intersection management, which show that SMART can effectively optimize information latency, and more importantly, information latency-optimized systems outperform conventional uRLLC-oriented systems significantly in terms of AD performance such as traffic efficiency, thus pointing out a new research and system design paradigm.
Millimeter-wave (mmWave) networks rely on directional transmissions, in both control plane and data plane, to overcome severe path-loss. Nevertheless, the use of narrow beams complicates the initial cell-search procedure where we lack sufficient info
rmation for beamforming. In this paper, we investigate the feasibility of random beamforming for cell-search. We develop a stochastic geometry framework to analyze the performance in terms of failure probability and expected latency of cell-search. Meanwhile, we compare our results with the naive, but heavily used, exhaustive search scheme. Numerical results show that, for a given discovery failure probability, random beamforming can substantially reduce the latency of exhaustive search, especially in dense networks. Our work demonstrates that developing complex cell-discovery algorithms may be unnecessary in dense mmWave networks and thus shed new lights on mmWave system design.
In this paper we investigate the performance of caching schemes based on fountain codes in a heterogeneous satellite network. We consider multiple cache-aided hubs which are connected to a geostationary satellite through backhaul links. With the aimo
f reducing the average number of transmissions over the satellite backhaul link, we propose the use of a caching scheme based on fountain codes. We derive a simple analytical expression of the average backhaul transmission rate and provide a tightupper bound on it. Furthermore, we show how the performance of the fountain code based caching scheme is similar to that of a caching scheme based on maximum distance separable codes.
Timely status updating is crucial for future applications that involve remote monitoring and control, such as autonomous driving and Industrial Internet of Things (IIoT). Age of Information (AoI) has been proposed to measure the freshness of status u
pdates. However, it is incapable of capturing critical systematic context information that indicates the time-varying importance of status information, and the dynamic evolution of status. In this paper, we propose a context-based metric, namely the Urgency of Information (UoI), to evaluate the timeliness of status updates. Compared to AoI, the new metric incorporates both time-varying context information and dynamic status evolution, which enables the analysis on context-based adaptive status update schemes, as well as more effective remote monitoring and control. The minimization of average UoI for a status update terminal with an updating frequency constraint is investigated, and an update-index-based adaptive scheme is proposed. Simulation results show that the proposed scheme achieves a near-optimal performance with a low computational complexity.
We consider the age of information in a multihop multicast network where there is a single source node sending time-sensitive updates to $n^L$ end nodes, and $L$ denotes the number of hops. In the first hop, the source node sends updates to $n$ first
-hop receiver nodes, and in the second hop each first-hop receiver node relays the update packets that it has received to $n$ further users that are connected to it. This network architecture continues in further hops such that each receiver node in hop $ell$ is connected to $n$ further receiver nodes in hop $ell+1$. We study the age of information experienced by the end nodes, and in particular, its scaling as a function of $n$. We show that, using an earliest $k$ transmission scheme in each hop, the age of information at the end nodes can be made a constant independent of $n$. In particular, the source node transmits each update packet to the earliest $k_1$ of the $n$ first-hop nodes, and each first-hop node that receives the update relays it to the earliest $k_2$ out of $n$ second-hop nodes that are connected to it and so on. We determine the optimum $k_ell$ stopping value for each hop $ell$ for arbitrary shifted exponential link delays.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
