arXiv subjects

Zhu Han

Publications and source records attributed to Zhu Han.

At least 379 records · Page 21Linked to original sources

arXiv2021

Coalition Game Based Full-duplex Popular Content Distribution in mmWave Vehicular Networks

The millimeter wave (mmWave) communication has drawn intensive attention with abundant band resources. In this paper, we consider the popular content distribution (PCD) problem in the mmWave vehicular network. In order to offload the communication burden of base stations (BSs), vehicle-to-vehicle (V2V) communication is introduced into the PCD problem to transmit contents between on-board units (OBUs) and improve the transmission efficiency. We propose a full-duplex (FD) cooperative scheme based on coalition formation game, and the utility function is provided based on the maximization of the number of received contents. The contribution of each member in the coalition can be transferable to its individual profit. While maximizing the number of received contents in the fixed time, the cooperative scheme also ensures the individual profit of each OBU in the coalition. We evaluate the proposed scheme by extensive simulations in mmWave vehicular networks. Compared with other existing schemes, the proposed scheme has superior performances on the number of possessed contents and system fairness. Besides, the low complexity of the proposed algorithm is demonstrated by the switch operation number and CPU time.

cs.IT↗

arXiv2021

Multi-objective Resource Allocation for D2D and Enabled MC-NOMA Networks by Tchebycheff Method

This paper considers a resource allocation problem in device-to-device (D2D) communications sharing the same frequency spectrum. In particular, the CUs utilize non-orthogonal multiple access (NOMA) while DUs adopt the orthogonal frequency division multiple access (OFDMA). A multi-objective optimization problem (MOOP) is formulated, which jointly maximizes the sum rate of D2D and CUs (CUs) in uplink communications while taking into account the maximum transmit power budget and minimum data rate requirement for D2D and CUs. This MOOP is handled by the weighted Tchebycheff method, which converts it into a single-objective optimization (SOOP). Then, the monotonic optimization approach is employed to solve this SOOP optimally. Numerical results unveil an interesting tradeoff between D2D and CUs.

cs.IT↗

arXiv2021

Risk-Aware Energy Scheduling for Edge Computing with Microgrid: A Multi-Agent Deep Reinforcement Learning Approach

In recent years, multi-access edge computing (MEC) is a key enabler for handling the massive expansion of Internet of Things (IoT) applications and services. However, energy consumption of a MEC network depends on volatile tasks that induces risk for energy demand estimations. As an energy supplier, a microgrid can facilitate seamless energy supply. However, the risk associated with energy supply is also increased due to unpredictable energy generation from renewable and non-renewable sources. Especially, the risk of energy shortfall is involved with uncertainties in both energy consumption and generation. In this paper, we study a risk-aware energy scheduling problem for a microgrid-powered MEC network. First, we formulate an optimization problem considering the conditional value-at-risk (CVaR) measurement for both energy consumption and generation, where the objective is to minimize the expected residual of scheduled energy for the MEC networks and we show this problem is an NP-hard problem. Second, we analyze our formulated problem using a multi-agent stochastic game that ensures the joint policy Nash equilibrium, and show the convergence of the proposed model. Third, we derive the solution by applying a multi-agent deep reinforcement learning (MADRL)-based asynchronous advantage actor-critic (A3C) algorithm with shared neural networks. This method mitigates the curse of dimensionality of the state space and chooses the best policy among the agents for the proposed problem. Finally, the experimental results establish a significant performance gain by considering CVaR for high accuracy energy scheduling of the proposed model than both the single and random agent models.

physics.soc-ph↗

arXiv2020

To Talk or to Work: Flexible Communication Compression for Energy Efficient Federated Learning over Heterogeneous Mobile Edge Devices

