Secure UAV Random Networks With Minimum Safety Distance
نویسندگان
چکیده
In this correspondence, we study the physical layer security in a stochastic unmanned aerial vehicles (UAVs) network from network-wide perspective, where locations of UAVs are modeled as Mat$\acute{\text{e}}$rn hard-core point process (MHCPP) to characterize minimum safety distance between UAVs, and users eavesdroppers Poisson cluster process, respectively. adopt zero-forcing precoding serve multiple ground emit artificial noise combat eavesdropping. We derive approximations for coverage probability secrecy typical user, with which throughput whole network. Numerical results show analytical can well approximate simulation results. Impacts parameters on performance shown.
منابع مشابه
Generalized Transitive Distance with Minimum Spanning Random Forest
Transitive distance is an ultrametric with elegant properties for clustering. Conventional transitive distance can be found by referring to the minimum spanning tree (MST). We show that such distance metric can be generalized onto a minimum spanning random forest (MSRF) with element-wise max pooling over the set of transitive distance matrices from an MSRF. Our proposed approach is both intuiti...
متن کاملMinimum Throughput Maximization in UAV-Aided Wireless Powered Communication Networks
This paper investigates unmanned aerial vehicle (UAV)-aided wireless powered communication network (WPCN) systems where a mobile access point (AP) at the UAV serves multiple energyconstrained ground terminals (GTs). Specifically, the UAVs first charge the GTs by transmitting the wireless energy transfer (WET) signals in the downlink. Then, by utilizing the harvested wireless energy from the UAV...
متن کاملDistance distributions in random networks
To account for stochastic properties when modeling connectivity in wireless mobile systems such as cellular, ad-hoc and sensor networks, spatial points processes are used. Since connectivity can be expressed as a function of distance between nodes distance distributions between points in spatial processes are of special importance. In this paper we survey those results available for distance di...
متن کاملTriple-loop networks with arbitrarily many minimum distance diagrams
Minimum distance diagrams are a way to encode the diameter and routing information of multi-loop networks. For the widely studied case of double-loop networks, it is known that each network has at most two such diagrams and that they have a very definite form (" L-shape "). In contrast, in this paper we show that there are triple-loop networks with an arbitrarily big number of associated minimu...
متن کاملMinimum distance estimation for random coefficient autoregressive models
In this paper, we extend the minimum distance method of Beran (1993) to random coefficient autoregressive (RCA) models. After stating the necessary assumptions the asymptotic properties of the minimum distance estimator are derived. A M S classification: 62M05
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Vehicular Technology
سال: 2021
ISSN: ['0018-9545', '1939-9359']
DOI: https://doi.org/10.1109/tvt.2021.3057786