In emergency situations such as earthquakes, the cellular infrastructure cannot support communication services because of equipment damage. The use of the large number of unmanned aerial vehicles (UAVs) has been drawn...
详细信息
ISBN:
(纸本)9781538620700
In emergency situations such as earthquakes, the cellular infrastructure cannot support communication services because of equipment damage. The use of the large number of unmanned aerial vehicles (UAVs) has been drawn significant attentions as an important solution for providing air-to-ground communication services in such situations. In this paper, we research the flight direction policy (velocity vector) of the UAVs where every UAV acts as the base station to serve the multi-users communications. As the trajectory of UAVs have a huge impact on the performance of communication, we investigate an adaptive coverage problem, that all the UAVs can adjust their velocities to increase the number of served users. However, such behavior may cause larger flight energy consumption. We propose a discrete-time mean-field game (MFG) framework that each UAV adjusts its velocity in order to minimize the flight energy consumption. In this framework, each UAV evolves according to the dynamic equation and seeks to minimize its flight energy consumption containing the average distribution of all UAVs. We investigate a deterministic function phi to approximate the average distribution of all UAVs as the number of UAVs tends to infinity. Furthermore, the optimal velocity vectors generate a certain asymptotic Nash equilibrium as time tends to infinity, which implies that the flight energy consumption of each UAV can reach its minimal value as the number of UAVs increases to infinity. The simulation results show the optimal trajectory and optimal flight tendency of the UAVs. Moreover, we show that as users move, the amount of the users served is maintained at a relatively stable range, which represents met the demand of user's adaptive coverage.
In emergency situations such as earthquakes, the cellular infrastructure cannot support communication services because of equipment damage. The use of the large number of unmanned aerial vehicles (UAVs) has been drawn...
详细信息
In emergency situations such as earthquakes, the cellular infrastructure cannot support communication services because of equipment damage. The use of the large number of unmanned aerial vehicles (UAVs) has been drawn significant attentions as an important solution for providing air-to-ground communication services in such situations. In this paper, we research the flight direction policy (velocity vector) of the UAVs where every UAV acts as the base station to serve the multi-users communications. As the trajectory of UAVs have a huge impact on the performance of communication, we investigate an adaptive coverage problem, that all the UAVs can adjust their velocities to increase the number of served users. However, such behavior may cause larger flight energy consumption. We propose a discrete-time mean-field game (MFG) framework that each UAV adjusts its velocity in order to minimize the flight energy consumption. In this framework, each UAV evolves according to the dynamic equation and seeks to minimize its flight energy consumption containing the average distribution of all UAVs. We investigate a deterministic function φ to approximate the average distribution of all UAVs as the number of UAVs tends to infinity. Furthermore, the optimal velocity vectors generate a certain asymptotic Nash equilibrium as time tends to infinity, which implies that the flight energy consumption of each UAV can reach its minimal value as the number of UAVs increases to infinity. The simulation results show the optimal trajectory and optimal flight tendency of the UAVs. Moreover, we show that as users move, the amount of the users served is maintained at a relatively stable range, which represents met the demand of user's adaptive coverage.
This study examines the trade-offs related to the problem of coverage auto-configuration of open access small cells (SC) that (i) are on-demand deployed in the macro-cells (MC) of a W-CDMA network, and (ii) operate in...
详细信息
ISBN:
(纸本)9781479944828
This study examines the trade-offs related to the problem of coverage auto-configuration of open access small cells (SC) that (i) are on-demand deployed in the macro-cells (MC) of a W-CDMA network, and (ii) operate in the same frequency channel as the hosting/neighboring MCs. The goal is to identify stable and practically detectable equilibrium states whose achievement can represent an optimality criterion for implementing automatic coverage adaptation of the SCs. It is shown that, on the downlink (DL), the offloading of MC hotspot users by a nearby SC improves the DL signal-to-interference-and-noise ratio (SINR) and the DL effective throughput of the MC users at the expense of the SC users. Similarly on the uplink (UL), the maximum achievable UL SINR of the SC (MC) users decreases (increases) with a growing SC coverage, but a distinct equilibrium state of the MC-vs-SC trade-off defined on the basis of the spectral radius of a network information matrix can be observed. However, the DL and UL equilibria do not generally coincide unless the MC and SC performance requirements are identical. This fact complicates autonomous optimum partitioning of the SC power budget between data transmissions and coverage-defining pilot signals. Numerical simulations are based on a 3GPP-compliant system model.
coverage has been an active research area in mobile sensor networks. For a randomly placed large-scale sensor network, sensor nodes would most probably be distributed asymmetrically, and it requires the coverage algor...
详细信息
ISBN:
(纸本)3540380914
coverage has been an active research area in mobile sensor networks. For a randomly placed large-scale sensor network, sensor nodes would most probably be distributed asymmetrically, and it requires the coverage algorithm to do with the diffusion and contraction of the network. Most of the existed algorithms are on the assumption that sensor nodes are initially densely distributed or the states of the network coverage are known to all the nodes, which does not meet all application scenarios. This paper proposes a new adaptive coverage algorithm based on the combination of boundary contraction and random repulsion. It works well on the scenarios of the asymmetrical initial distribution, the isotropic sensor nodes, and that only the coverage states in communication range being known by nodes. Simulation results show that the algorithm realizes both the diffusion and contraction of the sensor network, and that the deployed nodes tend to be uniformly distributed.
A novel technique for inserting basestations on an ad-hoc basis is investigated in this paper. Sector retraction and extension is used to reshape the network coverage area. Basestations are generally added to the netw...
详细信息
ISBN:
(纸本)0780375890
A novel technique for inserting basestations on an ad-hoc basis is investigated in this paper. Sector retraction and extension is used to reshape the network coverage area. Basestations are generally added to the network whenever there is a need to meet an increasing capacity demand. The replanning exercise can be both costly and time consuming. Situation Awareness (SA) is the enabling functionality that allows a network redesign without a drain on resources. The simulation involves loading the network to capacity and evaluating the performance of adding a basestation 'on the fly'. Spectrum efficiency is the measure of performance used. Reconfiguration of the network area is performed by controlling the power level of the downlink pilot channel through the use of a genetic algorithm (GA). The performance of the algorithm is determined by its ability to reconfigure and redistribute the traffic. The technique is shown to offer a flexible and simple solution to the problem of UMTS network replanning for additional capacity.
暂无评论