Search

Unmanned aerial vehicles (UAVs) are anticipated to be widely deployed in future wireless communications, due to their advantages of high mobility and easy deployment. However, the broadcast nature of air-to-ground line-of-sight wireless channels brings a new challenge to the information security of UAV-ground communication. This paper tackles such a challenge in the physical layer by exploiting the mobility of UAV via its trajectory design. We consider a UAV-ground communication system with multiple potential eavesdroppers on the ground, where the information on the locations of the eavesdroppers is imperfect. We formulate an optimization problem, which maximizes the average worst case secrecy rate of the system by jointly designing the robust trajectory and transmit power of the UAV over a given flight duration. The nonconvexity of the optimization problem and the imperfect location information of the eavesdroppers make the problem difficult to be solved optimally. We propose an iterative suboptimal algorithm to solve this problem efficiently by applying the block coordinate descent method, $\mathcal {S}$ -procedure, and successive convex optimization method. Simulation results show that the proposed algorithm can improve the average worst case secrecy rate significantly, as compared to two other benchmark algorithms without robust design. [ABSTRACT FROM AUTHOR]

The multi-UAV network is promising to extend conventional networks by providing broader coverage, and better reliability. Nevertheless, the broadcast nature of wireless signals, and the broader coverage expose multi-UAV communications to the threats of passive eavesdroppers. Recent studies mainly focus on securing a single legitimate link, or communications between a UAV, and multiple ground users in one/two-UAV-aided networks, while the physical layer secrecy analysis for hierarchical multi-UAV networks is underexplored. In this paper, we investigate a general two-tier UAV network consisting of multiple UAV transmitters (UTs), and multiple UAV receivers (URs) in the presence of multiple UAV eavesdroppers (UEs). To protect all legitimate UT-UR links against UEs at the physical layer, we design a two-stage framework consisting of a UT-UR association stage, and a cooperative transmission stage. Specifically, we formulate the secure transmission problem into a many-to-one matching game followed by an overlapping coalition formation (OCF) game, taking into account the limited capabilities, and the throughput requirements of URs, as well as the transmission power constraints of UTs. A matching algorithm, and an OCF algorithm are proposed to solve these two sequential games whose convergences, and stabilities are guaranteed theoretically. Simulation results show the superiority of our algorithms, and the effectiveness of our two-stage game framework in the terms of secrecy performance. [ABSTRACT FROM AUTHOR]

This paper considers a heavy loaded full-duplex (FD) small cell consisting of one FD base station and multiple half-duplex users where the number of subchannels is less than the number of uplink and downlink users. With the objective of maximizing the total sum-rate, a joint power allocation, and user pairing problem is formulated. To solve this problem, a novel decomposition method is proposed, which decouples the power allocation and user pairing problem into two subproblems. It is proven that the optimal solution of subproblems is the optimal solution of the original problem. Then, optimal algorithms are developed for the two subproblems. Numerical results show that the proposed algorithm achieves better performance compared with the baselines of the greedy algorithm and random pairing algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we investigate the cross-layer resource optimization for wireless relay networks with dynamic node-selfishness information. The degree of intrinsic selfishness (DeIS) and the degree of extrinsic selfishness (DeES) of the relay node (RN) are defined as the effects of its own residual energy resource and the incentive in an incentive mechanism, respectively. A model of two-timescale node-selfishness dynamics is constructed to describe the time-varying characteristics of the RN's DeIS and DeES. Based on the two-timescale node-selfishness dynamics of the RNs, a two-timescale resource-optimization dynamical algorithm (TRODA) is employed to control the transmit powers of both RNs and end users (EU), as well as the flow rates of the data packets injected by all EUs. Meanwhile, the stability and the tracking error of the TRODA under the two-timescale node-selfishness dynamics are analyzed by Lyapunov theory. Our simulation results demonstrate that the two-timescale optimization algorithm is stable and has trivial tracking error. [ABSTRACT FROM AUTHOR]

Cooperative communication (CC) offers an efficient and low-cost way to achieve spatial diversity by forming a virtual antenna array among single-antenna nodes that cooperatively share their antennas. It has been well recognized that the selection of relay nodes plays a critical role in the performance of CC. Most existing relay selection strategies focus on optimizing the outage probability or energy consumption. To fill in the vacancy of research on throughput improvement via CC, we study the relay selection problem with the objective of optimizing the throughput in this paper. For unicast, it is a P problem, and an optimal relay selection algorithm is provided with a correctness proof. For broadcast, we show the challenge of relay selection by proving it nonprobabilistic hard (NP-hard). A greedy heuristic algorithm is proposed to effectively choose a set of relay nodes that maximize the broadcast throughput. Simulation results show that the proposed algorithms can achieve high throughput under various network settings. [ABSTRACT FROM PUBLISHER]

