Searcharxiv⌕ Search

arXiv subjects

Kaibin Huang

Publications and source records attributed to Kaibin Huang.

At least 199 records · Page 11Linked to original sources

Data-Importance Aware User Scheduling for Communication-Efficient Edge Machine Learning

With the prevalence of intelligent mobile applications, edge learning is emerging as a promising technology for powering fast intelligence acquisition for edge devices from distributed data generated at the network edge. One critical task of edge learning is to efficiently utilize the limited radio resource to acquire data samples for model training at an edge server. In this paper, we develop a novel user scheduling algorithm for data acquisition in edge learning, called (data) importance-aware scheduling. A key feature of this scheduling algorithm is that it takes into account the informativeness of data samples, besides communication reliability. Specifically, the scheduling decision is based on a data importance indicator (DII), elegantly incorporating two "important" metrics from communication and learning perspectives, i.e., the signal-to-noise ratio (SNR) and data uncertainty. We first derive an explicit expression for this indicator targeting the classic classifier of support vector machine (SVM), where the uncertainty of a data sample is measured by its distance to the decision boundary. Then, the result is extended to convolutional neural networks (CNN) by replacing the distance based uncertainty measure with the entropy. As demonstrated via experiments using real datasets, the proposed importance-aware scheduling can exploit the two-fold multi-user diversity, namely the diversity in both the multiuser channels and the distributed data samples. This leads to faster model convergence than the conventional scheduling schemes that exploit only a single type of diversity.

cs.NI↗

Energy-Efficient Radio Resource Allocation for Federated Edge Learning

Edge machine learning involves the development of learning algorithms at the network edge to leverage massive distributed data and computation resources. Among others, the framework of federated edge learning (FEEL) is particularly promising for its data-privacy preservation. FEEL coordinates global model training at a server and local model training at edge devices over wireless links. In this work, we explore the new direction of energy-efficient radio resource management (RRM) for FEEL. To reduce devices' energy consumption, we propose energy-efficient strategies for bandwidth allocation and scheduling. They adapt to devices' channel states and computation capacities so as to reduce their sum energy consumption while warranting learning performance. In contrast with the traditional rate-maximization designs, the derived optimal policies allocate more bandwidth to those scheduled devices with weaker channels or poorer computation capacities, which are the bottlenecks of synchronized model updates in FEEL. On the other hand, the scheduling priority function derived in closed form gives preferences to devices with better channels and computation capacities. Substantial energy reduction contributed by the proposed strategies is demonstrated in learning experiments.

cs.IT↗

Hidden Vehicle Sensing via Asynchronous V2V Transmission: A Multi-Path-Geometry Approach

Accurate vehicular sensing is a basic and important operation in autonomous driving. Unfortunately, the existing techniques have their own limitations. For instance, the communication-based approach (e.g., transmission of GPS information) has high latency and low reliability while the reflection-based approach (e.g., RADAR) is incapable of detecting hidden vehicles (HVs) without line-of-sight. This is arguably the reason behind some recent fatal accidents involving autonomous vehicles. To address this issue, this paper presents a novel HV-sensing technology that exploits multi-path transmission from a HV to a sensing vehicle (SV). The powerful technology enables the SV to detect multiple HV-state parameters including position, orientation of driving direction, and size. Its implementation does not even require transmitter-receiver synchronization like conventional mobile positioning techniques. Our design approach leverages estimated information on multi-path (AoA/AoD/ToA) and their geometric relations. As a result, a complex system of equations or optimization problems, where the desired HV-state parameters are variables, can be formulated for different channel-noise conditions. The development of intelligent solution methods ranging from least-square estimator to disk/box minimization yields a set of practical HV-sensing techniques. We study their feasibility conditions in terms of the required number of paths. Furthermore, practical solutions, including sequential path combining and random directional beamforming, are proposed to enable HV-sensing given insufficient paths. Last, realistic simulation of driving in both highway and rural scenarios demonstrates the effectiveness of the proposed techniques. In summary, the proposed technique will enhance the capabilities of existing vehicular sensing technologies by enabling HV-sensing.

cs.IT↗

Joint Frequency-and-Phase Modulation for Backscatter-Tag Assisted Vehicular Positioning

