arXiv subjects

Huaiyu Dai

Publications and source records attributed to Huaiyu Dai.

At least 73 records · Page 4Linked to original sources

arXiv2021

60 GHz Outdoor Propagation Measurements and Analysis Using Facebook Terragraph Radios

The high attenuation of millimeter-wave (mmWave) would significantly reduce the coverage areas, and hence it is critical to study the propagation characteristics of mmWave in multiple deployment scenarios. In this work, we investigated the propagation and scattering behavior of 60 GHz mmWave signals in outdoor environments at a travel distance of 98 m for an aerial link (rooftop to rooftop), and 147 m for a ground link (light-pole to light-pole). Measurements were carried out using Facebook Terragraph (TG) radios. Results include received power, path loss, signal-to-noise ratio (SNR), and root mean square (RMS) delay spread for all beamforming directions supported by the antenna array. Strong line-of-sight (LOS) propagation exists in both links. We also observed rich multipath components (MPCs) due to edge scatterings in the aerial link, while only LOS and ground reflection MPCs in the other link.

eess.SP↗

arXiv2021

Channel Rank Improvement in Urban Drone Corridors Using Passive Intelligent Reflectors

Multiple-input multiple-output (MIMO) techniques can help in scaling the achievable air-to-ground (A2G) channel capacity while communicating with drones. However, spatial multiplexing with drones suffers from rank deficient channels due to the unobstructed line-of-sight (LoS), especially in millimeter-wave (mmWave) frequencies that use narrow beams. One possible solution is utilizing low-cost and low-complexity metamaterial-based intelligent reflecting surfaces (IRS) to enrich the multipath environment, taking into account that the drones are restricted to fly only within well-defined drone corridors. A hurdle with this solution is placing the IRSs optimally. In this study, we propose an approach for IRS placement with a goal to improve the spatial multiplexing gains, and hence to maximize the average channel capacity in a predefined drone corridor. Our results at 6 GHz, 28 GHz and 60 GHz show that the proposed approach increases the average rates for all frequency bands for a given drone corridor, when compared with the environment where there are no IRSs present, and IRS-aided channels perform close to each other at sub-6 and mmWave bands.

eess.SP↗

arXiv2021

Adversarial training may be a double-edged sword

Adversarial training has been shown as an effective approach to improve the robustness of image classifiers against white-box attacks. However, its effectiveness against black-box attacks is more nuanced. In this work, we demonstrate that some geometric consequences of adversarial training on the decision boundary of deep networks give an edge to certain types of black-box attacks. In particular, we define a metric called robustness gain to show that while adversarial training is an effective method to dramatically improve the robustness in white-box scenarios, it may not provide such a good robustness gain against the more realistic decision-based black-box attacks. Moreover, we show that even the minimal perturbation white-box attacks can converge faster against adversarially-trained neural networks compared to the regular ones.

cs.LG↗

arXiv2021

Application of Deep Learning to Sphere Decoding for Large MIMO Systems

Although the sphere decoder (SD) is a powerful detector for multiple-input multiple-output (MIMO) systems, it has become computationally prohibitive in massive MIMO systems, where a large number of antennas are employed. To overcome this challenge, we propose fast deep learning (DL)-aided SD (FDL-SD) and fast DL-aided $K$-best SD (KSD, FDL-KSD) algorithms. Therein, the major application of DL is to generate a highly reliable initial candidate to accelerate the search in SD and KSD in conjunction with candidate/layer ordering and early rejection. Compared to existing DL-aided SD schemes, our proposed schemes are more advantageous in both offline training and online application phases. Specifically, unlike existing DL-aided SD schemes, they do not require performing the conventional SD in the training phase. For a $24 \times 24$ MIMO system with QPSK, the proposed FDL-SD achieves a complexity reduction of more than $90\%$ without any performance loss compared to conventional SD schemes. For a $32 \times 32$ MIMO system with QPSK, the proposed FDL-KSD only requires $K = 32$ to attain the performance of the conventional KSD with $K=256$, where $K$ is the number of survival paths in KSD. This implies a dramatic improvement in the performance--complexity tradeoff of the proposed FDL-KSD scheme.

cs.IT↗

arXiv2021

Precoder Design for Physical-Layer Security and Authentication in Massive MIMO UAV Communications

