Chou S.-F.Yu Y.-J.Pang A.-C.AI-CHUN PANG2019-07-112019-07-112018978153866355415502252https://scholars.lib.ntu.edu.tw/handle/123456789/41319487th IEEE Vehicular Technology Conference, VTC Spring 2018, 3 June 2018 through 6 June 2018One viable and cost-effective method to fulfill the ever-increasing mobile broadband traffic and to achieve coverage and capacity improvement is the employment of mobile small cells in next generation cellular networks. Being agile and resilient, aerial small cells (ASCs), which are small cells mounted on unmanned aerial vehicles (UAVs), are deemed promising platforms for the provision of wireless services. Since the lifetime of an airborne network highly depends on the residual battery capacity available to each ASC, it is essential to account for the energy expenditure on various flying actions in a flight plan. Therefore, the focus of this paper is to study the 3D deployment problem for a swarm of ASCs, in which a trade-off among flight altitudes, energy expenses and available lifetimes is observed. The objective is to maximize the total throughput of all users. We formulate the problem as a non-convex non-linear optimization problem and propose an energy-aware 3D deployment algorithm to resolve it with the aid of Lagrangian dual relaxation, interior-point and subgradient projection methods. We then conduct a series of simulations to evaluate the performance of our proposed algorithm. Simulation results manifest that our proposed algorithm can bring tremendous increase in the total throughput for all users by properly coping with the trade-off, compared to the two user-aware approaches with random and minimum altitude assignments. ? 2018 IEEE.3D deploymentaerial small cellcellular networkmaneuvering powerunmanned aerial vehicleEnergy-aware 3D aerial small-cell deployment over next generation cellular networksconference paper10.1109/VTCSpring.2018.84177352-s2.0-85050957296https://www.scopus.com/inward/record.uri?eid=2-s2.0-85050957296&doi=10.1109%2fVTCSpring.2018.8417735&partnerID=40&md5=21aad61402492ceb4b5fc01e49a2c7f0