Source author record

Ivan Wang-Hei Ho

Ivan Wang-Hei Ho appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

6works
4topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

6 published item(s)

preprint2026arXiv

Scene-Adaptive Continual Learning for CSI-based Human Activity Recognition with Mixture of Experts

Channel state information (CSI)-based human activity recognition (HAR) is vulnerable to performance degradation under domain shifts across varying physical environments. Continual learning (CL) offers a principled way to learn new domains sequentially while preserving past knowledge, but existing CL solutions for CSI-based HAR scale poorly with accumulating domains, rely on a large replay buffer, or incur linearly growing inference cost. In this letter, we propose Scene-Adaptive Mixture of Experts with Clustered Specialists (SAMoE-C), which formulates cross-domain CSI-based HAR as a mixture-of-experts system that enables scene-specific adaptation, via an attention-based semantic router that activates only selected experts for each input. Moreover, we develop a novel training protocol, which requires only a tiny replay buffer for stabilizing domain discrimination of the router. Experimental results on a four-scene CSI dataset demonstrate that SAMoE-C approaches the state-of-the-art accuracy, while maintaining a significantly lower inference cost. By jointly combining modular experts, selective activation with router and a lightweight training protocol, SAMoE-C enables scalable cross-domain CSI-based HAR deployment with low training overhead and high computational efficiency in real-world settings.

preprint2022arXiv

Complex Network Analysis of the Bitcoin Transaction Network

In this brief, we conduct a complex-network analysis of the Bitcoin transaction network. In particular, we design a new sampling method, namely random walk with flying-back (RWFB), to conduct effective data sampling. We then conduct a comprehensive analysis of the Bitcoin network in terms of the degree distribution, clustering coefficient, the shortest-path length, connected component, centrality, assortativity, and the rich-club coefficient. We obtain several important observations including the small-world phenomenon, multi-center status, preferential attachment, and non-rich-club effect of the current network. This work brings up an in-depth understanding of the current Bitcoin blockchain network and offers implications for future directions in malicious activity and fraud detection in cryptocurrency blockchain networks.

preprint2020arXiv

Efficient 3D Road Map Data Exchange for Intelligent Vehicles in Vehicular Fog Networks

Through connecting intelligent vehicles as well as the roadside infrastructure, the perception range of vehicles can be significantly extended, and hidden objects at blind spots can be efficiently detected and avoided. To realize this, accurate road map data must be downloaded in real time to these intelligent vehicles for navigation and localization purposes. Besides, the cloud must be updated with dynamic changes that happened in the road network. These involve the transmissions of high-definition 3D road map data for accurately representing the physical environments. In this work, we propose solutions under the fog computing architecture in a heterogeneous vehicular network to optimize data exchange among intelligent vehicles, the roadside infrastructure, as well as regional databases. Specifically, the efficiency of 3D road map data dissemination at roadside fog nodes is achieved by exploiting index coding techniques to reduce the overall data load, while opportunistic scheduling of heterogeneous transmissions can be done to judiciously manage network resources and minimize operating cost. In addition, 3D point cloud coding and hashing techniques are applied to expedite the updates of various dynamic changes in the network. We empirically evaluate the proposed solutions based on real-world mobility traces of vehicles and 3D LIght Detection And Ranging (LIDAR) data of city streets. The proposed system is also implemented in a multi-robotic testbed for practical evaluation.

preprint2016arXiv

Implementation of a FPGA-Based Feature Detection and Networking System for Real-time Traffic Monitoring

With the growing demand of real-time traffic monitoring nowadays, software-based image processing can hardly meet the real-time data processing requirement due to the serial data processing nature. In this paper, the implementation of a hardware-based feature detection and networking system prototype for real-time traffic monitoring as well as data transmission is presented. The hardware architecture of the proposed system is mainly composed of three parts: data collection, feature detection, and data transmission. Overall, the presented prototype can tolerate a high data rate of about 60 frames per second. By integrating the feature detection and data transmission functions, the presented system can be further developed for various VANET application scenarios to improve road safety and traffic efficiency. For example, detection of vehicles that violate traffic rules, parking enforcement, etc.

preprint2014arXiv

Technical Report: A Methodology for Studying 802.11p VANET Broadcasting Performance with Practical Vehicle Distribution

In a Vehicular Ad-hoc Network (VANET), the performance of the communication protocol is influenced heavily by the vehicular density dynamics. However, most of the previous works on VANET performance modeling paid little attention to vehicle distribution, or simply assumed homogeneous car distribution. It is obvious that vehicles are distributed non-homogeneously along a road segment due to traffic signals and speed limits at different portions of the road, as well as vehicle interactions that are significant on busy streets. In light of the inadequacy, we present in this paper an original methodology to study the broadcasting performance of 802.11p VANETs with practical vehicle distribution in urban environments. Firstly, we adopt the empirically verified stochastic traffic models, which incorporates the effect of urban settings (such as traffic lights and vehicle interactions) on car distribution and generates practical vehicular density profiles. Corresponding 802.11p protocol and performance models are then developed. When coupled with the traffic models, they can predict broadcasting efficiency, delay, as well as throughput performance of 802.11p VANETs based on the knowledge of car density at each location on the road. Extensive simulation is conducted to verify the accuracy of the developed mathematical models with the consideration of vehicle interaction. In general, our results demonstrate the applicability of the proposed methodology on modeling protocol performance in practical signalized road networks, and shed insights into the design and development of future communication protocols and networking functions for VANETs.

preprint2012arXiv

A Methodology for Studying VANET Performance with Practical Vehicle Distribution in Urban Environment

In a Vehicular Ad-hoc Network (VANET), the amount of interference from neighboring nodes to a communication link is governed by the vehicle density dynamics in vicinity and transmission probabilities of terminals. It is obvious that vehicles are distributed non-homogeneously along a road segment due to traffic controls and speed limits at different portions of the road. The common assumption of homogeneous node distribution in the network in most of the previous work in mobile ad-hoc networks thus appears to be inappropriate in VANETs. In light of the inadequacy, we present in this paper an original methodology to study the performance of VANETs with practical vehicle distribution in urban environment. Specifically, we introduce the stochastic traffic model to characterize the general vehicular traffic flow as well as the randomness of individual vehicles, from which we can acquire the mean dynamics and the probability distribution of vehicular density. As illustrative examples, we demonstrate how the density knowledge from the stochastic traffic model can be utilized to derive the throughput and progress performance of three routing strategies in different channel access protocols. We confirm the accuracy of the analytical results through extensive simulations. Our results demonstrate the applicability of the proposed methodology on modeling protocol performance, and shed insight into the performance analysis of other transmission protocols and network configurations in vehicular networks. Furthermore, we illustrate that the optimal transmission probability for optimized network performance can be obtained as a function of the location space from our results. Such information can be computed by road-side nodes and then broadcasted to road users for optimized multi-hop packet transmission in the communication network.