Unmanned Aerial Vehicles (UAV) have revolutionized the aircraft industry in this decade. UAVs are now capable of carrying out remote sensing, remote monitoring, courier delivery, and a lot more. A lot of research is happening on making UAVs more robust using energy harvesting techniques to have a better battery lifetime, network performance and to secure against attackers. UAV networks are many times used for unmanned missions. There have been many attacks on civilian, military, and industrial targets that were carried out using remotely controlled or automated UAVs. This continued misuse has led to research in preventing unauthorized UAVs from causing damage to life and property. In this paper, we present a literature review of UAVs, UAV attacks, and their prevention using anti-UAV techniques. We first discuss the different types of UAVs, the regulatory laws for UAV activities, their use cases, recreational, and military UAV incidents. After understanding their operation, various techniques for monitoring and preventing UAV attacks are described along with case studies.

Multi-channel wireless networks are increasingly deployed as infrastructure networks, e.g. in metro areas. Network nodes frequently employ directional antennas to improve spatial throughput. In such networks, between two nodes, it is of interest to compute a path with a channel assignment for the links such that the path and link bandwidths are the same. This is achieved when any two consecutive links are assigned different channels, termed as "Channel-Discontinuity-Constraint" (CDC). CDC-paths are also useful in systems, where, preferably, consecutive links are assigned different time-slots. In the first part of this paper, we develop a -spanner for CDC-paths using spatial properties; a sub-network containing () links, for any > 0, such that CDC-paths increase in cost by at most a factor = (1-2 sin (2)). We propose a novel distributed algorithm to compute the spanner using an expected number of ( log ) fixed-size messages. In the second part, we present a distributed algorithm to find minimum-cost CDC-paths between two nodes using () fixed-size messages, by developing an extension of Edmonds' algorithm for minimum-cost perfect matching. In a centralized implementation, our algorithm runs in () time improving the previous best algorithm which requires () running time. Moreover, this running time improves to () when used in conjunction with the spanner developed.

This paper presents novel store-and-forward packet routing algorithms for Wireless Body Area Networks () with frequent postural partitioning. A prototype has been constructed for experimentally characterizing on-body topology disconnections in the presence of ultra short range radio links, unpredictable RF attenuation, and human postural mobility. On-body DTN routing protocols are then developed using a stochastic link cost formulation, capturing multi-scale topological localities in human postural movements. Performance of the proposed protocols are evaluated experimentally and via simulation, and are compared with a number of existing single-copy DTN routing protocols and an on-body packet flooding mechanism that serves as a performance benchmark with delay lower-bound. It is shown that via multi-scale modeling of the spatio-temporal locality of on-body link disconnection patterns, the proposed algorithms can provide better routing performance compared to a number of existing probabilistic, opportunistic, and utility-based DTN routing protocols in the literature.

The use of wireless communications in industrial applications has motivated various advances in manufacturing automation by allowing more flexibility in installing wireless sensors and actuators than their wired counterparts. The main challenge in industrial wireless deployment is the strict timing and reliability requirements in these systems. Industrial wireless networks are commonly characterized by strict packet deadlines. As a result, Time Division Multiple Access (TDMA) protocols have been widely exploited in various technologies due to their ease of implementation and packet collision avoidance. Moreover, the use of frame-based protocols is motivated by the need for short processing times at the edge nodes of the network. In this work, we consider the problem of scheduling multiple data flows over a wireless network operating in an industrial environment. These flows are characterized by random strict deadlines for each packet following a given probability distribution. Each of these flows may represent the data coming from a sensor to the controller or the control commands from the controller to an actuator. A randomized frame-based scheduling scheme is analyzed where each time slot in the frame is assigned to a data flow randomly.