Autonomous driving (auto-driving) has been becoming a killer technology for next generation vehicles, whereas some fatal accidents grow concerns about its safety. A fundamental function for safer auto-driving is to recognize the vehicles' locations, termed vehicular positioning. The state-of-the-art vehicular positioning is to rely on anchors that are stationary objects whose locations are known, i.e. satellites for GPS and base stations for cellular positioning. It is important for reliable positioning to install anchors densely, helping find enough anchors nearby. For the deployment to be cost-effective, there are some trials to use backscatter tags as alternative anchors by deploying them on a road surface, but its gain is limited by several reasons such as short contact time and difficulties in maintenance. Instead, we propose a new backscatter-tag assisted vehicular positioning system where tags are deployed along a roadside, which enables the extension of contact duration and facilitates the maintenance. On the other hand, there is a location mismatch between the vehicle and the tag, calling for developing a new backscatter transmission to estimate their relative position. To this end, we design a novel waveform called joint frequency-and-phase modulation (JFPM) for backscatter-tag assisted vehicular positioning where a transmit frequency is modulated for the distance estimation assuming that the relevant signal is clearly differentiable from the others while the phase modulation helps the differentiation. The JFPM waveform leads to exploiting the maximum Degree-of-Freedoms (DoFs) of backscatter channel in which multiple-access and broadcasting channels coexist, leading to more accurate positioning verified by extensive simulations.

cs.IT↗

Realizing Multi-Point Vehicular Positioning via Millimeter-wave Transmission

Multi-point detection of the full-scale environment is an important issue in autonomous driving. The state-of-the-art positioning technologies (such as RADAR and LIDAR) are incapable of real-time detection without line-of-sight. To address this issue, this paper presents a novel multi-point vehicular positioning technology via \emph{millimeter-wave} (mmWave) transmission that exploits multi-path reflection from a \emph{target vehicle} (TV) to a \emph{sensing vehicle} (SV), which enables the SV to fast capture both the shape and location information of the TV in \emph{non-line-of-sight} (NLoS) under the assistance of multi-path reflections. A \emph{phase-difference-of-arrival} (PDoA) based hyperbolic positioning algorithm is designed to achieve the synchronization between the TV and SV. The \emph{stepped-frequency-continuous-wave} (SFCW) is utilized as signals for multi-point detection of the TVs. Transceiver separation enables our approach to work in NLoS conditions and achieve much lower latency compared with conventional positioning techniques.

cs.IT↗

Learning-based Rate Adaptation for Uplink Massive MIMO Networks with Cooperative Data-Assisted Detection

In this paper, the uplink adaptation for massive multiple-input-multiple-output (MIMO) networks without the knowledge of user density is considered. Specifically, a novel cooperative uplink transmission and detection scheme is first proposed for massive MIMO networks, where each uplink frame is divided into a number of data blocks with independent coding schemes and the following blocks are decoded based on previously detected data blocks in both service and neighboring cells. The asymptotic signal-to-interference-plus-noise ratio (SINR) of the proposed scheme is then derived, and the distribution of interference power considering the randomness of the users' locations is proved to be Gaussian. By tracking the mean and variance of interference power, an online robust rate adaptation algorithm ensuring a target packet outage probability is proposed for the scenario where the interfering channel and the user density are unknown.

cs.IT↗

Next Generation Backscatter Communication: Systems, Techniques and Applications

The rapid growth of IoT driven by recent advancements in consumer electronics, 5G communication technologies, and cloud-computing enabled big-data analytics, has recently attracted tremendous attention from both the industry and academia. One of the major open challenges for IoT is the limited network lifetime due to massive IoT devices being powered by batteries with finite capacities. The low-power and low-complexity backscatter communications (BackCom), which simply relies on passive reflection and modulation of an incident radio-frequency (RF) wave, has emerged to be a promising technology for tackling this challenge. However, the contemporary BackCom has several major limitations, such as short transmission range, low data rate, and uni-directional information transmission. The article aims at introducing the recent advances in the active area of BackCom. Specifically, we provide a systematic introduction of the next generation BackCom covering basic principles, systems, techniques besides IoT applications. Lastly, we describe the IoT application scenarios with the next generation BackCom.

cs.IT↗

Wireless Data Acquisition for Edge Learning: Data-Importance Aware Retransmission

