Vincent W. S. Wong

Vincent W. S. Wong

Auto-generated profile, based on publicly available information

Vincent W. S. Wong

Department of Electrical and Computer Engineering, The University of British Columbia, Vancouver, BC, Canada

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 November 2020 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
MTMing Tang
Ming Tang
VWVincent W.S. Wong
Vincent W.S. Wong
In mobile edge computing systems, an edge node may have a high load when a large number of mobile devices offload their tasks to it. Those offloaded tasks may experience large processing delay or even be dropped when their deadlines expire. Due to the uncertain load dynamics at the edge nodes, it is challenging for each device to determine its offloading decision (i.e., whether to offload or not, and which edge node it should offload its task to) in a decentralized manner. In this work, we consider non-divisible and delay-sensitive tasks as well as edge load dynamics, and formulate a task offloading problem to minimize the expected long-term cost. We propose a model-free deep reinforcement learning-based distributed algorithm, where each device can determine its offloading decision without knowing the task models and offloading decision of other devices. To improve the estimation of the long-term cost in the algorithm, we incorporate the long short-term memory (LSTM), dueling deep Q-network (DQN), and double-DQN techniques. Simulation results show that our proposed algorithm can better exploit the processing capacities of the edge nodes and significantly reduce the ratio of dropped tasks and average delay when compared with several existing algorithms.

