اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDesigning and Implementing Future Aerial Communication Networks
99
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Providing connectivity from the sky is the new innovative trend in wireless communications. High and low altitude platforms, drones, aircrafts and airships are being considered as the candidates for deploying wireless communications complementing the terrestrial communication infrastructure. In this article, we report the detailed account of the design and implementation challenges of an aerial network consisting of LTE Advanced (LTE-A) base stations. In particular, we review achievements and innovations harnessed by an aerial network composed of Helikite platforms. Helikites can be raised in the sky to bring Internet access during special events and in the aftermath of an emergency. The trial phase of the system mounting LTE-A technology onboard Helikites to serve users on the ground showed not only to be very encouraging but that such a system could offer even a longer lasting solution provided that inefficiency in powering the radio frequency equipment in the Helikite can be overcome.
قيم البحث
اقرأ أيضاً
Enabling the integration of aerial mobile users into existing cellular networks would make possible a number of promising applications. However, current cellular networks have not been designed to serve aerial users, and hence an exploration of desig
n parameters is required in order to allow network providers to modify their current infrastructure. As a first step in this direction, this paper provides an in-depth analysis of the coverage probability of the downlink of a cellular network that serves both aerial and ground users. We present an exact mathematical characterization of the coverage probability, which includes the effect of base stations (BSs) height, antenna pattern and drone altitude for various type of urban environments. Interestingly, our results show that the favorable propagation conditions that aerial users enjoys due to its altitude is also their strongest limiting factor, as it leaves them vulnerable to interference. This negative effect can be substantially reduced by optimizing the flying altitude, the base station height and antenna down-tilt. Moreover, lowering the base station height and increasing down-tilt angle are in general beneficial for both terrestrial and aerial users, pointing out a possible path to enable their coexistence.
Air traffic management (ATM) of manned and unmanned aerial vehicles (AVs) relies critically on ubiquitous location tracking. While technologies exist for AVs to broadcast their location periodically and for airports to track and detect AVs, methods t
o verify the broadcast locations and complement the ATM coverage are urgently needed, addressing anti-spoofing and safe coexistence concerns. In this work, we propose an ATM solution by exploiting noncoherent crowdsourced wireless networks (CWNs) and correcting the inherent clock-synchronization problems present in such non-coordinated sensor networks. While CWNs can provide a great number of measurements for ubiquitous ATM, these are normally obtained from unsynchronized sensors. This article first presents an analysis of the effects of lack of clock synchronization in ATM with CWN and provides solutions based on the presence of few trustworthy sensors in a large non-coordinated network. Secondly, autoregressive-based and long short-term memory (LSTM)-based approaches are investigated to achieve the time synchronization needed for localization of the AVs. Finally, a combination of a multilateration (MLAT) method and a Kalman filter is employed to provide an anti-spoofing tracking solution for AVs. We demonstrate the performance advantages of our framework through a dataset collected by a real-world CWN. Our results show that the proposed framework achieves localization accuracy comparable to that acquired using only GPS-synchronized sensors and outperforms the localization accuracy obtained based on state-of-the-art CWN synchronization methods.
With the rapid development of railways, especially high-speed railways, there is an increasingly urgent demand for new wireless communication system for railways. Taking the mature 5G technology as an opportunity, 5G-railways (5G-R) have been widely
regarded as a solution to meet the diversified demands of railway wireless communications. For the design, deployment and improvement of 5G-R networks, radio communication scenario classification plays an important role, affecting channel modeling and system performance evaluation. In this paper, a standardized radio communication scenario classification, including 18 scenarios, is proposed for 5G-R. This paper analyzes the differences of 5G-R scenarios compared with the traditional cellular networks and GSM-railways, according to 5G-R requirements and the unique physical environment and propagation characteristics. The proposed standardized scenario classification helps deepen the research of 5G-R and promote the development and application of the existing advanced technologies in railways.
We study the optimal usage-based pricing problem in a resource-constrained network with one profit-maximizing service provider and multiple groups of surplus-maximizing users. With the assumption that the service provider knows the utility function o
f each user (thus complete information), we find that the complete price differentiation scheme can achieve a large revenue gain (e.g., 50%) compared to no price differentiation, when the total network resource is comparably limited and the high willingness to pay users are minorities. However, the complete price differentiation scheme may lead to a high implementational complexity. To trade off the revenue against the implementational complexity, we further study the partial price differentiation scheme, and design a polynomial-time algorithm that can compute the optimal partial differentiation prices. We also consider the incomplete information case where the service provider does not know which group each user belongs to. We show that it is still possible to realize price differentiation under this scenario, and provide the sufficient and necessary condition under which an incentive compatible differentiation scheme can achieve the same revenue as under complete information.
We discuss the design of interlayer edges in a multiplex network, under a limited budget, with the goal of improving its overall performance. We analyze the following three problems separately; first, we maximize the smallest nonzero eigenvalue, also
known as the algebraic connectivity; secondly, we minimize the largest eigenvalue, also known as the spectral radius; and finally, we minimize the spectral width. Maximizing the algebraic connectivity requires identical weights on the interlayer edges for budgets less than a threshold value. However, for larger budgets, the optimal weights are generally non-uniform. The dual formulation transforms the problem into a graph realization (embedding) problem that allows us to give a fuller picture. Namely, before the threshold budget, the optimal realization is one-dimensional with nodes in the same layer embedded to a single point; while, beyond the threshold, the optimal embeddings generally unfold into spaces with dimension bounded by the multiplicity of the algebraic connectivity. Finally, for extremely large budgets the embeddings revert again to lower dimensions. Minimizing the largest eigenvalue is driven by the spectral radius of the individual networks and its corresponding eigenvector. Before a threshold, the total budget is distributed among interlayer edges corresponding to the nodal lines of this eigenvector, and the optimal largest eigenvalue of the Laplacian remains constant. For larger budgets, the weight distribution tends to be almost uniform. In the dual picture, the optimal graph embedding is one-dimensional and non-homogeneous at first and beyond this threshold, the optimal embedding expands to be multi-dimensional, and for larger values of the budget, the two layers fill the embedding space. Finally, we show how these two problems are connected to minimizing the spectral width.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