By deploying machine-learning algorithms at the network edge, edge learning can leverage the enormous real-time data generated by billions of mobile devices to train AI models, which enable intelligent mobile applications. In this emerging research area, one key direction is to efficiently utilize radio resources for wireless data acquisition to minimize the latency of executing a learning task at an edge server. Along this direction, we consider the specific problem of retransmission decision in each communication round to ensure both reliability and quantity of those training data for accelerating model convergence. To solve the problem, a new retransmission protocol called data-importance aware automatic-repeat-request (importance ARQ) is proposed. Unlike the classic ARQ focusing merely on reliability, importance ARQ selectively retransmits a data sample based on its uncertainty which helps learning and can be measured using the model under training. Underpinning the proposed protocol is a derived elegant communication-learning relation between two corresponding metrics, i.e., signal-to-noise ratio (SNR) and data uncertainty. This relation facilitates the design of a simple threshold based policy for importance ARQ. The policy is first derived based on the classic classifier model of support vector machine (SVM), where the uncertainty of a data sample is measured by its distance to the decision boundary. The policy is then extended to the more complex model of convolutional neural networks (CNN) where data uncertainty is measured by entropy. Extensive experiments have been conducted for both the SVM and CNN using real datasets with balanced and imbalanced distributions. Experimental results demonstrate that importance ARQ effectively copes with channel fading and noise in wireless data acquisition to achieve faster model convergence than the conventional channel-aware ARQ.

cs.IT↗

Broadband Analog Aggregation for Low-Latency Federated Edge Learning (Extended Version)

The popularity of mobile devices results in the availability of enormous data and computational resources at the network edge. To leverage the data and resources, a new machine learning paradigm, called edge learning, has emerged where learning algorithms are deployed at the edge for providing fast and intelligent services to mobile users. While computing speeds are advancing rapidly, the communication latency is becoming the bottleneck of fast edge learning. To address this issue, this work is focused on designing a low latency multi-access scheme for edge learning. We consider a popular framework, federated edge learning (FEEL), where edge-server and on-device learning are synchronized to train a model without violating user-data privacy. It is proposed that model updates simultaneously transmitted by devices over broadband channels should be analog aggregated "over-the-air" by exploiting the superposition property of a multi-access channel. Thereby, "interference" is harnessed to provide fast implementation of the model aggregation. This results in dramatical latency reduction compared with the traditional orthogonal access (i.e., OFDMA). In this work, the performance of FEEL is characterized targeting a single-cell random network. First, due to power alignment between devices as required for aggregation, a fundamental tradeoff is shown to exist between the update-reliability and the expected update-truncation ratio. This motivates the design of an opportunistic scheduling scheme for FEEL that selects devices within a distance threshold. This scheme is shown using real datasets to yield satisfactory learning performance in the presence of high mobility. Second, both the multi-access latency of the proposed analog aggregation and the OFDMA scheme are analyzed. Their ratio, which quantifies the latency reduction of the former, is proved to scale almost linearly with device population.

cs.IT↗

Dense Moving Fog for Intelligent IoT: Key Challenges and Opportunities

As the ratification of 5G New Radio technology is being completed, enabling network architectures are expected to undertake a matching effort. Conventional cloud and edge computing paradigms may thus become insufficient in supporting the increasingly stringent operating requirements of \emph{intelligent~Internet-of-Things (IoT) devices} that can move unpredictably and at high speeds. Complementing these, the concept of fog emerges to deploy cooperative cloud-like functions in the immediate vicinity of various moving devices, such as connected and autonomous vehicles, on the road and in the air. Envisioning gradual evolution of these infrastructures toward the increasingly denser geographical distribution of fog functionality, we in this work put forward the vision of dense moving fog for intelligent IoT applications. To this aim, we review the recent powerful enablers, outline the main challenges and opportunities, and corroborate the performance benefits of collaborative dense fog operation in a characteristic use case featuring a connected fleet of autonomous vehicles.

cs.NI↗

Reduced-Dimension Design of MIMO Over-the-Air Computing for Data Aggregation in Clustered IoT Networks

One basic operation of Internet-of-Things (IoT) networks is aggregating distributed sensing-data over wireless-channels for function-computation, called wireless-data-aggregation (WDA). Targeting dense sensors, a recently developed technology called over-the-air computing (AirComp) can dramatically reduce the WDA latency by aggregating distributed data "over-the-air" using the waveform-superposition property of a multi-access channel. In this work, we design multiple-input-multiple-output (MIMO) AirComp for computing a vector-valued function in a clustered IoT network with multi-antenna sensors forming clusters and a multi-antenna access-point (AP) performing WDA. The resultant high-dimensional but low-rank MIMO channels makes it important to reduce channel or signal dimensionality in AirComp to avoid exposure to noise from channel null-spaces. Motivated by this, we develop a framework of reduced-dimension MIMO AirComp, featuring decomposed-aggregation-beamforming (DAB). Consider the case of separable channel-clusters with non-overlapping angle-of-arrival ranges. The optimal DAB has the structure where inner-components extract the dominant eigen-spaces of corresponding channel-clusters and outer-components jointly equalize the resultant low-dimensional channels. Consider the more complex case of inseparable clusters. We propose a suboptimal DAB design where the inner-component performs both dimension-reduction and joint-equalization over clustered-channel covariance matrices and the outer-component jointly equalizes the small-scale fading-channels. Furthermore, efficient algorithms for rank-optimization of individual DAB components and channel-feedback leveraging the AirComp principle are developed.