Recent advances in machine learning, wireless communication, and mobile hardware technologies promisingly enable federated learning (FL) over massive mobile edge devices, which opens new horizons for numerous intelligent mobile applications. Despite the potential benefits, FL imposes huge communication and computation burdens on participating devices due to periodical global synchronization and continuous local training, raising great challenges to battery constrained mobile devices. In this work, we target at improving the energy efficiency of FL over mobile edge networks to accommodate heterogeneous participating devices without sacrificing the learning performance. To this end, we develop a convergence-guaranteed FL algorithm enabling flexible communication compression. Guided by the derived convergence bound, we design a compression control scheme to balance the energy consumption of local computing (i.e., "working") and wireless communication (i.e., "talking") from the long-term learning perspective. In particular, the compression parameters are elaborately chosen for FL participants adapting to their computing and communication environments. Extensive simulations are conducted using various datasets to validate our theoretical analysis, and the results also demonstrate the efficacy of the proposed scheme in energy saving.

cs.LG↗

arXiv2020

Reconfigurable Intelligent Surface assisted Multi-user Communications: How Many Reflective Elements Do We Need?

Reconfigurable intelligent surfaces (RISs) consisting of multiple reflective elements are a promising technique to enhance communication quality as they can create favorable propagation conditions. In this letter, we characterize the fundamental relations between the number of reflective elements and the system sum-rate in RIS-assisted multi-user communications. It is known from previous works that the received signal-to-noise ratio~(SNR) can linearly increase with the squared number of RIS reflective elements, but how many elements are sufficient to provide an acceptable system sum-rate still remains an open problem. To this end, we derive the asymptotic capacity with zero-forcing (ZF) precoding, and then discuss how many reflective elements are required so that the ratio of the system sum-rate to the capacity can exceed a predefined threshold. Numerical results verify our analysis.

cs.IT↗

arXiv2020

Edge Intelligence for Autonomous Driving in 6G Wireless System: Design Challenges and Solutions

In a level-5 autonomous driving system, the autonomous driving vehicles (AVs) are expected to sense the surroundings via analyzing a large amount of data captured by a variety of onboard sensors in near-real-time. As a result, enormous computing costs will be introduced to the AVs for processing the tasks with the deployed machine learning (ML) model, while the inference accuracy may not be guaranteed. In this context, the advent of edge intelligence (EI) and sixth-generation (6G) wireless networking are expected to pave the way to more reliable and safer autonomous driving by providing multi-access edge computing (MEC) together with ML to AVs in close proximity. To realize this goal, we propose a two-tier EI-empowered autonomous driving framework. In the autonomous-vehicles tier, the autonomous vehicles are deployed with the shallow layers by splitting the trained deep neural network model. In the edge-intelligence tier, an edge server is implemented with the remaining layers (also deep layers) and an appropriately trained multi-task learning (MTL) model. In particular, obtaining the optimal offloading strategy (including the binary offloading decision and the computational resources allocation) can be formulated as a mixed-integer nonlinear programming (MINLP) problem, which is solved via MTL in near-real-time with high accuracy. On another note, an edge-vehicle joint inference is proposed through neural network segmentation to achieve efficient online inference with data privacy-preserving and less communication delay. Experiments demonstrate the effectiveness of the proposed framework, and open research topics are finally listed.

cs.NI↗

arXiv2020

Blockchain Assisted Decentralized Federated Learning (BLADE-FL) with Lazy Clients

Federated learning (FL), as a distributed machine learning approach, has drawn a great amount of attention in recent years. FL shows an inherent advantage in privacy preservation, since users' raw data are processed locally. However, it relies on a centralized server to perform model aggregation. Therefore, FL is vulnerable to server malfunctions and external attacks. In this paper, we propose a novel framework by integrating blockchain into FL, namely, blockchain assisted decentralized federated learning (BLADE-FL), to enhance the security of FL. The proposed BLADE-FL has a good performance in terms of privacy preservation, tamper resistance, and effective cooperation of learning. However, it gives rise to a new problem of training deficiency, caused by lazy clients who plagiarize others' trained models and add artificial noises to conceal their cheating behaviors. To be specific, we first develop a convergence bound of the loss function with the presence of lazy clients and prove that it is convex with respect to the total number of generated blocks $K$. Then, we solve the convex problem by optimizing $K$ to minimize the loss function. Furthermore, we discover the relationship between the optimal $K$, the number of lazy clients, and the power of artificial noises used by lazy clients. We conduct extensive experiments to evaluate the performance of the proposed framework using the MNIST and Fashion-MNIST datasets. Our analytical results are shown to be consistent with the experimental results. In addition, the derived optimal $K$ achieves the minimum value of loss function, and in turn the optimal accuracy performance.

