Unmanned aerial vehicles (UAVs) are capable of serving as a data collector for wireless sensor networks (WSNs). In this paper, we investigate an energy-effective data gathering approach in UAV-aided WSNs, where each sensor node (SN) dynamically chooses the transmission modes, i.e., (1) waiting, (2) conventional sink node transmission, (3) uploading to UAV, to transmit sensory data within a given time. By jointly considering the SN’s transmission policy and UAV trajectory optimization, we aim to minimize the transmission energy consumption of the SNs and ensure all sensory data completed collected within the given time. We take a two-step iterative approach and decouple the SN’s transmission design and UAV trajectory optimization process. First, we design the optimal SNs transmission mode policy with preplanned UAV trajectory. A dynamic programming (DP) algorithm is proposed to obtain the optimal transmission policy. Then, with the fixed transmission policy, we optimize the UAV’s trajectory from the preplanned trace with recursive random search (RRS) algorithm. Numerical results show that the proposed scheme achieves significant energy savings gain over the benchmark schemes.

Unmanned aerial vehicles (UAVs) have been extensively applied to goods delivery and in-situ sensing. It becomes increasingly probable that multiple UAVs are delivering goods and carrying out sensing tasks at the same time. The destinations of the UAVs are usually required to jointly design their trajectories and sensing selections, leading to privacy concerns for the UAVs. This paper presents a new game-theoretic routing framework for joint goods delivery and sensing of multiple cellular-connected UAVs, where the UAVs minimize their energy consumption and connectivity outage, maximize their sensing reward, and ensure timely goods delivery and trajectory privacy by optimizing their trajectories and sensing task selections in a decentralized manner. The key idea is that we unify routing and sensing in a single task selection process, which is further transformed into routing on a task-time graph. Another important aspect is that we design a non-cooperative potential game for the routing on the task-time graph. A distributed strategy is developed, where each UAV only reports its sensing task selections and withholds its destination information and its best response produced by the Bellman-Ford algorithm. By this means, the destination and trajectory privacy of the UAVs are protected. Simulations show that the new game-theoretic approach can ensure timely delivery and achieve close-to-optimal solutions with significantly lower complexity compared to a centralized brute-force approach.

This paper puts forth a new application of an unmanned aerial vehicle (UAV) to joint goods delivery and in-situ sensing, and proposes a new algorithm that jointly optimizes the route and sensing task selection to minimize the UAV’s energy consumption, maximize its sensing reward, and ensure timely goods delivery. This problem is new and non-trivial due to its nature of mixed integer programming. The key idea behind the new algorithm is that we interpret the possible waypoints of the UAV as location-dependent tasks to incorporate routing and sensing in one task selection process. Another critical aspect is that we construct a new task-time graph to describe the process, where each vertex corresponds to a task associated with its location, time and reward, and each edge indicates the propulsion energy required for the UAV to travel between two tasks. By redistributing the weight of a vertex to its incoming edges, the new UAV routing and sensing task selection problem can be converted to a weighted routing problem in the new task-time graph and solved optimally using the Bellman-Ford algorithm. Validated by a real-world case study, our approach can outperform its alternatives by over 18% in task reward.

The scarcity of spectrum turns the next generation wireless network increasingly heterogeneous. Recently, much attention has been focused on exploiting the unlicensed spectrum to leverage traffic burden from the cellular network. Specified in 3GPP Release 13, long term evolution (LTE) wireless local area networks (WLAN) aggregation (LWA) promises an effective approach for the LTE WLAN interworking and unlicensed spectrum utilization. The LWA could improve the data rate by the licensed and unlicensed carriers aggregation. In contrast to the previous studies, where the LWA is always chosen to boost the peak data rate without considering the user payment, we jointly consider the LWA with Wi-Fi offloading in this paper, aiming to strike the balance between user payment and quality of service (QoS) requirement. We formulate the multi-slot modes selection as a finite-horizon Markov decision problem and propose a Delay-Aware LTE WLAN Aggregation (DLWA) algorithm to obtain the optimal transmission modes strategy. Due to the computational complexity of sequential decision problem, we exhibit the threshold structure of LTE usage and develop a low complexity algorithm based on this structure. Moreover, imperfection in LWA backhaul is considered and analyzed in this paper. Simulation results show the DLWA algorithm and threshold-based DLWA algorithm could guarantee the QoS requirement with lower user payment compared with current LTE WLAN interworking schemes.

Cooperation can help unmanned aerial vehicles (UAVs) improve their plans to visit charging stations and avoid congestion, but can be hindered by privacy concerns. We propose a new, privacy preserving, joint routing, and charging scheduling framework which allows multiple cellular-connected UAVs to jointly optimize their routes and charging schedules in a decentralized fashion. The framework allows each UAV to minimize its energy usage and connectivity outage, maximize its recharged energy, ensure its timely arrival, and preserve its privacy concerning its trajectory and destination. The key idea is that we obfuscate probabilistically the destination of each UAV, and design a new noncooperative Bayesian game among the UAVs to find their best routes and charging schedules toward the obfuscated destinations. Another important aspect is that we prove the game is a potential Bayesian game with a pure-strategy Bayesian Nash equilibrium and the best response yielded with the Bellman–Ford algorithm. This new framework preserves the UAVs’ privacy in the sense that an UAV only shares the probability of its visit to a charging station at different times, and its best response is based on an obfuscated destination. Simulations demonstrate that the framework ensures timely arrivals with near-optimal routes and substantially lower complexity than a centralized routing scheme based on brute force.