A Survey of Air-to-Ground Propagation Channel Modeling for Unmanned Aerial Vehicles

In recent years, there has been a dramatic increase in the use of unmanned aerial vehicles (UAVs), particularly for small UAVs, due to their affordable prices, ease of availability, and ease of operability. Existing and future applications of UAVs include remote surveillance and monitoring, relief operations, package delivery, and communication backhaul infrastructure. Additionally, UAVs are envisioned as an important component of 5G wireless technology and beyond. The unique application scenarios for UAVs necessitate accurate air-to-ground (AG) propagation channel models for designing and evaluating UAV communication links for control/non-payload as well as payload data transmissions. These AG propagation models have not been investigated in detail when compared to terrestrial propagation models. In this paper, a comprehensive survey is provided on available AG channel measurement campaigns, large and small scale fading channel models, their limitations, and future research directions for UAV communication scenarios

Research and Design of a Routing Protocol in Large-Scale Wireless Sensor Networks

无线传感器网络，作为全球未来十大技术之一，集成了传感器技术、嵌入式计算技术、分布式信息处理和自组织网技术，可实时感知、采集、处理、传输网络分布区域内的各种信息数据，在军事国防、生物医疗、环境监测、抢险救灾、防恐反恐、危险区域远程控制等领域具有十分广阔的应用前景。 本文研究分析了无线传感器网络的已有路由协议，并针对大规模的无线传感器网络设计了一种树状路由协议，它根据节点地址信息来形成路由，从而简化了复杂繁冗的路由表查找和维护，节省了不必要的开销，提高了路由效率，实现了快速有效的数据传输。 为支持此路由协议本文提出了一种自适应动态地址分配算——ADAR（AdaptiveDynamicAddre...As one of the ten high technologies in the future, wireless sensor network, which is the integration of micro-sensors, embedded computing, modern network and Ad Hoc technologies, can apperceive, collect, process and transmit various information data within the region. It can be used in military defense, biomedical, environmental monitoring, disaster relief, counter-terrorism, remote control of haz...学位：工学硕士院系专业：信息科学与技术学院通信工程系_通信与信息系统学号：2332007115216

Mixed-Strategy Chance Constrained Optimal Control

No abstract availabl

Joint Chance-Constrained Dynamic Programming

No abstract availabl

Joint Chance-Constrained Dynamic Programming

This paper presents a novel dynamic programming algorithm with a joint chance constraint, which explicitly bounds the risk of failure in order to maintain the state within a specified feasible region. A joint chance constraint cannot be handled by existing constrained dynamic programming approaches since their application is limited to constraints in the same form as the cost function, that is, an expectation over a sum of one-stage costs. We overcome this challenge by reformulating the joint chance constraint into a constraint on an expectation over a sum of indicator functions, which can be incorporated into the cost function by dualizing the optimization problem. As a result, the primal variables can be optimized by a standard dynamic programming, while the dual variable is optimized by a root-finding algorithm that converges exponentially. Error bounds on the primal and dual objective values are rigorously derived. We demonstrate the algorithm on a path planning problem, as well as an optimal control problem for Mars entry, descent and landing. The simulations are conducted using a real terrain data of Mars, with four million discrete states at each time step