cs.LG↗

arXiv2020

Energy Drain of the Object Detection Processing Pipeline for Mobile Devices: Analysis and Implications

Applying deep learning to object detection provides the capability to accurately detect and classify complex objects in the real world. However, currently, few mobile applications use deep learning because such technology is computation-intensive and energy-consuming. This paper, to the best of our knowledge, presents the first detailed experimental study of a mobile augmented reality (AR) client's energy consumption and the detection latency of executing Convolutional Neural Networks (CNN) based object detection, either locally on the smartphone or remotely on an edge server. In order to accurately measure the energy consumption on the smartphone and obtain the breakdown of energy consumed by each phase of the object detection processing pipeline, we propose a new measurement strategy. Our detailed measurements refine the energy analysis of mobile AR clients and reveal several interesting perspectives regarding the energy consumption of executing CNN-based object detection. Furthermore, several insights and research opportunities are proposed based on our experimental results. These findings from our experimental study will guide the design of energy-efficient processing pipeline of CNN-based object detection.

cs.PF↗

arXiv2020

Controlling the Outbreak of COVID-19: A Noncooperative Game Perspective

COVID-19 is a global epidemic. Till now, there is no remedy for this epidemic. However, isolation and social distancing are seemed to be effective preventive measures to control this pandemic. Therefore, in this paper, an optimization problem is formulated that accommodates both isolation and social distancing features of the individuals. To promote social distancing, we solve the formulated problem by applying a noncooperative game that can provide an incentive for maintaining social distancing to prevent the spread of COVID-19. Furthermore, the sustainability of the lockdown policy is interpreted with the help of our proposed game-theoretic incentive model for maintaining social distancing where there exists a Nash equilibrium. Finally, we perform an extensive numerical analysis that shows the effectiveness of the proposed approach in terms of achieving the desired social-distancing to prevent the outbreak of the COVID-19 in a noncooperative environment. Numerical results show that the individual incentive increases more than 85% with an increasing percentage of home isolation from 25% to 100% for all considered scenarios. The numerical results also demonstrate that in a particular percentage of home isolation, the individual incentive decreases with an increasing number of individuals.

cs.CY↗

arXiv2020

Toward Multiple Federated Learning Services Resource Sharing in Mobile Edge Networks

Federated Learning is a new learning scheme for collaborative training a shared prediction model while keeping data locally on participating devices. In this paper, we study a new model of multiple federated learning services at the multi-access edge computing server. Accordingly, the sharing of CPU resources among learning services at each mobile device for the local training process and allocating communication resources among mobile devices for exchanging learning information must be considered. Furthermore, the convergence performance of different learning services depends on the hyper-learning rate parameter that needs to be precisely decided. Towards this end, we propose a joint resource optimization and hyper-learning rate control problem, namely MS-FEDL, regarding the energy consumption of mobile devices and overall learning time. We design a centralized algorithm based on the block coordinate descent method and a decentralized JP-miADMM algorithm for solving the MS-FEDL problem. Different from the centralized approach, the decentralized approach requires many iterations to obtain but it allows each learning service to independently manage the local resource and learning process without revealing the learning service information. Our simulation results demonstrate the convergence performance of our proposed algorithms and the superior performance of our proposed algorithms compared to the heuristic strategy.

cs.LG↗

arXiv2020

MetaSensing: Intelligent Metasurface Assisted RF 3D Sensing by Deep Reinforcement Learning