Supporting reliable and seamless wireless connectivity for unmanned aerial vehicles (UAVs) has recently become a critical requirement to enable various different use cases of UAVs. Due to their widespread deployment footprint, cellular networks can support beyond visual line of sight (BVLOS) communications for UAVs. In this paper, we consider cellular connected UAVs (C-UAVs) that are served by massive multiple-input-multiple-output (MIMO) links to extend coverage range, while also improving physical layer security and authentication. We consider Rician channel and propose a novel linear precoder design for transmitting data and artificial noise (AN). We derive the closed-form expression of the ergodic secrecy rate of C-UAVs for both conventional and proposed precoder designs. In addition, we obtain the optimal power splitting factor that divides the power between data and AN by asymptotic analysis. Then, we apply the proposed precoder design in the fingerprint embedding authentication framework, where the goal is to minimize the probability of detection of the authentication tag at an eavesdropper. In simulation results, we show the superiority of the proposed precoder in both secrecy rate and the authentication probability considering moderate and large number of antenna massive MIMO scenarios.

eess.SP↗

arXiv2021

Base Station Antenna Uptilt Optimization for Cellular-Connected Drone Corridors

The concept of drone corridors is recently getting more attention to enable connected, safe, and secure flight zones in the national airspace. To support beyond visual line of sight (BVLOS) operations of aerial vehicles in a drone corridor, cellular base stations (BSs) serve as a convenient infrastructure, since such BSs are widely deployed to provide seamless wireless coverage. However, antennas in the existing cellular networks are down-tilted to optimally serve their ground users, which results in coverage holes if they are also used to serve drones. In this letter, we consider the use of additional uptilted antennas at cellular BSs and optimize the uptilt angle to minimize outage probability for a given drone corridor. Our numerical results show how the beamwidth and the maximum drone corridor height affect the optimal value of the antenna uptilt angle.

eess.SP↗

arXiv2021

Hybrid Beamforming and Adaptive RF Chain Activation for Uplink Cell-Free Millimeter-Wave Massive MIMO Systems

In this work, we investigate hybrid analog-digital beamforming (HBF) architectures for uplink cell-free (CF) millimeter-wave (mmWave) massive multiple-input multiple-output (MIMO) systems. {We first propose two HBF schemes, namely, decentralized HBF (D-HBF) and semi-centralized HBF (SC-HBF). In the former, both the digital and analog beamformers are generated independently at each AP based on the local channel state information (CSI). In contrast, in the latter, only the digital beamformer is obtained locally at the AP, whereas the analog beamforming matrix is generated at the central processing unit (CPU) based on the global CSI received from all APs. We show that the analog beamformers generated in these two HBF schemes provide approximately the same achievable rates despite the lower complexity of D-HBF and its lack of CSI requirement.} Furthermore, to reduce the power consumption, we propose a novel adaptive radio frequency (RF) chain-activation (ARFA) scheme, which dynamically activates/deactivates RF chains and their connected analog-to-digital converters (ADCs) and phase shifters (PSs) at the APs based on the CSI. For the activation of RF chains, low-complexity algorithms are proposed, which can achieve significant improvement in energy efficiency (EE) with only a marginal loss in the total achievable rate.

cs.IT↗

arXiv2021

Modeling the Nonsmoothness of Modern Neural Networks

Modern neural networks have been successful in many regression-based tasks such as face recognition, facial landmark detection, and image generation. In this work, we investigate an intuitive but understudied characteristic of modern neural networks, namely, the nonsmoothness. The experiments using synthetic data confirm that such operations as ReLU and max pooling in modern neural networks lead to nonsmoothness. We quantify the nonsmoothness using a feature named the sum of the magnitude of peaks (SMP) and model the input-output relationships for building blocks of modern neural networks. Experimental results confirm that our model can accurately predict the statistical behaviors of the nonsmoothness as it propagates through such building blocks as the convolutional layer, the ReLU activation, and the max pooling layer. We envision that the nonsmoothness feature can potentially be used as a forensic tool for regression-based applications of neural networks.

cs.LG↗

arXiv2021

Spectral Graph Theory Based Resource Allocation for IRS-Assisted Multi-Hop Edge Computing

The performance of mobile edge computing (MEC) depends critically on the quality of the wireless channels. From this viewpoint, the recently advocated intelligent reflecting surface (IRS) technique that can proactively reconfigure wireless channels is anticipated to bring unprecedented performance gain to MEC. In this paper, the problem of network throughput optimization of an IRS-assisted multi-hop MEC network is investigated, in which the phase-shifts of the IRS and the resource allocation of the relays need to be jointly optimized. However, due to the coupling among the transmission links of different hops caused by the utilization of the IRS and the complicated multi-hop network topology, it is difficult to solve the considered problem by directly applying existing optimization techniques. Fortunately, by exploiting the underlying structure of the network topology and spectral graph theory, it is shown that the network throughput can be well approximated by the second smallest eigenvalue of the network Laplacian matrix. This key finding allows us to develop an effective iterative algorithm for solving the considered problem. Numerical simulations are performed to corroborate the effectiveness of the proposed scheme.