Vehicle-to-vehicle communications via dedicated- short-range-communication (DSRC) devices will enable safety applications such as cooperative collision warning. These devices use the IEEE 802.11p standard to support low-latency vehicle- to-vehicle and vehicle-to-infrastructure communications. How- ever, a major challenge for the cooperative collision warning is to accurately determine the location of vehicles. In this paper, we present a novel cooperative-vehicle-position-estimation algorithm which can achieve a higher accuracy and more reliability than the existing global-positioning-system-based positioning solutions by making use of intervehicle-distance measurements taken by a radio-ranging technique. Our algorithm uses signal-strength-based intervehicle-distance measurements, vehicle kinematics, and road maps to estimate the relative positions of vehicles in a cluster. We have analyzed our algorithm by examining its performance-bound, computational-complexity, and communication- overhead requirements. In addition, we have shown that the accuracy of our algorithm is superior to previously proposed localization algorithms. [ABSTRACT FROM AUTHOR]

The high-speed railway wireless communication network architecture is gradually transforming from a traditional GSM-Railway (GSM-R) cellular network to a 5G heterogeneous ultra-dense communication network. How to effectively deal with the interference while obtaining the capacity gain has become an inevitable problem. This article proposes a power allocation interference alignment algorithm based on game equilibrium with the goal of joint optimization about throughput and energy efficiency for imperfect channels in high-speed railway communication. Firstly, the imperfect Channel State Information including delay and fading is calculated. Then, in order to improve system throughput and energy efficiency, we establish a game model and prove the existence of Nash equilibrium in the model. At the same time, a power allocation iterative algorithm based on Recurrent Neural Network is proposed. Finally, combined with the interference alignment algorithm based on a maximal signal-to-noise ratio, the optimal power matrix is calculated by iteration to achieve interference management optimization. The simulation results prove that our algorithm has superior performance in improving the system throughput, energy efficiency and transmission reliability in high-speed railway wireless communication with imperfect channels. [ABSTRACT FROM AUTHOR]

Device-free identification (DFI) is a promising technique, which could recognize human identity using his/her unique influence on surrounding wireless signals in a device-free and contact-free manner. It could maintain the privacy of a user and enable smart applications to provide customized service for a specific user. Despite its advantages over other person's identification systems, one fundamental problem to solve is that the accuracy of the DFI system is a little bit low due to the extremely noisy wireless measurements. The goal of this work is to explore and exploit a method to extract intrinsic features from the noisy channel state information (CSI) so as to realize high-performance DFI. To this end, we propose a novel empirical-mode-decomposition-based general DFI framework, which decomposes raw noisy CSI measurements into intrinsic mode functions (IMF) and extracts intrinsic features from the IMF components accordingly. Under the proposed framework, we also develop two DFI systems based on the respiration and gait biometric features. Extensive experiments carried out on commodity WiFi reveal that the developed systems could identify a person with an accuracy of over 90% from a group of ten persons. [ABSTRACT FROM AUTHOR]

Many emerging applications, such as security surveillance and smart healthcare, have incubated the device-free localization (DFL) technique, which could estimate the location of a target without equipping any device. However, current DFL system needs labor-intensive training to learn the influence of the target on surrounding wireless signals, so as to provide model parameters or radio maps for the location estimation algorithm. To address this issue, we develop a novel robust training-free DFL system, named DeFi, which could directly estimate the target location by refining the angle-of-arrival (AOA) of the target reflection path based on WiFi channel state information. We analyze the characteristics of the static paths and the motion paths, eliminate the static paths using a background elimination algorithm, and separate out the target reflection path from the motion paths according to the AOA and equivalent time-of-flight measurements. With the AOA of the target reflection path as observation information, we robustly estimate the target location based on a particle filter algorithm. We implement the proposed DeFi system on commodity off-the-shelf WiFi devices and validate its performance in two indoor scenarios. Experimental results show that DeFi achieves a median error of less than 0.6 m. [ABSTRACT FROM AUTHOR]