Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userJoint Coverage and Power Control in Highly Dynamic and Massive UAV Networks: An Aggregative Game-theoretic Learning Approach
171
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Unmanned aerial vehicles (UAV) ad-hoc network is a significant contingency plan for communication after a natural disaster, such as typhoon and earthquake. To achieve efficient and rapid networks deployment, we employ noncooperative game theory and amended binary log-linear algorithm (BLLA) seeking for the Nash equilibrium which achieves the optimal network performance. We not only take channel overlap and power control into account but also consider coverage and the complexity of interference. However, extensive UAV game theoretical models show limitations in post-disaster scenarios which require large-scale UAV network deployments. Besides, the highly dynamic post-disaster scenarios cause strategies updating constraint and strategy-deciding error on UAV ad-hoc networks. To handle these problems, we employ aggregative game which could capture and cover those characteristics. Moreover, we propose a novel synchronous payoff-based binary log-linear learning algorithm (SPBLLA) to lessen information exchange and reduce time consumption. Ultimately, the experiments indicate that, under the same strategy-deciding error rate, SPBLLAs learning rate is manifestly faster than that of the revised BLLA. Hence, the new model and algorithm are more suitable and promising for large-scale highly dynamic scenarios.
rate research
Read More
Increasing penetration of renewable energy introduces significant uncertainty into power systems. Traditional simulation-based verification methods may not be applicable due to the unknown-but-bounded feature of the uncertainty sets. Emerging set-theoretic methods have been intensively investigated to tackle this challenge. The paper comprehensively reviews these methods categorized by underlying mathematical principles, that is, set operation-based methods and passivity-based methods. Set operation-based methods are more computationally efficient, while passivity-based methods provide semi-analytical expression of reachable sets, which can be readily employed for control. Other features between different methods are also discussed and illustrated by numerical examples. A benchmark example is presented and solved by different methods to verify consistency.
This paper presents a novel unmanned aerial vehicle (UAV) aided mobile edge computing (MEC) architecture for vehicular networks. It is considered that the vehicles should complete latency critical computation intensive tasks either locally with on-board computation units or by offloading part of their tasks to road side units (RSUs) with collocated MEC servers. In this direction, a hovering UAV can serve as an aerial RSU (ARSU) for task processing or act as an aerial relay and further offload the computation tasks to a ground RSU (GRSU). In order to significantly reduce the delay during data offloading and downloading, this architecture relies on the benefits of massive multiple input multiple output (MIMO). Therefore, it is considered that the vehicles, the ARSU, and the GRSU employ large scale antennas. A three dimensional (3D) geometrical representation of the MEC enabled network is introduced and an optimization method is proposed that minimizes the weighted total energy consumption (WTEC) of the vehicles and ARSU subject to transmit power allocation, task allocation, and timeslot scheduling. The numerical results verify the theoretical derivations, emphasize on the effectiveness of the massive MIMO transmission, and provide useful engineering insights.
In modern networks, the use of drones as mobile base stations (MBSs) has been discussed for coverage flexibility. However, the realization of drone-based networks raises several issues. One of the critical issues is drones are extremely power-hungry. To overcome this, we need to characterize a new type of drones, so-called charging drones, which can deliver energy to MBS drones. Motivated by the fact that the charging drones also need to be charged, we deploy ground-mounted charging towers for delivering energy to the charging drones. We introduce a new energy-efficiency maximization problem, which is partitioned into two independently separable tasks. More specifically, as our first optimization task, two-stage charging matching is proposed due to the inherent nature of our network model, where the first matching aims to schedule between charging towers and charging drones while the second matching solves the scheduling between charging drones and MBS drones. We analyze how to convert the formulation containing non-convex terms to another one only with convex terms. As our second optimization task, each MBS drone conducts energy-aware time-average transmit power allocation minimization subject to stability via Lyapunov optimization. Our solutions enable the MBS drones to extend their lifetimes; in turn, network coverage-time can be extended.
We address the link between the controllability or observability of a stochastic complex system and concepts of information theory. We show that the most influential degrees of freedom can be detected without acting on the system, by measuring the time-delayed multi-information. Numerical and analytical results support this claim, which is developed in the case of a simple stochastic model on a graph, the so-called voter model. The importance of the noise when controlling the system is demonstrated, leading to the concept of control length. The link with classical control theory is given, as well as the interpretation of controllability in terms of the capacity of a communication canal.
A logical function can be used to characterizing a property of a state of Boolean network (BN), which is considered as an aggregation of states. To illustrate the dynamics of a set of logical functions, which characterize our concerned properties of a BN, the invariant subspace containing the set of logical functions is proposed, and its properties are investigated. Then the invariant subspace of Boolean control network (BCN) is also proposed. The dynamics of invariant subspace of BCN is also invariant. Finally, using outputs as the set of logical functions, the minimum realization of BCN is proposed, which provides a possible solution to overcome the computational complexity of large scale BNs/BCNs.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