cs.IT↗

arXiv2021

On the Privacy Guarantees of Gossip Protocols in General Networks

Recently, the privacy guarantees of information dissemination protocols have attracted increasing research interests, among which the gossip protocols assume vital importance in various information exchange applications. In this work, we study the privacy guarantees of gossip protocols in general networks in terms of differential privacy and prediction uncertainty. First, lower bounds of the differential privacy guarantees are derived for gossip protocols in general networks in both synchronous and asynchronous settings. The prediction uncertainty of the source node given a uniform prior is also determined. For the private gossip algorithm, the differential privacy and prediction uncertainty guarantees are derived in closed form. Moreover, considering that these two metrics may be restrictive in some scenarios, the relaxed variants are proposed. It is found that source anonymity is closely related to some key network structure parameters in the general network setting. Then, we investigate information spreading in wireless networks with unreliable communications, and quantify the tradeoff between differential privacy guarantees and information spreading efficiency. Finally, considering that the attacker may not be present at the beginning of the information dissemination process, the scenario of delayed monitoring is studied and the corresponding differential privacy guarantees are evaluated.

cs.CR↗

arXiv2020

A Fast Graph Neural Network-Based Method for Winner Determination in Multi-Unit Combinatorial Auctions

The combinatorial auction (CA) is an efficient mechanism for resource allocation in different fields, including cloud computing. It can obtain high economic efficiency and user flexibility by allowing bidders to submit bids for combinations of different items instead of only for individual items. However, the problem of allocating items among the bidders to maximize the auctioneers" revenue, i.e., the winner determination problem (WDP), is NP-complete to solve and inapproximable. Existing works for WDPs are generally based on mathematical optimization techniques and most of them focus on the single-unit WDP, where each item only has one unit. On the contrary, few works consider the multi-unit WDP in which each item may have multiple units. Given that the multi-unit WDP is more complicated but prevalent in cloud computing, we propose leveraging machine learning (ML) techniques to develop a novel low-complexity algorithm for solving this problem with negligible revenue loss. Specifically, we model the multi-unit WDP as an augmented bipartite bid-item graph and use a graph neural network (GNN) with half-convolution operations to learn the probability of each bid belonging to the optimal allocation. To improve the sample generation efficiency and decrease the number of needed labeled instances, we propose two different sample generation processes. We also develop two novel graph-based post-processing algorithms to transform the outputs of the GNN into feasible solutions. Through simulations on both synthetic instances and a specific virtual machine (VM) allocation problem in a cloud computing platform, we validate that our proposed method can approach optimal performance with low complexity and has good generalization ability in terms of problem size and user-type distribution.

cs.LG↗

arXiv2020

Physical Layer Security for NOMA Transmission in mmWave Drone Networks

The non-orthogonal multiple access (NOMA) and millimeter-wave (mmWave) transmission enable the unmanned aerial vehicle (UAV) assisted wireless networks to provide broadband connectivity over densely packed urban areas. The presence of malicious receivers, however, compromise the security of the UAV-to-ground communications link, thereby degrading secrecy rates. In this work, we consider a NOMA-based transmission strategy in a mmWave UAV-assisted wireless network, and investigate the respective secrecy-rate performance rigorously. In particular, we propose a protected-zone approach to enhance the secrecy-rate performance by preventing the most vulnerable subregion (outside the user region) from the presence of malicious receivers. The respective secrecy rates are then derived analytically as a function of the protected zone, which verifies great secrecy rate improvements through optimizing shape of the protected zone in use. Furthermore, we show that the optimal protected zone shape for mmWave links appears as a compromise between protecting the angle versus distance dimension, which would otherwise form to protect solely the distance dimension for sub-6GHz links. We also numerically evaluate the impact of transmission power, protected-zone size, and UAV altitude on the secrecy-rate performance improvements as practical considerations.

cs.IT↗

arXiv2020

Energy-Aware Stochastic UAV-Assisted Surveillance

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.

eess.SY↗

arXiv2020

Power Allocation for Fingerprint-Based PHY-Layer Authentication with mmWave UAV Networks

Physical layer security (PLS) techniques can help to protect wireless networks from eavesdropper attacks. In this paper, we consider the authentication technique that uses fingerprint embedding to defend 5G cellular networks with unmanned aerial vehicle (UAV) systems from eavesdroppers and intruders. Since the millimeter wave (mmWave) cellular networks use narrow and directional beams, PLS can take further advantage of the 3D spatial dimension for improving the authentication of UAV users. Considering a multi-user mmWave cellular network, we propose a power allocation technique that jointly takes into account splitting of the transmit power between the precoder and the authentication tag, which manages both the secrecy as well as the achievable rate. Our results show that we can obtain optimal achievable rate with expected secrecy.

