UAV Autonomous Navigation for Wireless Powered Data Collection with Onboard Deep Q-Network

In a rechargeable wireless sensor network,utilizing the unmanned aerial vehicle(UAV)as a mobile base station(BS)to charge sensors and collect data effectively prolongs the network’s lifetime.In this paper,we jointly optimize the UAV’s flight trajectory and the sensor selection and operation modes to maximize the average data traffic of all sensors within a wireless sensor network(WSN)during finite UAV’s flight time,while ensuring the energy required for each sensor by wireless power transfer(WPT).We consider a practical scenario,where the UAV has no prior knowledge of sensor locations.The UAV performs autonomous navigation based on the status information obtained within the coverage area,which is modeled as a Markov decision process(MDP).The deep Q-network(DQN)is employed to execute the navigation based on the UAV position,the battery level state,channel conditions and current data traffic of sensors within the UAV’s coverage area.Our simulation results demonstrate that the DQN algorithm significantly improves the network performance in terms of the average data traffic and trajectory design.

Maximum-Profit Advertising Strategy Using Crowdsensing Trajectory Data

Out-door billboard advertising plays an important role in attracting potential customers.However,whether a customer can be attracted is influenced by many factors,such as the probability that he/she sees the billboard,the degree of his/her interest,and the detour distance for buying the product.Taking the above factors into account,we propose advertising strategies for selecting an effective set of billboards under the advertising budget to maximize commercial profit.By using the data collected by Mobile Crowdsensing(MCS),we extract potential customers’implicit information,such as their trajectories and preferences.We then study the billboard selection problem under two situations,where the advertiser may have only one or multiple products.When only one kind of product needs advertising,the billboard selection problem is formulated as the probabilistic set coverage problem.We propose two heuristic advertising strategies to greedily select advertising billboards,which achieves the expected maximum commercial profit with the lowest cost.When the advertiser has multiple products,we formulate the problem as searching for an optimal solution and adopt the simulated annealing algorithm to search for global optimum instead of local optimum.Extensive experiments based on three real-world data sets verify that our proposed advertising strategies can achieve the superior commercial profit compared with the state-of-the-art strategies.