17 May 2018 in IEEE Internet of Things Journal
Verified
Journal Article
Closed access
HSHamed Shah-Mansouri
Hamed Shah-Mansouri
VWVincent W. S. Wong
Vincent W. S. Wong
Fog computing, which provides low-latency computing services at the network edge, is an enabler for the emerging Internet of Things (IoT) systems. In this paper, we study the allocation of fog computing resources to the IoT users in a hierarchical computing paradigm including fog and remote cloud computing services. We formulate a computation offloading game to model the competition between IoT users and allocate the limited processing power of fog nodes efficiently. Each user aims to maximize its own quality of experience (QoE), which reflects its satisfaction of using computing services in terms of the reduction in computation energy and delay. Utilizing a potential game approach, we prove the existence of a pure Nash equilibrium (NE) and provide an upper bound for the price of anarchy. Since the time complexity to reach the equilibrium increases exponentially in the number of users, we further propose a near-optimal resource allocation mechanism and prove that in a system with N IoT users, it achieves an ε-NE in O(N/ε time. Through numerical studies, we evaluate the users' QoE as well as the equilibrium efficiency. Our results reveal that by utilizing the proposed mechanism, more users benefit from computing services in comparison to an existing offloading mechanism. We further show that our proposed mechanism significantly reduces the computation delay and enables low-latency fog computing services for delay-sensitive IoT applications.

2 July 2019 in IEEE Transactions on Power Systems
Verified
Journal Article
Closed access
Hongseok KimHongseok Kim
Hongseok Kim
JLJoohee Lee
Joohee Lee
Shahab BahramiShahab Bahrami
Shahab Bahrami
VWVincent W. S. Wong
Vincent W. S. Wong
Recent advancement of distributed renewable generation has motivated microgrids to trade energy directly with one another, as well as with the utility, in order to minimize their operational costs. Energy trading among microgrids, however, confronts challenges such as reaching a fair trading price, maximizing participants' profit, and satisfying power network constraints. In this paper, we formulate the direct energy trading among multiple microgrids as a generalized Nash bargaining (GNB) problem that involves the distribution network's operational constraints (e.g., power balance equations, voltage limits). We prove that solving the GNB problem maximizes the social welfare and also fairly distributes the revenue among the microgrids based on their market power. To address the nonconvexity of the GNB problem, we propose a two-phase approach. The first phase involves solving the optimal power flow problem in a distributed fashion using the alternative direction method of multipliers to determine the amount of energy trading. The second phase determines the market clearing price and mutual payments of the microgrids. Simulation results on an IEEE 33-bus system with four microgrids show that the proposed framework substantially reduces total network cost by 37.2%. Our results suggest direct trading need be enforced by regulators to maximize the social welfare.

18 June 2024 in Proceedings of the IEEE
Verified
Journal Article
Closed access
BCBruno Clerckx
Bruno Clerckx
YMYijie Mao
Yijie Mao
ZYZhaohui Yang
Zhaohui Yang
MCMingzhe Chen
Mingzhe Chen
AAAhmed Alkhateeb
Ahmed Alkhateeb
JMJuan Montojo
Juan Montojo
Multiple access (MA) is a crucial part of any wireless system and refers to techniques that make use of the resource dimensions (e.g., time, frequency, power, antenna, code, and message) to serve multiple users/devices/machines/ services, ideally in the most efficient way. Given the increasing need of multifunctional wireless networks for integrated communications, sensing, localization, and computing, coupled with the surge of machine learning (ML)/artificial intelligence (AI) in wireless networks, MA techniques are expected to experience a paradigm shift in 6G and beyond. In this article, we provide a tutorial, survey, and outlook on past, emerging, and future MA techniques and pay particular attention to how wireless network intelligence and multifunctionality will lead to a rethinking of those techniques. This article starts with an overview of orthogonal, physical-layer multicasting, space domain, power domain (PD), rate-splitting, code-domain MAs, MAs in other domains, and random access (RA), and highlights the importance of conducting research in universal MA (UMA) to shrink instead of grow the knowledge tree of MA schemes by providing a unified understanding of MA schemes across all resource dimensions. It then jumps into rethinking MA schemes in the era of wireless network intelligence, covering AI for MA such as AI-empowered resource allocation, optimization, channel estimation, and receiver designs, for different MA schemes, and MA for AI such as federated learning (FL)/edge intelligence and over-the-air computation (AirComp). We then discuss MA for network multifunctionality and the interplay between MA and integrated sensing, localization, and communications, covering MA for joint sensing and communications, multimodal sensing-aided communications, multimodal sensing and digital twin-assisted communications, and communication-aided sensing/localization systems. We finish with studying MA for emerging intelligent applications such as semantic communications (SeComs), virtual reality (VR), and smart radio and reconfigurable intelligent surfaces (RISs), before presenting a roadmap toward 6G standardization. Throughout the text, we also point out numerous directions that are promising for future research.

30 October 2025 in IEEE Wireless Communications
Verified
Journal Article
Closed access
ZYZheng Yang
Zheng Yang
NWNing Wang
Ning Wang
YSYanshi Sun
Yanshi Sun
ZDZhiguo Ding
Zhiguo Ding
RSRobert Schober
Robert Schober
ODOctavia A. Dobre
Octavia A. Dobre
Abstract Flexible-antenna systems, such as fluid antennas and movable antennas, have been recognized as key enabling technologies for sixth-generation (6G) wireless networks, as they can intelligently reconfigure the effective channel gains of the users and hence can significantly improve their data transmission capabilities. However, existing flexible-antenna systems have been designed to combat small-scale fading under non-line-of-sight (NLoS) conditions. As a result, they lack the ability to establish line-of-sight (LoS) links, which are typically 100 times stronger than NLoS links. In addition, existing flexible-antenna systems have limited flexibility, where adding/removing an antenna is not straightforward. This article introduces an innovative flexible-antenna system called pinching antennas, which are realized by applying small dielectric particles to the waveguides. We first describe the basics of pinching-antenna systems and their ability to provide strong LoS links by deploying pinching antennas close to the users as well as their capability to scale up/down the antenna system. We then focus on communication scenarios with different numbers of waveguides and pinching antennas, where innovative approaches to implement multiple-input multiple-output and non-orthogonal multiple access are discussed. In addition, 6G-related applications of pinching antennas, including integrated sensing and communication and next-generation multiple access, are described. Finally, important directions for future research, such as waveguide deployment and channel estimation, are highlighted.

10 November 2020 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
Shahab BahramiShahab Bahrami
Shahab Bahrami
YCYu Christine Chen
Yu Christine Chen
VWVincent W. S. Wong
Vincent W. S. Wong
Load aggregators can use demand response programs to motivate residential users toward reducing electricity demand during peak time periods. This paper proposes a demand response algorithm for residential users, while accounting for uncertainties in the load demand and electricity price, users’ privacy concerns, and power flow constraints imposed by the distribution network. To address the uncertainty issues, we develop a deep reinforcement learning (DRL) algorithm using an actor-critic method. We apply federated learning to enable users to determine the neural network parameters in a decentralized fashion without sharing private information (e.g., load demand, users’ potential discomfort due to load scheduling). To tackle the nonconvex power flow constraints, we apply convex relaxation and transform the problem of updating the neural network parameters into a sequence of semidefinite programs (SDPs). Simulations on an IEEE 33-bus test feeder with 32 households show that the proposed demand response algorithm can reduce the peak load by 33% and the expected cost of each user by 13%. Also, we demonstrate the scalability of the proposed algorithm in 330-bus and 1650-bus feeders with real-time pricing scheme. Keywords: demand response, deep reinforcement learning, federated learning, power flow, semidefinite program.