اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAge of Information Optimized MAC in V2X Sidelink via Piggyback-Based Collaboration
100
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Real-time status update in future vehicular networks is vital to enable control-level cooperative autonomous driving. Cellular Vehicle-to-Everything (C-V2X), as one of the most promising vehicular wireless technologies, adopts a Semi-Persistent Scheduling (SPS) based Medium-Access-Control (MAC) layer protocol for its sidelink communications. Despite the recent and ongoing efforts to optimize SPS, very few work has considered the status update performance of SPS. In this paper, Age of Information (AoI) is first leveraged to evaluate the MAC layer performance of C-V2X sidelink. Critical issues of SPS, i.e., persistent packet collisions and Half-Duplex (HD) effects, are identified to hinder its AoI performance. Therefore, a piggyback-based collaboration method is proposed accordingly, whereby vehicles collaborate to inform each other of potential collisions and collectively afford HD errors, while entailing only a small signaling overhead. Closed-form AoI performance is derived for the proposed scheme, optimal configurations for key parameters are hence calculated, and the convergence property is proved for decentralized implementation. Simulation results show that compared with the standardized SPS and its state-of-the-art enhancement schemes, the proposed scheme shows significantly better performance, not only in terms of AoI, but also of conventional metrics such as transmission reliability.
قيم البحث
اقرأ أيضاً
It is becoming increasingly clear that an important task for wireless networks is to minimize the age of information (AoI), i.e., the timeliness of information delivery. While mainstream approaches generally rely on the real-time observation of user
AoI and channel state, there has been little attention to solve the problem in a complete (or partial) absence of such knowledge. In this article, we present a novel study to address the optimal blind radio resource scheduling problem in orthogonal frequency division multiplexing access (OFDMA) systems towards minimizing long-term average AoI, which is proven to be the composition of time-domain-fair clustered round-robin and frequency-domain-fair intra-cluster sub-carrier assignment. Heuristic solutions that are near-optimal as shown by simulation results are also proposed to effectively improve the performance upon presence of various degrees of extra knowledge, e.g., channel state and AoI.
Timeliness is an emerging requirement for many Internet of Things (IoT) applications. In IoT networks, where a large-number of nodes are distributed, severe interference may incur during the transmission phase which causes age of information (AoI) de
gradation. It is therefore important to study the performance limit of AoI as well as how to achieve such limit. In this paper, we aim to optimize the AoI in random access Poisson networks. By taking into account the spatio-temporal interactions amongst the transmitters, an expression of the peak AoI is derived, based on explicit expressions of the optimal peak AoI and the corresponding optimal system parameters including the packet arrival rate and the channel access probability are further derived. It is shown that with a given packet arrival rate (resp. a given channel access probability), the optimal channel access probability (resp. the optimal packet arrival rate), is equal to one under a small node deployment density, and decrease monotonically as the spatial deployment density increases due to the severe interference caused by spatio-temproal coupling between transmitters. When joint tuning of the packet arrival rate and channel access probability is performed, the optimal channel access probability is always set to be one. Moreover, with the sole tuning of the channel access probability, it is found that the optimal peak AoI performance can be improved with a smaller packet arrival rate only when the node deployment density is high, which is contrast to the case of the sole tuning of the packet arrival rate, where a higher channel access probability always leads to better optimal peak AoI regardless of the node deployment density. In all the cases of optimal tuning of system parameters, the optimal peak AoI linearly grows with the node deployment density as opposed to an exponential growth with fixed system parameters.
We summarize recent contributions in the broad area of age of information (AoI). In particular, we describe the current state of the art in the design and optimization of low-latency cyberphysical systems and applications in which sources send time-s
tamped status updates to interested recipients. These applications desire status updates at the recipients to be as timely as possible; however, this is typically constrained by limited system resources. We describe AoI timeliness metrics and present general methods of AoI evaluation analysis that are applicable to a wide variety of sources and systems. Starting from elementary single-server queues, we apply these AoI methods to a range of increasingly complex systems, including energy harvesting sensors transmitting over noisy channels, parallel server systems, queueing networks, and various single-hop and multi-hop wireless networks. We also explore how update age is related to MMSE methods of sampling, estimation and control of stochastic processes. The paper concludes with a review of efforts to employ age optimization in cyberphysical applications.
The freshness of status updates is imperative in mission-critical Internet of things (IoT) applications. Recently, Age of Information (AoI) has been proposed to measure the freshness of updates at the receiver. However, AoI only characterizes the fre
shness over time, but ignores the freshness in the content. In this paper, we introduce a new performance metric, Age of Changed Information (AoCI), which captures both the passage of time and the change of information content. Also, we examine the AoCI in a time-slotted status update system, where a sensor samples the physical process and transmits the update packets with a cost. We formulate a Markov Decision Process (MDP) to find the optimal updating policy that minimizes the weighted sum of the AoCI and the update cost. Particularly, in a special case that the physical process is modeled by a two-state discrete time Markov chain with equal transition probability, we show that the optimal policy is of threshold type with respect to the AoCI and derive the closed-form of the threshold. Finally, simulations are conducted to exhibit the performance of the threshold policy and its superiority over the zero-wait baseline policy.
Vehicle-to-Everything (V2X) will create many new opportunities in the area of wireless communications, while its feasibility on enabling vehicular positioning has not been explored yet. Vehicular positioning is a crucial operation for autonomous driv
ing. Its complexity and stringent safety requirement render conventional technologies like RADAR and LIDAR inadequate. This article aims at investigating whether V2X can help vehicular positioning from different perspectives. We first explain V2Xs critical advantages over other approaches and suggest new scenarios of V2X-based vehicular positioning. Then we review the state-of-the-art positioning techniques discussed in the ongoing 3GPP standardization and point out their limitations. Lastly, some promising research directions for V2X-based vehicular positioning are presented, which shed light on realizing fully autonomous driving by overcoming the current barriers.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