cs.IT↗

Multiuser Computation Offloading and Downloading for Edge Computing with Virtualization

Mobile-edge computing (MEC) is an emerging technology for enhancing the computational capabilities of mobile devices and reducing their energy consumption via offloading complex computation tasks to the nearby servers. Multiuser MEC at servers is widely realized via parallel computing based on virtualization. Due to finite shared I/O resources, interference between virtual machines (VMs), called I/O interference, degrades the computation performance. In this paper, we study the problem of joint radio-and-computation resource allocation (RCRA) in multiuser MEC systems in the presence of I/O interference. Specifically, offloading scheduling algorithms are designed targeting two system performance metrics: sum offloading throughput maximization and sum mobile energy consumption minimization. Their designs are formulated as non-convex mixed-integer programming problems, which account for latency due to offloading, result downloading and parallel computing. A set of low-complexity algorithms are designed based on a decomposition approach and leveraging classic techniques from combinatorial optimization. The resultant algorithms jointly schedule offloading users, control their offloading sizes, and divide time for communication (offloading and downloading) and computation. They are either optimal or can achieve close-to-optimality as shown by simulation. Comprehensive simulation results demonstrate considering of I/O interference can endow on an offloading controller robustness against the performance-degradation factor.

cs.IT↗

Towards an Intelligent Edge: Wireless Communication Meets Machine Learning

The recent revival of artificial intelligence (AI) is revolutionizing almost every branch of science and technology. Given the ubiquitous smart mobile gadgets and Internet of Things (IoT) devices, it is expected that a majority of intelligent applications will be deployed at the edge of wireless networks. This trend has generated strong interests in realizing an "intelligent edge" to support AI-enabled applications at various edge devices. Accordingly, a new research area, called edge learning, emerges, which crosses and revolutionizes two disciplines: wireless communication and machine learning. A major theme in edge learning is to overcome the limited computing power, as well as limited data, at each edge device. This is accomplished by leveraging the mobile edge computing (MEC) platform and exploiting the massive data distributed over a large number of edge devices. In such systems, learning from distributed data and communicating between the edge server and devices are two critical and coupled aspects, and their fusion poses many new research challenges. This article advocates a new set of design principles for wireless communication in edge learning, collectively called learning-driven communication. Illustrative examples are provided to demonstrate the effectiveness of these design principles, and unique research opportunities are identified.

cs.IT↗

Wirelessly Powered Data Aggregation for IoT via Over-the-Air Functional Computation: Beamforming and Power Control

As a revolution in networking, Internet of Things (IoT) aims at automating the operations of our societies by connecting and leveraging an enormous number of distributed devices (e.g., sensors and actuators). One design challenge is efficient wireless data aggregation (WDA) over tremendous IoT devices. This can enable a series of IoT applications ranging from latency-sensitive high-mobility sensing to data-intensive distributed machine learning. Over-the-air (functional) computation (AirComp) has emerged to be a promising solution that merges computing and communication by exploiting analogwave addition in the air. Another IoT design challenge is battery recharging for dense sensors which can be tackled by wireless power transfer (WPT). The coexisting of AirComp and WPT in IoT system calls for their integration to enhance the performance and efficiency of WDA. This motivates the current work on developing the wirelessly powered AirComp (WP-AirComp) framework by jointly optimizing wireless power control, energy and (data) aggregation beamforming to minimize the AirComp error. To derive a practical solution, we recast the non-convex joint optimization problem into the equivalent outer and inner sub-problems for (inner) wireless power control and energy beamforming, and (outer) the efficient aggregation beamforming, respectively. The former is solved in closed form while the latter is efficiently solved using the semidefinite relaxation technique. The results reveal that the optimal energy beams point to the dominant eigen-directions of the WPT channels, and the optimal power allocation tends to equalize the close-loop (down-link WPT and up-link AirComp) effective channels of different sensors. Simulation demonstrates that controlling WPT provides additional design dimensions for substantially reducing the AirComp error.

cs.IT↗

