Decision-based black-box attacks often necessitate a large number of queries to craft an adversarial example. Moreover, decision-based attacks based on querying boundary points in the estimated normal vector direction often suffer from inefficiency and convergence issues. In this paper, we propose a novel query-efficient curvature-aware geometric decision-based black-box attack (CGBA) that conducts boundary search along a semicircular path on a restricted 2D plane to ensure finding a boundary point successfully irrespective of the boundary curvature. While the proposed CGBA attack can work effectively for an arbitrary decision boundary, it is particularly efficient in exploiting the low curvature to craft high-quality adversarial examples, which is widely seen and experimentally verified in commonly used classifiers under non-targeted attacks. In contrast, the decision boundaries often exhibit higher curvature under targeted attacks. Thus, we develop a new query-efficient variant, CGBA-H, that is adapted for the targeted attack. In addition, we further design an algorithm to obtain a better initial boundary point at the expense of some extra queries, which considerably enhances the performance of the targeted attack. Extensive experiments are conducted to evaluate the performance of our proposed methods against some well-known classifiers on the ImageNet and CIFAR10 datasets, demonstrating the superiority of CGBA and CGBA-H over state-of-the-art non-targeted and targeted attacks, respectively. The source code is available at https://github.com/Farhamdur/CGBA.

We investigate a transmission mechanism aiming to improve the data rate between a base station (BS) and a user equipment (UE) through deploying multiple relaying UAVs. We consider the effect of interference incurred by another established communication network, which makes our problem challenging and different from the state of the art. We aim to design the 3D trajectories and power allocation for the UAVs to maximize the data flow of the network while keeping the interference on the existing communication network below a threshold. We utilize the mobility feature of the UAVs to evade the (un)-intended interference caused by (un)-intentional interferers. To this end, we propose an alternating-maximization approach to jointly obtain the 3D trajectories and the UAVs transmission powers. We handle the 3D trajectory design by resorting to spectral graph theory and subsequently address the power allocation through convex optimization techniques. We also approach the problem from the intentional interferer’s perspective where smart jammers chase the UAVs to effectively degrade the data flow of the network. We also extend our work to the case for multiple UEs. Finally, we demonstrate the efficacy of our proposed method through extensive simulations.

With the ease of deployment, capabilities of evading the jammers and obscuring their existence, unmanned aerial vehicles (UAVs) are one of the most suitable candidates to perform surveillance. There exists a body of literature in which the inspectors follow a deterministic trajectory to conduct surveillance, which results in a predictable environment for malicious entities. Thus, introducing randomness to the surveillance is of particular interest. In this work, we propose a novel framework for stochastic UAV-assisted surveillance that i) inherently considers the battery constraints of the UAVs, ii) proposes random moving patterns modeled via random walks, and iii) adds another degree of randomness to the system via considering probabilistic inspections. We formulate the problem of interest, i.e., obtaining the energy-efficient random walk and inspection policies of the UAVs subject to probabilistic constraints on inspection criteria of the sites and battery consumption of the UAVs, which turns out to be signomial programming that is highly non-convex. To solve it, we propose a centralized and a distributed algorithm along with their performance guarantee. This work contributes to both UAV-assisted surveillance and classic random walk literature by designing random walks with random inspection policies on weighted graphs with energy limited random walkers.

Adversarial examples are known as carefully perturbed images fooling image classifiers. We propose a geometric framework to generate adversarial examples in one of the most challenging black-box settings where the adversary can only generate a small number of queries, each of them returning the top-1 label of the classifier. Our framework is based on the observation that the decision boundary of deep networks usually has a small mean curvature in the vicinity of data samples. We propose an effective iterative algorithm to generate query-efficient black-box perturbations with small p norms which is confirmed via experimental evaluations on state-of-the-art natural image classifiers. Moreover, for p=2, we theoretically show that our algorithm actually converges to the minimal perturbation when the curvature of the decision boundary is bounded. We also obtain the optimal distribution of the queries over the iterations of the algorithm. Finally, experimental results confirm that our principled black-box attack algorithm performs better than state-of-the-art algorithms as it generates smaller perturbations with a reduced number of queries.

The integration of unmanned aerial vehicles (UAVs) into the terrestrial communications networks with a variety of tasks is viewed as a key technology for 5G and beyond. In this work, we consider the uplink millimeter-wave (mmWave) transmission between a set of UAVs and a base station (BS), where the UAVs deploy uplink non-orthogonal multiple access (NOMA) in multiple clusters. Furthermore, the BS also serves its own desired ground user equipment (UE) in the presence of many other ground UEs associated with other cells, which share the same frequency band. Considering the limited energy budget of UAVs, we formulate an energy efficiency (EE) problem, and propose a solution aided by the Dinkelbach's algorithm and successive convex approximation (SCA). Using realistic air-to-ground (A2G) and terrestrial channel models, we assess the performance of the proposed algorithm under various circumstances (maximum transmit power for UAVs, quality-of-service (QoS) constraint for the desired UE, etc.), and identify the best use cases.

We consider the relaying application of unmanned aerial vehicles (UAVs), in which UAVs are placed between two transceivers (TRs) to increase the throughput of the system. Instead of studying the placement of UAVs as pursued in existing literature, we focus on investigating the placement of a jammer or a major source of interference on the ground to effectively degrade the performance of the system, which is measured by the maximum achievable data rate of transmission between the TRs. We demonstrate that the optimal placement of the jammer is in general a non-convex optimization problem, for which obtaining the solution directly is intractable. Afterward, using the inherent characteristics of the signal-to-interference ratio (SIR) expressions, we propose a tractable approach to find the optimal position of the jammer. Based on the proposed approach, we investigate the optimal positioning of the jammer in both dual-hop and multi-hop UAV relaying settings. Numerical simulations are provided to evaluate the performance of our proposed method.

We consider unmanned aerial vehicle (UAV)-assisted wireless communication employing UAVs as relays to increase the throughput between a pair of transmitter and receiver. We focus on developing effective methods to position the UAV(s) in the presence of interference in the environment, the existence of which makes the problem non-trivial and our methodology different from the current art. We study the optimal position planning, which aims to maximize the (average) signal-to-interference-ratio (SIR) of the system, in the presence of: i) one major source of interference, ii) stochastic interference. For each scenario, we first consider utilizing a single UAV in the dual-hop relay mode and determine its optimal position. Afterward, multiple UAVs in the multi-hop relay mode are considered, for which we investigate two novel problems concerned with determining the optimal number of required UAVs and developing an optimal distributed position alignment method. Subsequently, we propose a cost-effective method that simultaneously minimizes the number of UAVs and determines their optimal positions to guarantee a certain (average) SIR of the system. Alternatively, for a given number of UAVs, we develop a fully distributed placement algorithm along with its performance guarantee. Numerical simulations are provided to evaluate the performance of our proposed methods.

The deployment of the unmanned aerial vehicle (UAV) has been foreseen as a promising technology for the next generation communication networks. The distance limitation imposed by the line of sight RF connection can be removed by using RF coverage from existing commercial cellular service. In this work, we consider a transmission mechanism that aims to improve the data rate between a terrestrial base station (BS) and user equipment (UE) through deploying multiple UAVs relaying the desired data flow. Considering the coexistence of this network with other established communication networks, we take into account the effect of interference, which is incurred by the existing nodes. Our primary goal is to optimize the three-dimensional (3D) trajectories and power allocation for the relaying UAVs to maximize the data flow while keeping the interference to existing nodes below a predefined threshold. An alternating-maximization strategy is proposed to solve the joint 3D trajectory design and power allocation for the relaying UAVs. To this end, we handle the information exchange within the network by resorting to spectral graph theory and subsequently address the power allocation through convex optimization techniques. Simulation results show that our approach can considerably improve the information flow while the interference threshold constraint is met.

We consider unmanned aerial vehicle (UAV)-assisted wireless communication employing UAVs as relay nodes to increase the throughput between a pair of transmitter and receiver. We focus on developing effective methods to position the UAV(s) in the sky in the presence of a major source of interference, the existence of which makes the problem non-trivial. First, we consider utilizing a single UAV, for which we develop a theoretical framework to determine its optimal position aiming to maximize the SIR of the system. To this end, we investigate the problem for three practical scenarios, in which the position of the UAV is: (i) vertically fixed, horizontally adjustable; (ii) horizontally fixed, vertically adjustable; (iii) both horizontally and vertically adjustable. Afterward, we consider employing multiple UAVs, for which we propose a cost-effective method that simultaneously minimizes the number of required UAVs and determines their optimal positions so as to guarantee a certain SIR of the system. We further develop a distributed placement algorithm, which can increase the SIR of the system given an arbitrary number of UAVs. Numerical simulations are provided to evaluate the performance of our proposed methods.

RF-powered backscatter communication is a promising new technology that can be deployed for battery-free applications such as internet of things (IoT) and wireless sensor networks (WSN). However, since this kind of communication is based on the ambient RF signals and battery-free devices, they are vulnerable to interference and jamming. In this paper, we model the interaction between the user and a smart interferer in an ambient backscatter communication network as a game. We design the utility functions of both the user and interferer in which the backscattering time is taken into the account. The convexity of both sub-game optimization problems is proved and the closed-form expression for the equilibrium of the Stackelberg game is obtained. Due to lack of information about the system SNR and transmission strategy of the interferer, the optimal strategy is obtained using the Q-learning algorithm in a dynamic iterative manner. We further introduce hotbooting Q-learning as an effective approach to expedite the convergence of the traditional Q-learning. Simulation results show that our approach can obtain considerable performance improvement in comparison to random and fixed backscattering time transmission strategies and improves the convergence speed of Q-Learning by about 31%.

Vehicular ad-hoc networks (VANETs) have recently attracted a lot of attention due to their immense potentials and applications. Wide range of coverage and accessibility to end users make VANETs a good target for commercial companies. In this paper, we consider a scenario in which advertising companies aim to disseminate their advertisements in different areas of a city by utilizing VANETs infrastructure. These companies compete for renting the VANETs infrastructure to spread their advertisements. We partition the city map into different blocks, and consider a manager for all the blocks who is in charge of splitting the time between interested advertising companies. Each advertising company (AdC) is charged proportional to the allocated time. In order to find the best time splitting between AdCs, we propose a Stackelberg game scheme in which the block manager assigns the companies to the blocks and imposes the renting prices to different companies in order to maximize its own profit. Based on this, AdCs request the amount of time they desire to rent the infrastructure in order to maximize their utilities. To obtain the Stackelberg equilibrium of the game, a mixed integer nonlinear optimization problem is solved using the proposed optimal and sub-optimal algorithms. The simulation results demonstrate that the sub-optimal algorithm approaches the optimal one in performance with lower complexity.

Aerial base station (ABS) is a promising solution for public safety as it can be deployed in coexistence with cellular networks to form a temporary communication network. However, the interference from the primary cellular network may severely degrade the performance of an ABS network. With this consideration, an adaptive dynamic interference avoidance scheme is proposed in this work for ABSs coexisting with a primary network. In the proposed scheme, the mobile ABSs can reconfigure their locations to mitigate the interference from the primary network, so as to better relay the data from the designated source(s) to destination(s). To this end, the single/multi-commodity maximum flow problems are formulated and the weighted Cheeger constant is adopted as a criterion to improve the maximum flow of the ABS network. In addition, a distributed algorithm is proposed to compute the optimal ABS moving directions. Moreover, the trade-off between the maximum flow and the shortest path trajectories is investigated and an energy-efficient approach is developed as well. Simulation results show that the proposed approach is effective in improving the maximum network flow and the energy-efficient approach can save up to 39% of the energy for the ABSs with marginal degradation in the maximum network flow.

Using radio frequency (RF) coverage from the existing cellular networks is an attractive option to maintain beyond visual line-of-sight (BVLOS) connectivity with drones. These cellular drones can connect with a ground control station (GCS) for control and data delivery wherever cellular service is available. However, RF coverage for these cellular networks has been optimized for the ground users and while they do leak upwards, reliable RF coverage exists to only about 400 feet high. As the drones are becoming more commonly used for activities ranging from emergency responses to aerial deliveries, the base stations covering users both on the ground and in the air with RF transmission cannot scale to the capacity needed to support increasing number of drones. Use of directional beams that are necessary for millimeter wave (mmWave) transmission in the 5G cellular system can reduce interference among users, and hence increase capacity compared to sector based transmissions used for 4G systems without massive MIMO (mMIMO). In this paper, considering the multiplicative capacity gains needed to support large number of drones, we propose a separate mmWave cellular network with optimized coverage for a ''drone corridor'' in the air. We present our current findings in the following areas critical to validating the effectiveness of this proposed network: 1) RF propagation characteristics towards drones in the air compared with propagation towards users on the ground; 2) use of multiple access (MA) technology for increased spectral efficiency for a swarm of drones; 3) optimal design of protected zones and beamforming to secure drone specific wireless communications.

Deployment of femtocells have emerged as a promising technique to address the need for the exponentially increasing mobile traffic demand. They can also improve the capacity and coverage for the indoor wireless users. However, the cross-tier interference in such heterogeneous networks between the femtocells and the macrocells is a design challenge which should be answered before such deployment. In this paper, a spectrum-sharing OFDMA femtocell network is considered in which the macrocell base station protects itself and its users by pricing the interference from femtocell access points. A price-based resource allocation is formulated as a Stackelberg game model to jointly maximize the revenue of the macrocell and the utility of the femtocell users (FUEs) while a predetermined tolerable cross-interference constraint at the macrocell is met. In the proposed model, the macrocell determines the subchannel assignment and the interference prices for the FUEs. Then, the FUEs choose their optimal downlink power. To find the Stackelberg equilibrium, the optimization problems of the leader and the followers are solved. For the followers' sub-game, a closed form expression is obtained. To find the leader's sub-game solution, the non-convex mixed integer nonlinear (MINLP) problem is first converted to an equivalent convex MINLP. Then, we employ the outer approximation (OA) to iteratively and efficiently solve the leader problem. The numerical results validate the convergence of the OA algorithm and the operation of our price-based scheme.

Heterogeneous cellular networks are a promising approach in achieving better quality of service and coverage. They are also a relief for the exponentially increasing data traffic demand. Small cell access points (SAPs) typically rely on out-ofband communication links for backhaul which can be wired or wireless. In this paper, we investigate the price-based resource allocation problem in a self-backhauled SAP. In our scenario, an imperfect full duplex SAP uses the same radio access spectrum for both access and backhaul links to forward the traffic of users from a base station to the user equipments (UEs). In our system model, the SAP charges each UE proportional to the amount of the power it uses to transmit to that UE. A Stackelberg game model is proposed to model and investigate the joint utility maximization problem of the SAP and UEs. We will assume an aggregate transmit power constraint in the SAP. In our game model, the SAP is leader and UEs are the followers. We formulate the utility maximization problems of both leader and followers as optimization problems. We prove that both sub-games are convex problems which ensures their tractability.We also propose a novel algorithm to obtain the Stackelberg equilibrium of the game. Numerical results validate our proposed priced based resource allocation scheme.