Wai-Choong Wong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wai-Choong Wong has a total of 141 co-authors. Here are the top co-authors by number of shared publications:
Qibin Sun
Hewlett-Packard, Shanghai, China
8 shared publications- Chen-Khong Tham
Department of Electrical and Computer Engineering, National University of Singapore, Singapore
6 shared publications John Apostolopoulos
6 shared publications- Mehul Motani
National University of Singapore
6 shared publications Zhishou Zhang
Hewlett-Packard, Shanghai, China
6 shared publicationsHuaqun Guo
Cryptography & Security Department, Institute for Infocomm Research, A∗STAR, Singapore
5 shared publications
Latest Publications
- 23 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (10) , 14740-14757
A Hybrid Reinforcement Learning-Based Method for Generating Privacy-Preserving Trajectories in Low-Density Traffic Environments
Intelligent Transportation Systems (ITS) optimize road network capacity, monitor traffic flow, and enhance overall road safety by analyzing real-time trajectory data. However, the utilization of such data raises privacy concerns, enabling potential attackers to gain insights into users’ real-time activities and personal information. Furthermore, existing privacy preservation methods have multiple limitations, particularly in low-traffic density environments. To address these issues, this paper presents a novel approach for generating realistic trajectories that evade tracking. Existing trajectory generation mechanisms are coarse-grained and cannot adequately preserve the quality of location-based services while safeguarding individual privacy. To overcome this limitation, we first use differential privacy to determine a location near the actual destination and employ a path search algorithm to extract relevant road information. Subsequently, by leveraging our hybrid reinforcement learning model, we generate trajectories leading to this fictitious point. The comparison conducted on real-world maps with other trajectory generation methods reveals its superior ability to preserve spatio-temporal features. Finally, we propose two approaches that use the generated trajectories to protect privacy, ensuring both individual privacy protection and the utility of data.
- 23 May 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (10) , 14740-14757
A Hybrid Reinforcement Learning-Based Method for Generating Privacy-Preserving Trajectories in Low-Density Traffic Environments
Intelligent Transportation Systems (ITS) optimize road network capacity, monitor traffic flow, and enhance overall road safety by analyzing real-time trajectory data. However, the utilization of such data raises privacy concerns, enabling potential attackers to gain insights into users’ real-time activities and personal information. Furthermore, existing privacy preservation methods have multiple limitations, particularly in low-traffic density environments. To address these issues, this paper presents a novel approach for generating realistic trajectories that evade tracking. Existing trajectory generation mechanisms are coarse-grained and cannot adequately preserve the quality of location-based services while safeguarding individual privacy. To overcome this limitation, we first use differential privacy to determine a location near the actual destination and employ a path search algorithm to extract relevant road information. Subsequently, by leveraging our hybrid reinforcement learning model, we generate trajectories leading to this fictitious point. The comparison conducted on real-world maps with other trajectory generation methods reveals its superior ability to preserve spatio-temporal features. Finally, we propose two approaches that use the generated trajectories to protect privacy, ensuring both individual privacy protection and the utility of data.
- Open Access
- 9 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 5, 428-439
A Framework for Tradeoff Between Location Privacy Preservation and Quality of Experience in Location Based Services
Location-based services find a number of applications in vehicular environments such as navigation, parking, infortainment etc. However, the disclosure of vehicles' location information raises multiple privacy issues. To balance the tradeoff between privacy and utility, this paper proposes a framework to preserve users' location privacy while delivering the desired quality of experience (QoE). The proposed framework allows users to quantify the data utility while accessing location-based services under different privacy levels through the QoE metric. The privacy analysis of the proposed framework is provided under two adversary models. Finally, the effectiveness of the proposed framework is demonstrate using the real-world “Dianping” review dataset.
- 9 February 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Vehicular Technology
- Vol. 5, 428-439
Open AccessA Framework for Tradeoff Between Location Privacy Preservation and Quality of Experience in Location Based Services
Location-based services find a number of applications in vehicular environments such as navigation, parking, infortainment etc. However, the disclosure of vehicles' location information raises multiple privacy issues. To balance the tradeoff between privacy and utility, this paper proposes a framework to preserve users' location privacy while delivering the desired quality of experience (QoE). The proposed framework allows users to quantify the data utility while accessing location-based services under different privacy levels through the QoE metric. The privacy analysis of the proposed framework is provided under two adversary models. Finally, the effectiveness of the proposed framework is demonstrate using the real-world “Dianping” review dataset.
- 7 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (12) , 16538-16552
A Geo-Indistinguishable Context-Based Mix Strategy for Trajectory Protection in VANETs
Vehicular Ad-Hoc Networks (VANETs), the backbone of Intelligent Transportation Systems (ITS), can significantly improve traffic efficiency and road safety. However, preserving privacy during data transmission and storage is a significant issue in vehicular communications. To prevent malicious adversaries from tracking vehicles from the beacons they broadcast, pseudonym-changing or obfuscation strategies have been proposed in literature. However, it is challenging to protect the privacy of vehicles while simultaneously maintaining the quality of service of location-based services. In this paper, we present a new context-based mix strategy that provides a higher privacy level and reduces information loss during the pseudonym-changing process. A global passive adversary model is developed to evaluate its performance and the effectiveness of the proposed mechanism is demonstrated. Finally, a uniform framework to evaluate different strategies for vehicular privacy is developed and used to compare their strengths and weaknesses in different scenarios.
- 7 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 72 (12) , 16538-16552
A Geo-Indistinguishable Context-Based Mix Strategy for Trajectory Protection in VANETs
Vehicular Ad-Hoc Networks (VANETs), the backbone of Intelligent Transportation Systems (ITS), can significantly improve traffic efficiency and road safety. However, preserving privacy during data transmission and storage is a significant issue in vehicular communications. To prevent malicious adversaries from tracking vehicles from the beacons they broadcast, pseudonym-changing or obfuscation strategies have been proposed in literature. However, it is challenging to protect the privacy of vehicles while simultaneously maintaining the quality of service of location-based services. In this paper, we present a new context-based mix strategy that provides a higher privacy level and reduces information loss during the pseudonym-changing process. A global passive adversary model is developed to evaluate its performance and the effectiveness of the proposed mechanism is demonstrated. Finally, a uniform framework to evaluate different strategies for vehicular privacy is developed and used to compare their strengths and weaknesses in different scenarios.
- 3 August 2021
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 31 (16) , 7844-7861
Connectivity‐maintained and specified‐time vehicle platoon control systems with disturbance observer
In this article, the connectivity‐maintained platoon control problem for networked vehicles with external disturbance is considered. By modeling each vehicle as a nonlinear triple integral system, a specified‐time sliding model disturbance observer and a specified‐time controller are presented to ensure the convergence of the platoon system. The predetermined performance method is applied to maintain the connectivity of vehicles in the platoon, which enables flexibility in the communication connectivity between vehicles. The specified time sliding mode disturbance observer is proposed to estimate the external disturbance within the predefined time and it is proved to be uniformly ultimate boundedness stable by using the time transformation method. A dynamic gain controller with the time constraint is proposed to achieve the stable platoon with connectivity maintained for each vehicle. The proposed approach can simultaneously guarantee the specified‐time convergence and connectivity maintenance without depending on any system parameters. The effective of the proposed controller is proved by the Lyapunov function. Finally, comparative simulation results are obtained to verify the effectiveness of the proposed protocols.
- 3 August 2021
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 31 (16) , 7844-7861
Connectivity‐maintained and specified‐time vehicle platoon control systems with disturbance observer
In this article, the connectivity‐maintained platoon control problem for networked vehicles with external disturbance is considered. By modeling each vehicle as a nonlinear triple integral system, a specified‐time sliding model disturbance observer and a specified‐time controller are presented to ensure the convergence of the platoon system. The predetermined performance method is applied to maintain the connectivity of vehicles in the platoon, which enables flexibility in the communication connectivity between vehicles. The specified time sliding mode disturbance observer is proposed to estimate the external disturbance within the predefined time and it is proved to be uniformly ultimate boundedness stable by using the time transformation method. A dynamic gain controller with the time constraint is proposed to achieve the stable platoon with connectivity maintained for each vehicle. The proposed approach can simultaneously guarantee the specified‐time convergence and connectivity maintenance without depending on any system parameters. The effective of the proposed controller is proved by the Lyapunov function. Finally, comparative simulation results are obtained to verify the effectiveness of the proposed protocols.
- 22 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (8) , 5982-5991
Cooperative Platoon Control for Uncertain Networked Aerial Vehicles With Predefined-Time Convergence
In this article, the predefined-time cooperative platoon control problem with constrained communication range for uncertain networked aerial vehicles is considered. The uncertain networked aerial vehicles are subjected to external disturbance and parameter uncertainties. A novel adaptive sliding-mode disturbance observer is first designed for single uncertain networked aerial vehicle with an radial basis function of neural network estimator to guarantee the control performance. By embedding a dynamic control gain associated with the predefined convergence time, the proposed disturbance observer is proved to be uniformly ultimate boundedness stable by the time transformation approach. Then the dynamic gain technology is combined with the prescribed performance control to design the platoon controllers for uncertain networked aerial vehicles. With the proposed disturbance observer and the distribute controller, the platoon can be achieved within the predefined time. The proposed approach can simultaneously guarantee the system stabile without any initial conditions and system parameters. Finally, some simulation experiments are given to verify the effectiveness of the proposed protocols.
- 22 February 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 9 (8) , 5982-5991
Cooperative Platoon Control for Uncertain Networked Aerial Vehicles With Predefined-Time Convergence
In this article, the predefined-time cooperative platoon control problem with constrained communication range for uncertain networked aerial vehicles is considered. The uncertain networked aerial vehicles are subjected to external disturbance and parameter uncertainties. A novel adaptive sliding-mode disturbance observer is first designed for single uncertain networked aerial vehicle with an radial basis function of neural network estimator to guarantee the control performance. By embedding a dynamic control gain associated with the predefined convergence time, the proposed disturbance observer is proved to be uniformly ultimate boundedness stable by the time transformation approach. Then the dynamic gain technology is combined with the prescribed performance control to design the platoon controllers for uncertain networked aerial vehicles. With the proposed disturbance observer and the distribute controller, the platoon can be achieved within the predefined time. The proposed approach can simultaneously guarantee the system stabile without any initial conditions and system parameters. Finally, some simulation experiments are given to verify the effectiveness of the proposed protocols.
- 24 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (1) , 393-406
GraphIPS: Calibration-Free and Map-Free Indoor Positioning Using Smartphone Crowdsourced Data
Indoor positioning plays an important role in a variety of applications under Internet of things (IoT). Conventional WiFi fingerprinting-based indoor positioning systems (IPSs) usually require extensive manual calibrations to construct radio maps. This process severely limits the system scalability and adaptiveness. Pedestrian dead reckoning (PDR) is a popular method that can avoid the calibration process. However, PDR-based IPSs typically suffer from accumulated errors. To tackle this problem, many refinement methods require map information or floorplans which may not be available or up-to-date in practice. With the development of IoT, various types of crowdsourced data become available. In this work, we propose GraphIPS, a calibration-free and map-free IPS which dynamically generates accurate radio maps by utilizing smartphone crowdsourced WiFi and inertial measurement unit (IMU) data. GraphIPS fuses the crowdsourced data into a graph-based formulation and applies the multidimensional scaling (MDS) algorithm to compute the positions of user’s steps. Experimental results show that GraphIPS achieves comparable accuracy to the calibration-based method in a significantly shorter run time than optimization-based methods. In addition to smartphones, GraphIPS is also potentially applicable for the smart wearables with embedded WiFi modules and IMUs.
- 24 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 8 (1) , 393-406
GraphIPS: Calibration-Free and Map-Free Indoor Positioning Using Smartphone Crowdsourced Data
Indoor positioning plays an important role in a variety of applications under Internet of things (IoT). Conventional WiFi fingerprinting-based indoor positioning systems (IPSs) usually require extensive manual calibrations to construct radio maps. This process severely limits the system scalability and adaptiveness. Pedestrian dead reckoning (PDR) is a popular method that can avoid the calibration process. However, PDR-based IPSs typically suffer from accumulated errors. To tackle this problem, many refinement methods require map information or floorplans which may not be available or up-to-date in practice. With the development of IoT, various types of crowdsourced data become available. In this work, we propose GraphIPS, a calibration-free and map-free IPS which dynamically generates accurate radio maps by utilizing smartphone crowdsourced WiFi and inertial measurement unit (IMU) data. GraphIPS fuses the crowdsourced data into a graph-based formulation and applies the multidimensional scaling (MDS) algorithm to compute the positions of user’s steps. Experimental results show that GraphIPS achieves comparable accuracy to the calibration-based method in a significantly shorter run time than optimization-based methods. In addition to smartphones, GraphIPS is also potentially applicable for the smart wearables with embedded WiFi modules and IMUs.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (1) , 160-175
Efficient and Scalable Calibration-Free Indoor Positioning Using Crowdsourced Data
With the development of Internet of Things (IoT), a variety of crowdsourced data becomes available. In this paper, we propose to utilize the crowdsourced WiFi received signal strength (RSS) data to perform indoor positioning. In many instances, the size of crowdsourced WiFi RSS data is potentially large, and the ground truths of the corresponding RSS fingerprints are unavailable. Therefore, it is challenging to construct the associated radio map. In the proposed method, a heuristic geometrical algorithm is developed to convert the RSS data into pairwise distances among the fingerprints. Based on these pairwise distances, multidimensional scaling (MDS) is then applied to compute the positions of all the fingerprints, thereby building a radio map. We show that the accuracy of the proposed method is only reasonably lower than a state-of-the-art calibration-based method. Further, we present a k-means clustering-based region partitioning method that partitions the large crowdsourced dataset effectively. The parallel processing on the partitioned data and computational simplicity of MDS result in significantly shorter run time for the proposed method than the previous optimization-based methods.
- 1 October 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 7 (1) , 160-175
Efficient and Scalable Calibration-Free Indoor Positioning Using Crowdsourced Data
With the development of Internet of Things (IoT), a variety of crowdsourced data becomes available. In this paper, we propose to utilize the crowdsourced WiFi received signal strength (RSS) data to perform indoor positioning. In many instances, the size of crowdsourced WiFi RSS data is potentially large, and the ground truths of the corresponding RSS fingerprints are unavailable. Therefore, it is challenging to construct the associated radio map. In the proposed method, a heuristic geometrical algorithm is developed to convert the RSS data into pairwise distances among the fingerprints. Based on these pairwise distances, multidimensional scaling (MDS) is then applied to compute the positions of all the fingerprints, thereby building a radio map. We show that the accuracy of the proposed method is only reasonably lower than a state-of-the-art calibration-based method. Further, we present a k-means clustering-based region partitioning method that partitions the large crowdsourced dataset effectively. The parallel processing on the partitioned data and computational simplicity of MDS result in significantly shorter run time for the proposed method than the previous optimization-based methods.
- Open Access
- 1 January 2016
- Published by IGI Global Scientific Publishing
- p. 1124-1148
MAC Protocol for CRSN
Cognitive Radio (CR) technology has gained popularity in Wireless Sensor Networks (WSN) because of scarcity caused by the increase in number of wireless devices and service, and it provides spectrum-efficient communication for the resource constrained WSNs. However, appropriate protocols have to be devised to satisfy the requirements of both WSNs and CRs and to enjoy the benefits of cognition in sensor networks. In this chapter, the authors review the existing schemes for wired, wireless, and cognitive radio networks. In addition, they propose a novel energy-efficient and spectrum-aware Medium Access Control (MAC) protocol for the cognitive radio sensor network. The authors design a spectrum-aware asynchronous duty cycle approach that caters to the requirements of both the domains. The performance of the proposed MAC is evaluated via simulations. Performance evaluations are also compared with MCMAC, a multi-channel MAC for WSNs. The comparative results show that the proposed scheme outperforms the multi-channel scheme for WSN.
- 1 January 2016
- Published by IGI Global Scientific Publishing
- p. 1124-1148
Open AccessMAC Protocol for CRSN
Cognitive Radio (CR) technology has gained popularity in Wireless Sensor Networks (WSN) because of scarcity caused by the increase in number of wireless devices and service, and it provides spectrum-efficient communication for the resource constrained WSNs. However, appropriate protocols have to be devised to satisfy the requirements of both WSNs and CRs and to enjoy the benefits of cognition in sensor networks. In this chapter, the authors review the existing schemes for wired, wireless, and cognitive radio networks. In addition, they propose a novel energy-efficient and spectrum-aware Medium Access Control (MAC) protocol for the cognitive radio sensor network. The authors design a spectrum-aware asynchronous duty cycle approach that caters to the requirements of both the domains. The performance of the proposed MAC is evaluated via simulations. Performance evaluations are also compared with MCMAC, a multi-channel MAC for WSNs. The comparative results show that the proposed scheme outperforms the multi-channel scheme for WSN.
- Open Access
A Stackelberg Game Model for Overlay D2D Transmission with Heterogeneous Rate Requirements
This paper studies the performance of overlay device-to-device (D2D) communication links via carrier sense multiple access (CSMA) protocols. We assume that the D2D links have heterogeneous rate requirements and different willingness to pay, and each of them acts non-altruistically to achieve its target rate while maximizing its own payoff. Spatial reuse is allowed if the links are not interfering with each other. A non-cooperative game model is used to address the resource allocation among the D2D links, at the same time leveraging on the ideal CSMA network (ICN) model to address the physical channel access issue. We propose a Stackelberg game in which the base station in the cellular network acts as a Stackelberg leader to regulate the individual payoff by modifying the unit service price so that the total D2D throughput is maximized. The problem is shown to be quasi-convex and can be solved by a sequence of equivalent convex optimization problems. The pricing strategies are designed so that the network always operates within the feasible throughput region. The results are verified by simulations.
Open AccessA Stackelberg Game Model for Overlay D2D Transmission with Heterogeneous Rate Requirements
This paper studies the performance of overlay device-to-device (D2D) communication links via carrier sense multiple access (CSMA) protocols. We assume that the D2D links have heterogeneous rate requirements and different willingness to pay, and each of them acts non-altruistically to achieve its target rate while maximizing its own payoff. Spatial reuse is allowed if the links are not interfering with each other. A non-cooperative game model is used to address the resource allocation among the D2D links, at the same time leveraging on the ideal CSMA network (ICN) model to address the physical channel access issue. We propose a Stackelberg game in which the base station in the cellular network acts as a Stackelberg leader to regulate the individual payoff by modifying the unit service price so that the total D2D throughput is maximized. The problem is shown to be quasi-convex and can be solved by a sequence of equivalent convex optimization problems. The pricing strategies are designed so that the network always operates within the feasible throughput region. The results are verified by simulations.
- Open Access
Performance Evaluation of Wearable Sensor Systems: A Case Study in Moderate-Scale Deployment in Hospital Environment
A wearable sensor system enables continuous and remote health monitoring and is widely considered as the next generation of healthcare technology. The performance, the packet error rate (PER) in particular, of a wearable sensor system may deteriorate due to a number of factors, particularly the interference from the other wearable sensor systems in the vicinity. We systematically evaluate the performance of the wearable sensor system in terms of PER in the presence of such interference in this paper. The factors that affect the performance of the wearable sensor system, such as density, traffic load, and transmission power in a realistic moderate-scale deployment case in hospital are all considered. Simulation results show that with 20% duty cycle, only 68.5% of data transmission can achieve the targeted reliability requirement (PER is less than 0.05) even in the off-peak period in hospital. We then suggest some interference mitigation schemes based on the performance evaluation results in the case study.
Open AccessPerformance Evaluation of Wearable Sensor Systems: A Case Study in Moderate-Scale Deployment in Hospital Environment
A wearable sensor system enables continuous and remote health monitoring and is widely considered as the next generation of healthcare technology. The performance, the packet error rate (PER) in particular, of a wearable sensor system may deteriorate due to a number of factors, particularly the interference from the other wearable sensor systems in the vicinity. We systematically evaluate the performance of the wearable sensor system in terms of PER in the presence of such interference in this paper. The factors that affect the performance of the wearable sensor system, such as density, traffic load, and transmission power in a realistic moderate-scale deployment case in hospital are all considered. Simulation results show that with 20% duty cycle, only 68.5% of data transmission can achieve the targeted reliability requirement (PER is less than 0.05) even in the off-peak period in hospital. We then suggest some interference mitigation schemes based on the performance evaluation results in the case study.