Grassmannian Learning: Embedding Geometry Awareness in Shallow and Deep Learning

Modern machine learning algorithms have been adopted in a range of signal-processing applications spanning computer vision, natural language processing, and artificial intelligence. Many relevant problems involve subspace-structured features, orthogonality constrained or low-rank constrained objective functions, or subspace distances. These mathematical characteristics are expressed naturally using the Grassmann manifold. Unfortunately, this fact is not yet explored in many traditional learning algorithms. In the last few years, there have been growing interests in studying Grassmann manifold to tackle new learning problems. Such attempts have been reassured by substantial performance improvements in both classic learning and learning using deep neural networks. We term the former as shallow and the latter deep Grassmannian learning. The aim of this paper is to introduce the emerging area of Grassmannian learning by surveying common mathematical problems and primary solution approaches, and overviewing various applications. We hope to inspire practitioners in different fields to adopt the powerful tool of Grassmannian learning in their research.

cs.LG↗

Connectivity and Blockage Effects in Millimeter-Wave Air-To-Everything Networks

Millimeter-wave (mmWave) offers high data rate and bandwidth for air-to-everything (A2X) communications including air-to-air, air-to-ground, and air-to-tower. MmWave communication in the A2X network is sensitive to buildings blockage effects. In this paper, we propose an analytical framework to define and characterise the connectivity for an aerial access point (AAP) by jointly using stochastic geometry and random shape theory. The buildings are modelled as a Boolean line-segment process with fixed height. The blocking area for an arbitrary building is derived and minimized by optimizing the altitude of AAP. A lower bound on the connectivity probability is derived as a function of the altitude of AAP and different parameters of users and buildings including their densities, sizes, and heights. Our study yields guidelines on practical mmWave A2X networks deployment.

cs.IT↗

Fast Analog Transmission for High-Mobility Wireless Data Acquisition in Edge Learning

By implementing machine learning at the network edge, edge learning trains models by leveraging rich data distributed at edge devices (e.g., smartphones and sensors) and in return endow on them capabilities of seeing, listening, and reasoning. In edge learning, the need of high-mobility wireless data acquisition arises in scenarios where edge devices (or even servers) are mounted on the ground or aerial vehicles. In this paper, we present a novel solution, called fast analog transmission (FAT), for high- mobility data acquisition in edge-learning systems, which has several key features. First, FAT incurs low-latency. Specifically, FAT requires no source-and-channel coding and no channel training via the proposed technique of Grassmann analog encoding (GAE) that encodes data samples into subspace matrices. Second, FAT supports spatial multiplexing by directly transmitting analog vector data over an antenna array. Third, FAT can be seamlessly integrated with edge learning (i.e., training of a classifier model in this work). In particular, by applying a Grassmannian-classification algorithm from computer vision, the received GAE encoded data can be directly applied to training the model without decoding and conversion. This design is found by simulation to outperform conventional schemes in learning accuracy due to its robustness against data distortion induced by fast fading.

cs.IT↗

Asynchronous Mobile-Edge Computation Offloading: Energy-Efficient Resource Management

Mobile-edge computation offloading (MECO) is an emerging technology for enhancing mobiles' computation capabilities and prolonging their battery lives, by offloading intensive computation from mobiles to nearby servers such as base stations. In this paper, we study the energy-efficient resource-management policy for the asynchronous MECO system, where the mobiles have heterogeneous input-data arrival time instants and computation deadlines. First, we consider the general case with arbitrary arrival-deadline orders. Based on the monomial energy-consumption model for data transmission, an optimization problem is formulated to minimize the total mobile-energy consumption under the time-sharing and computation-deadline constraints. The optimal resource-management policy for data partitioning (for offloading and local computing) and time division (for transmissions) is shown to be computed by using the block coordinate decent method. To gain further insights, we study the optimal resource-management design for two special cases. First, consider the case of identical arrival-deadline orders, i.e., a mobile with input data arriving earlier also needs to complete computation earlier. The optimization problem is reduced to two sequential problems corresponding to the optimal scheduling order and joint data-partitioning and time-division given the optimal order. It is found that the optimal time-division policy tends to balance the defined effective computing power among offloading mobiles via time sharing. Furthermore, this solution approach is extended to the case of reverse arrival-deadline orders. The corresponding time-division policy is derived by a proposed transformation-and-scheduling approach, which first determines the total offloading duration and data size for each mobile in the transformation phase and then specifies the offloading intervals for each mobile in the scheduling phase.

cs.IT↗