ترغب بنشر مسار تعليمي؟ اضغط هنا

On-Demand Density-Aware UAV Base Station 3D Placement for Arbitrarily Distributed Users with Guaranteed Data Rates

251   0   0.0 ( 0 )
 نشر من قبل Chuan-Chi Lai
 تاريخ النشر 2019
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

In this letter, we study the on-demand UAV-BS placement problem for arbitrarily distributed users. This UAV-BS placement problem is modeled as a knapsack-like problem, which is NP-complete. We propose a density-aware placement algorithm to maximize the number of covered users subject to the constraint of the minimum required data rates per user. Simulations are conducted to evaluate the performance of the proposed algorithm in a real environment with different user densities. Our numerical results indicate that for various user densities our proposed solution can service more users with guaranteed data rates compared to the existing method, while reducing the transmit power by 29%.



قيم البحث

اقرأ أيضاً

In this paper, we consider an Unmanned Aerial Vehicle (UAV)-assisted cellular system which consists of multiple UAV base stations (BSs) cooperating the terrestrial BSs. In such a heterogeneous network, for cellular operators, the problem is how to de termine the appropriate number, locations, and altitudes of UAV-BSs to improve the system sumrate as well as satisfy the demands of arbitrarily flash crowds on data rates. We propose a data-driven 3D placement of UAV-BSs for providing an effective placement result with a feasible computational cost. The proposed algorithm searches for the appropriate number, location, coverage, and altitude of each UAV-BS in the serving area with the maximized system sumrate in polynomial time so as to guarantee the minimum data rate requirement of UE. The simulation results show that the proposed approach can improve system sumrate in comparison with the case without UAV-BSs.
The unmanned aerial vehicles base stations (UAV-BSs) have great potential in being widely used in many dynamic application scenarios. In those scenarios, the movements of served user equipments (UEs) are inevitable, so the UAV-BSs needs to be re-posi tioned dynamically for providing seamless services. In this paper, we propose a system framework consisting of UEs clustering, UAV-BS placement, UEs trajectories prediction, and UAV-BS reposition matching scheme, to serve the UEs seamlessly as well as minimize the energy cost of UAV-BSs reposition trajectories. An Echo State Network (ESN) based algorithm for predicting the future trajectories of UEs and a Kuhn-Munkres-based algorithm for finding the energy-efficient reposition trajectories of UAV-BSs is designed, respectively. We conduct a simulation using a real open dataset for performance validation. The simulation results indicate that the proposed framework achieves high prediction accuracy and provides the energy-efficient matching scheme.
The increasing popularity of cloud computing has resulted in a proliferation of data centers. Effective placement of data centers improves network performance and minimizes clients perceived latency. The problem of determining the optimal placement o f data centers in a large network is a classical uncapacitated $k$-median problem. Traditional works have focused on centralized algorithms, which requires knowledge of the overall network topology and information about the customers service demands. Moreover, centralized algorithms are computationally expensive and do not scale well with the size of the network. We propose a fully distributed algorithm with linear complexity to optimize the locations of data centers. The proposed algorithm utilizes an iterative two-step optimization approach. Specifically, in each iteration, it first partitions the whole network into $k$ regions through a distributed partitioning algorithm; then within each region, it determines the local approximate optimal location through a distributed message-passing algorithm. When the underlying network is a tree topology, we show that the overall cost is monotonically decreasing between successive iterations and the proposed algorithm converges in a finite number of iterations. Extensive simulations on both synthetic and real Internet topologies show that the proposed algorithm achieves performance comparable with that of centralized algorithms that require global information and have higher computational complexity.
70 - Qiong Wu , Xu Chen , Zhi Zhou 2021
To meet the ever increasing mobile traffic demand in 5G era, base stations (BSs) have been densely deployed in radio access networks (RANs) to increase the network coverage and capacity. However, as the high density of BSs is designed to accommodate peak traffic, it would consume an unnecessarily large amount of energy if BSs are on during off-peak time. To save the energy consumption of cellular networks, an effective way is to deactivate some idle base stations that do not serve any traffic demand. In this paper, we develop a traffic-aware dynamic BS sleep control framework, named DeepBSC, which presents a novel data-driven learning approach to determine the BS active/sleep modes while meeting lower energy consumption and satisfactory Quality of Service (QoS) requirements. Specifically, the traffic demands are predicted by the proposed GS-STN model, which leverages the geographical and semantic spatial-temporal correlations of mobile traffic. With accurate mobile traffic forecasting, the BS sleep control problem is cast as a Markov Decision Process that is solved by Actor-Critic reinforcement learning methods. To reduce the variance of cost estimation in the dynamic environment, we propose a benchmark transformation method that provides robust performance indicator for policy update. To expedite the training process, we adopt a Deep Deterministic Policy Gradient (DDPG) approach, together with an explorer network, which can strengthen the exploration further. Extensive experiments with a real-world dataset corroborate that our proposed framework significantly outperforms the existing methods.
Mobile base stations on board unmanned aerial vehicles (UAVs) promise to deliver connectivity to those areas where the terrestrial infrastructure is overloaded, damaged, or absent. A fundamental problem in this context involves determining a minimal set of locations in 3D space where such aerial base stations (ABSs) must be deployed to provide coverage to a set of users. While nearly all existing approaches rely on average characterizations of the propagation medium, this work develops a scheme where the actual channel information is exploited by means of a radio tomographic map. A convex optimization approach is presented to minimize the number of required ABSs while ensuring that the UAVs do not enter no-fly regions. A simulation study reveals that the proposed algorithm markedly outperforms its competitors.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا