This paper investigates the coverage provability-constrained throughput in unmanned aerial vehicle (UAV)-assisted simultaneous wireless information and power transfer (SWIPT) networks, where UAVs are used as aerial ba...
详细信息
ISBN:
(数字)9781728174402
ISBN:
(纸本)9781728174419
This paper investigates the coverage provability-constrained throughput in unmanned aerial vehicle (UAV)-assisted simultaneous wireless information and power transfer (SWIPT) networks, where UAVs are used as aerial base stations and their positions are modeled by the 2-dimension Poisson point process (2-D PPP). The ground users (GUs) decode information as well as harvest energy from the transmitted signals from UAVs. Both power splitting (PS) and time switching (TS) architectures are employed at GUs. By using a stochastic geometry approach, the explicit expressions of the information-energy (I-E) coverage probabilities are derived. To describe the optimal deployment density of UAVs, an optimization problem is formulated to maximize the system throughput subject to the I-E coverage probability constraint. By using Karush-Kuhn-Tucker (KKT) conditions, the closed-form solution is derived. Simulation results demonstrate the correctness of our derived analytical results and show that compared with traditional linear EH model, the nonlinear EH model yields significant difference performance behaviors of the system. Moreover, the nonlinear EH model has a greater impact on EH for the system with TS-enabled GU than that with PS-enabled one. With the increment of the outage threshold, the required density of UAVs should be increased and both the throughput and the energy first increase and then decrease.
Cloud infrastructure provides computing services where computing resources can be adjusted on-demand. However, the adoption of cloud infrastructures brings concerns like reliance on the service provider network, relia...
详细信息
Pattern matching(or string matching) is an essential task in computer science, especially in sequential pattern mining, since pattern matching methods can be used to calculate the support(or the number of occurrences)...
详细信息
Pattern matching(or string matching) is an essential task in computer science, especially in sequential pattern mining, since pattern matching methods can be used to calculate the support(or the number of occurrences) of a pattern and then to determine whether the pattern is frequent or not. A state-of-the-art sequential pattern mining with gap constraints(or flexible wildcards) uses the number of non-overlapping occurrences to denote the frequency of a pattern. Non-overlapping means that any two occurrences cannot use the same character of the sequence at the same position of the pattern. In this paper, we investigate strict pattern matching under the non-overlapping condition. We show that the problem is in P at first. Then we propose an algorithm, called NETLAP-Best, which uses Nettree structure. NETLAP-Best transforms the pattern matching problem into a Nettree and iterates to find the rightmost root-leaf path, to prune the useless nodes in the Nettree after removing the rightmost root-leaf path. We show that NETLAP-Best is a complete algorithm and analyse the time and space complexities of the algorithm. Extensive experimental results demonstrate the correctness and efficiency of NETLAP-Best.
This paper presents an efficient method to compute the dispersion diagram of periodic and uniform structures with generic anisotropic media. The method takes advantage of the ability of full-wave commercial simulators...
详细信息
In recent years, mobile devices have taken a significant role in improving the quality of people’s life. In order to enhance the usability of those devices, more and more sensors have been built in. Furthermore, the ...
详细信息
In recent years, the Internet of Things (IoT) has been growing in popularity, along with the increasingly important role played by IoT gateways, mediating the interactions among a plethora of heterogeneous IoT devices...
详细信息
Training deep neural networks (DNNs) efficiently is a challenge due to the associated highly nonconvex optimization. The backpropagation (backprop) algorithm has long been the most widely used algorithm for gradient c...
详细信息
The recently introduced 4D 64-ary polarisation-ring-switching format is investigated in dispersion-managed systems. Numerical simulations show a reach increase of 25% with respect to PM-8QAM. This gain is achieved fro...
详细信息
This paper proposes a data hiding scheme that improves the adaptive pixel pair matching (APPM) method. Based on pixel pair matching, APPM employs a pixel pair as an embedding unit, and uses a specially designed refere...
详细信息
How to effectively measure the similarity between two sentences is a challenging task in natural language processing. In this paper, we propose a sentence similarity comparison method that combines word embeddings and...
详细信息
暂无评论