eess.SP↗

arXiv2020

From Federated to Fog Learning: Distributed Machine Learning over Heterogeneous Wireless Networks

Machine learning (ML) tasks are becoming ubiquitous in today's network applications. Federated learning has emerged recently as a technique for training ML models at the network edge by leveraging processing capabilities across the nodes that collect the data. There are several challenges with employing conventional federated learning in contemporary networks, due to the significant heterogeneity in compute and communication capabilities that exist across devices. To address this, we advocate a new learning paradigm called fog learning which will intelligently distribute ML model training across the continuum of nodes from edge devices to cloud servers. Fog learning enhances federated learning along three major dimensions: network, heterogeneity, and proximity. It considers a multi-layer hybrid learning framework consisting of heterogeneous devices with various proximities. It accounts for the topology structures of the local networks among the heterogeneous nodes at each network layer, orchestrating them for collaborative/cooperative learning through device-to-device (D2D) communications. This migrates from star network topologies used for parameter transfers in federated learning to more distributed topologies at scale. We discuss several open research directions to realizing fog learning.

cs.DC↗

arXiv2020

Accelerating Generalized Benders Decomposition for Wireless Resource Allocation

Generalized Benders decomposition (GBD) is a globally optimal algorithm for mixed integer nonlinear programming (MINLP) problems, which are NP-hard and can be widely found in the area of wireless resource allocation. The main idea of GBD is decomposing an MINLP problem into a primal problem and a master problem, which are iteratively solved until their solutions converge. However, a direct implementation of GBD is time- and memory-consuming. The main bottleneck is the high complexity of the master problem, which increases over the iterations. Therefore, we propose to leverage machine learning (ML) techniques to accelerate GBD aiming at decreasing the complexity of the master problem. Specifically, we utilize two different ML techniques, classification and regression, to deal with this acceleration task. In this way, a cut classifier and a cut regressor are learned, respectively, to distinguish between useful and useless cuts. Only useful cuts are added to the master problem and thus the complexity of the master problem is reduced. By using a resource allocation problem in device-to-device communication networks as an example, we validate that the proposed method can reduce the computational complexity of GBD without loss of optimality and has strong generalization ability. The proposed method is applicable for solving various MINLP problems in wireless networks since the designs are invariant for different problems.

cs.IT↗

arXiv2020

Distributed ADMM with Synergetic Communication and Computation

In this paper, we propose a novel distributed alternating direction method of multipliers (ADMM) algorithm with synergetic communication and computation, called SCCD-ADMM, to reduce the total communication and computation cost of the system. Explicitly, in the proposed algorithm, each node interacts with only part of its neighboring nodes, the number of which is progressively determined according to a heuristic searching procedure, which takes into account both the predicted convergence rate and the communication and computation costs at each iteration, resulting in a trade-off between communication and computation. Then the node chooses its neighboring nodes according to an importance sampling distribution derived theoretically to minimize the variance with the latest information it locally stores. Finally, the node updates its local information with a new update rule which adapts to the number of communication nodes. We prove the convergence of the proposed algorithm and provide an upper bound of the convergence variance brought by randomness. Extensive simulations validate the excellent performances of the proposed algorithm in terms of convergence rate and variance, the overall communication and computation cost, the impact of network topology as well as the time for evaluation, in comparison with the traditional counterparts.

eess.SP↗

arXiv2020

Lifetime Maximization for UAV-assisted Data Gathering Networks in the Presence of Jamming

Deployment of unmanned aerial vehicles (UAVs) is recently getting significant attention due to a variety of practical use cases, such as surveillance, data gathering, and commodity delivery. Since UAVs are powered by batteries, energy efficient communication is of paramount importance. In this paper, we investigate the problem of lifetime maximization of a UAV-assisted network in the presence of multiple sources of interference, where the UAVs are deployed to collect data from a set of wireless sensors. We demonstrate that the placement of the UAVs play a key role in prolonging the lifetime of the network since the required transmission powers of the UAVs are closely related to their locations in space. In the proposed scenario, the UAVs transmit the gathered data to a primary UAV called \textit{leader}, which is in charge of forwarding the data to the base station (BS) via a backhaul UAV network. We deploy tools from spectral graph theory to tackle the problem due to its high non-convexity. Simulation results demonstrate that our proposed method can significantly improve the lifetime of the UAV network.

eess.SP↗