اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدReducing Initial Cell-search Latency in mmWave Networks
98
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 information 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.
قيم البحث
اقرأ أيضاً
The millimeter wave (mmWave) communication has drawn intensive attention with abundant band resources. In this paper, we consider the popular content distribution (PCD) problem in the mmWave vehicular network. In order to offload the communication bu
rden of base stations (BSs), vehicle-to-vehicle (V2V) communication is introduced into the PCD problem to transmit contents between on-board units (OBUs) and improve the transmission efficiency. We propose a full-duplex (FD) cooperative scheme based on coalition formation game, and the utility function is provided based on the maximization of the number of received contents. The contribution of each member in the coalition can be transferable to its individual profit. While maximizing the number of received contents in the fixed time, the cooperative scheme also ensures the individual profit of each OBU in the coalition. We evaluate the proposed scheme by extensive simulations in mmWave vehicular networks. Compared with other existing schemes, the proposed scheme has superior performances on the number of possessed contents and system fairness. Besides, the low complexity of the proposed algorithm is demonstrated by the switch operation number and CPU time.
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.
Wireless applications that use high-reliability low-latency links depend critically on the capability of the system to predict link quality. This dependence is especially acute at the high carrier frequencies used by mmWave and THz systems, where the
links are susceptible to blockages. Predicting blockages with high reliability requires a large number of data samples to train effective machine learning modules. With the aim of mitigating data requirements, we introduce a framework based on meta-learning, whereby data from distinct deployments are leveraged to optimize a shared initialization that decreases the data set size necessary for any new deployment. Predictors of two different events are studied: (1) at least one blockage occurs in a time window, and (2) the link is blocked for the entire time window. The results show that an RNN-based predictor trained using meta-learning is able to predict blockages after observing fewer samples than predictors trained using standard methods.
Rail transportation, especially, high-speed rails (HSR), is an important infrastructure for the development of national economy and the promotion of passenger experience. Due to the large bandwidth, millimeter wave (mmWave) communication is regarded
as a promising technology to meet the demand of high data rates. However, since mmWave communication has the characteristic of high attenuation, mobile relay (MR) is considered in this paper. Also, full-duplex (FD) communications have been proposed to improve the spectral efficiency. However, because of the high speed, as well as the problem of penetration loss, passengers on the train have a poor quality of service. Consequently, an effective user association scheme for HSR in mmWave band is necessary. In this paper, we investigate the user association optimization problem in mmWave mobilerelay systems where the MRs operate in the FD mode. To maximize the system capacity, we propose a cooperative user association approach based on coalition formation game, and develop a coalition formation algorithm to solve the challenging NP-hard problem. We also prove the convergence and Nashstable property of the proposed algorithm. Extensive simulations are done to show the system performance of the proposed scheme under various network settings. It is demonstrated that the proposed distributed low complexity scheme achieves a nearoptimal performance and outperforms two baseline schemes in terms of average system throughput.
Future millimeter-wave (mmWave) systems, 5G cellular or WiFi, must rely on highly directional links to overcome severe pathloss in these frequency bands. Establishing such links requires the mutual discovery of the transmitter and the receiver %in th
e angular domain potentially leading to a large latency and high energy consumption. In this work, we show that both the discovery latency and energy consumption can be significantly reduced by using fully digital front-ends. In fact, we establish that by reducing the resolution of the fully-digital front-ends we can achieve lower energy consumption compared to both analog and high-resolution digital beamformers. Since beamforming through analog front-ends allows sampling in only one direction at a time, the mobile device is on for a longer time compared to a digital beamformer which can get spatial samples from all directions in one shot. We show that the energy consumed by the analog front-end can be four to six times more than that of the digital front-ends, depending on the size of the employed antenna arrays. We recognize, however, that using fully digital beamforming post beam discovery, i.e., for data transmission, is not viable from a power consumption standpoint. To address this issue, we propose the use of digital beamformers with low-resolution analog to digital converters (4 bits). This reduction in resolution brings the power consumption to the same level as analog beamforming for data transmissions while benefiting from the spatial multiplexing capabilities of fully digital beamforming, thus reducing initial discovery latency and improving energy efficiency.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