Using RF signals for wireless sensing has gained increasing attention. However, due to the unwanted multi-path fading in uncontrollable radio environments, the accuracy of RF sensing is limited. Instead of passively adapting to the environment, in this paper, we consider the scenario where an intelligent metasurface is deployed for sensing the existence and locations of 3D objects. By programming its beamformer patterns, the metasurface can provide desirable propagation properties. However, achieving a high sensing accuracy is challenging, since it requires the joint optimization of the beamformer patterns and mapping of the received signals to the sensed outcome. To tackle this challenge, we formulate an optimization problem for minimizing the cross-entropy loss of the sensing outcome, and propose a deep reinforcement learning algorithm to jointly compute the optimal beamformer patterns and the mapping of the received signals. Simulation results verify the effectiveness of the proposed algorithm and show how the sizes of the metasurface and the target space influence the sensing accuracy.

eess.SP↗

arXiv2020

Energy-Efficient Resource Allocation in Multi-UAV-Assisted Two-Stage Edge Computing for Beyond 5G Networks

Unmanned aerial vehicle (UAV)-assisted multi-access edge computing (MEC) has become one promising solution for energy-constrained devices to meet the computation demand and the stringent delay requirement. In this work, we investigate a multiple UAVs-assisted two-stage MEC system in which the computation-intensive and delay-sensitive tasks of mobile devices (MDs) are cooperatively executed on both MEC-enabled UAVs and terrestrial base station (TBS) attached with the MEC server. Specifically, UAVs provide the computing and relaying services to the mobile devices. In this regard, we formulate a joint task offloading, communication and computation resource allocation problem to minimize the energy consumption of MDs and UAVs by considering the limited communication resources for the uplink transmission, the computation resources of UAVs and the tolerable latency of the tasks. The formulated problem is a mixed-integer non-convex problem which is NP hard. Thus, we relax the channel assignment variable from the binary to continuous values. However, the problem is still non-convex due to the coupling among the variables. To solve the formulated optimization problem, we apply the Block Successive Upper-bound Minimization (BSUM) method which guarantees to obtain the stationary points of the non-convex objective function. In essence, the non-convex objective function is decomposed into multiple subproblems which are then solved in a block-by-block manner. Finally, the extensive evaluation results are conducted to show the superior performance of our proposed framework.

cs.NI↗

arXiv2020

Architectural Design Alternatives based on Cloud/Edge/Fog Computing for Connected Vehicles

As vehicles playing an increasingly important role in people's daily life, requirements on safer and more comfortable driving experience have arisen. Connected vehicles (CVs) can provide enabling technologies to realize these requirements and have attracted widespread attentions from both academia and industry. These requirements ask for a well-designed computing architecture to support the Quality-of-Service (QoS) of CV applications. Computation offloading techniques, such as cloud, edge, and fog computing, can help CVs process computation-intensive and large-scale computing tasks. Additionally, different cloud/edge/fog computing architectures are suitable for supporting different types of CV applications with highly different QoS requirements, which demonstrates the importance of the computing architecture design. However, most of the existing surveys on cloud/edge/fog computing for CVs overlook the computing architecture design, where they (i) only focus on one specific computing architecture and (ii) lack discussions on benefits, research challenges, and system requirements of different architectural alternatives. In this paper, we provide a comprehensive survey on different architectural design alternatives based on cloud/edge/fog computing for CVs. The contributions of this paper are: (i) providing a comprehensive literature survey on existing proposed architectural design alternatives based on cloud/edge/fog computing for CVs, (ii) proposing a new classification of computing architectures based on cloud/edge/fog computing for CVs: computation-aided and computation-enabled architectures, (iii) presenting a holistic comparison among different cloud/edge/fog computing architectures for CVs based on functional requirements of CV systems, including advantages, disadvantages, and research challenges.

cs.NI↗

arXiv2020

An Incentive Mechanism for Federated Learning in Wireless Cellular network: An Auction Approach

Federated Learning (FL) is a distributed learning framework that can deal with the distributed issue in machine learning and still guarantee high learning performance. However, it is impractical that all users will sacrifice their resources to join the FL algorithm. This motivates us to study the incentive mechanism design for FL. In this paper, we consider a FL system that involves one base station (BS) and multiple mobile users. The mobile users use their own data to train the local machine learning model, and then send the trained models to the BS, which generates the initial model, collects local models and constructs the global model. Then, we formulate the incentive mechanism between the BS and mobile users as an auction game where the BS is an auctioneer and the mobile users are the sellers. In the proposed game, each mobile user submits its bids according to the minimal energy cost that the mobile users experiences in participating in FL. To decide winners in the auction and maximize social welfare, we propose the primal-dual greedy auction mechanism. The proposed mechanism can guarantee three economic properties, namely, truthfulness, individual rationality and efficiency. Finally, numerical results are shown to demonstrate the performance effectiveness of our proposed mechanism.

cs.LG↗

arXiv2020

Reconfigurable Intelligent Surface (RIS) Assisted Wireless Coverage Extension: RIS Orientation and Location Optimization

Recently, reconfigurable intelligent surfaces (RIS) have attracted a lot of attention due to their capability of extending cell coverage by reflecting signals toward the receiver. In this letter, we analyze the coverage of a downlink RIS-assisted network with one base station (BS) and one user equipment (UE). Since the RIS orientation and the horizontal distance between the RIS and the BS have a significant influence on the cell coverage, we formulate an RIS placement optimization problem to maximize the cell coverage by optimizing the RIS orientation and horizontal distance. To solve the formulated problem, a coverage maximization algorithm (CMA) is proposed, where a closed-form optimal RIS orientation is obtained. Numerical results verify our analysis.

cs.IT↗

arXiv2020

Sense-Store-Send: Trajectory Optimization for a Buffer-aided Internet of UAVs

In this letter, we study a buffer-aided Internet of unmanned aerial vehicles (UAVs) in which a UAV performs data sensing, stores the data, and sends it to the base station (BS) in cellular networks. To minimize the overall completion time for all the sensing tasks, we formulate a joint trajectory, sensing location, and sensing time optimization problem. To solve this NP-hard problem efficiently, we propose an iterative trajectory, sensing location and sensing time optimization (ITLTO) algorithm, and discuss the trade-off between sensing time and flying time. Simulation results show that the proposed algorithm can effectively reduce the completion time for the sensing tasks.

eess.SP↗

arXiv2020

Beyond Intelligent Reflecting Surfaces: Reflective-Transmissive Metasurface Aided Communications for Full-dimensional Coverage Extension

In this paper, we study an intelligent omni-surface (IOS)-assisted downlink communication system, where the link quality of a mobile user (MU) can be improved with a proper IOS phase shift design. Unlike the intelligent reflecting surface (IRS) in most existing works that only forwards the signals in a reflective way, the IOS is capable to forward the received signals to the MU in either a reflective or a transmissive manner, thereby enhancing the wireless coverage. We formulate an IOS phase shift optimization problem to maximize the downlink spectral efficiency (SE) of the MU. The optimal phase shift of the IOS is analysed, and a branch-and-bound based algorithm is proposed to design the IOS phase shift in a finite set. Simulation results show that the IOS-assisted system can extend the coverage significantly when compared to the IRS-assisted system with only reflective signals.

eess.SP↗

arXiv2020

On Spatial Multiplexing Using Reconfigurable Intelligent Surfaces

We consider an uplink multi-user scenario and investigate the use of reconfigurable intelligent surfaces (RIS) to optimize spatial multiplexing performance when a linear receiver is used. We study two different formulations of the problem, namely maximizing the effective rank and maximizing the minimum singular value of the RIS-augmented channel. We employ gradient-based optimization to solve the two problems and compare the solutions in terms of the sum-rate achievable when a linear receiver is used. Our results show that the proposed criteria can be used to optimize the RIS to obtain effective channels with favorable properties and drastically improve performance even when the propagation through the RIS contributes a small fraction of the received power.

eess.SP↗