Hengzhi Wang

Hengzhi Wang

Auto-generated profile, based on publicly available information

Hengzhi Wang

Shenzhen University

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
23 February 2022 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HWHengzhi Wang
Hengzhi Wang
YYYongjian Yang
Yongjian Yang
EWEn Wang
En Wang
WLWenbin Liu
Wenbin Liu
yuanbo xuyuanbo xu
yuanbo xu
JWJie Wu
Jie Wu
Mobile Crowdsensing (MCS) is a promising paradigm that recruits users to cooperatively perform a sensing task. When recruiting users, existing works mainly focus on selecting a group of users with the best objective ability, e.g., the user's probability or frequency of covering the task locations. However, we argue that the task completion effect depends not only on the user's objective ability, but also on their subjective collaboration likelihood with each other. Furthermore, even though we can find a well-behaved group of users in the single-round scenario, while in the multi-round scenario without enough prior knowledge, we still face the problem of recruiting previously well-behaved user groups (exploitation) or recruiting uncertain user groups (exploration). Additionally, we consider that each user has a different cost, and the platform recruits users under a cost budget; thus, the problem becomes more challenging: users may report fake costs to gain more profits. To address these problems, assuming that the user's information is known, we first convert the single-round user recruitment problem into the min-cut problem and propose a graph theory based algorithm to find the approximate solution. Then, in the multi-round scenario where the user's information is estimated from the previous rounds, to balance the trade-off between exploration and exploitation, we propose the multi-round User Recruitment strategy under the budget constraint based on the combinatorial Multi-armed Bandit model (URMB), which is proven to achieve a tight regret bound. Next, we propose a graph-based payment strategy to achieve truthfulness and individual rationality of users. Finally, extensive experiments on three real-world datasets show that URMB always outperforms the state-of-th-art strategies.

26 May 2021 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
EWEn Wang
En Wang
HWHengzhi Wang
Hengzhi Wang
YYYongjian Yang
Yongjian Yang
WLWenbin Liu
Wenbin Liu
Mobile crowdsensing (MCS) has attained much attention for gathering distributed mobile users to complete large-scale sensing tasks. To ensure the task completion, enough users should be motivated to participate in sensing tasks. Thus, much research in MCS focuses on proposing incentive mechanism, and these works usually focus on the offline scenario, where the information of all users is available to the platform. However, we argue that the actual MCS is usually an online scenario, where the platform does not know the user's information until they establish connections with the platform. Meanwhile, mobile users connect to the platform randomly and will cut off the connection at any time. Hence, when accessed by a user, the platform needs to make an irrevocable decision instantly about whether to select the user or not, and decides a remuneration for the user without knowing future information. In this paper, we first propose a reverse-auction framework to model the interaction between the platform and mobile users. Then, we present an online truthful incentive mechanism (OTIM) to motivate users, including online winner selection and remuneration determination strategies. Finally, massive simulations are conducted based on three real traces, and the simulation results illustrate that OTIM achieves truthfulness, individual rationality, computational efficiency and an approximately full budget utilization.

24 June 2022 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
HWHengzhi Wang
Hengzhi Wang
YYYongjian Yang
Yongjian Yang
EWEn Wang
En Wang
XLXiulong Liu
Xiulong Liu
JWJingxiao Wei
Jingxiao Wei
JWJie Wu
Jie Wu
Spatial Crowdsourcing (SC) has been adopted in various applications such as Gigwalk and Uber, where a platform takes location-based tasks (e.g., picking up passengers) from a requester and selects suitable workers to perform them. In most existing works, the platform selects workers based on the requester and worker information, which suffers from serious privacy issues. Some works have considered privacy issues, but they still suffer from either of two limitations: (i) Privacy of the requester and worker cannot be protected simultaneously; (ii) Third-party trusted entities are usually required. Motivated by this, we focus on protecting the privacy of both the requester and the worker without third-party entities while selecting workers. We use randomized response, a widely recognized and prevalent privacy model achieving Local Differential Privacy (LDP), to jointly protect the privacy of workers’ locations and charges based on the location-charge correlation. For the requester, we present a novel mechanism called randomized matrix multiplication to hide the real task locations. More importantly, we prove that the worker selection based on the protected information is non-submodular and NP-hard, which cannot be addressed in polynomial time. To this end, we present an approximate algorithm to solve the problem efficiently, of which the effectiveness is measured by the approximation ratio, i.e., the ratio of the optimal solution to the approximate solution. Finally, simulations based on real-world datasets illustrate that our worker selection outperforms the state-of-the-art method on both privacy protection and worker selection.

24 June 2021 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
WLWenbin Liu
Wenbin Liu
YYYongjian Yang
Yongjian Yang
EWEn Wang
En Wang
HWHengzhi Wang
Hengzhi Wang
ZWZihe Wang
Zihe Wang
JWJie Wu
Jie Wu
Mobile CrowdSensing (MCS) has recently become a powerful paradigm that recruits users to cooperatively perform various tasks. In many realistic settings, users participate in real time and we have to recruit them in an online manner. The existing works usually formulate the online recruitment problem as a budgeted optimal stopping problem with submodular user utility, while we first argue that not only the budget but also the time constraints can jointly influence the recruitment performance. For example, if we have less budget but plenty of time, we should recruit users with more patience. Second, considering the user’s cooperative willingness, its contribution may be diminishing or even irregular. Hence, we also need to address not only submodular cases but also their non-submodular utility. In this paper, we study the online user recruitment problem with (non-)submodular utility under the budget and time constraints. To deal with the two constraints, we first estimate the number of users to be recruited and then recruit them in segments. Moreover, we extend the segmented strategy with a non-submodular utility, which has the submodularity ratio $\gamma $ and the competitive ratio $\gamma ^{2}(1-e^{-1})/7$ . Furthermore, to correct estimation errors and utilize newly obtained information, we dynamically re-adjust the segmented strategy and also prove that the dynamic strategy achieves a competitive ratio of ${\gamma ^{2}(1-e^{-1})(1-e^{-\gamma /2})/7}$ . Finally, a reverse auction-based online pricing mechanism is lightly built into the proposed user recruitment strategy, which achieves truthfulness and individual rationality. Extensive experiments on three real-world data sets validate the proposed online user recruitment strategy under the (non-) submodular utility and two constraints.

21 October 2022 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
EWEn Wang
En Wang
JCJiatong Cai
Jiatong Cai
YYYongjian Yang
Yongjian Yang
WLWenbin Liu
Wenbin Liu
HWHengzhi Wang
Hengzhi Wang
JWJie Wu
Jie Wu
With the development of communications, networking, and information technology, Crowdsensed Data Trading (CDT) becomes a novel data trading paradigm. In CDT, the data requesters publish crowdsensing tasks with specific data requirements, and then workers complete these tasks, upload the data and obtain corresponding rewards. To efficiently deal with data trading, most of the existing CDT systems assume a trusted centralized platform. However, we argue that the platform may collude with workers or requesters to trick others for achieving more benefits. For example, according to the workers’ uploaded data, the platform can modify the reward functions by colluding with the requester. Similarly, the platform might collude with workers to let them know the reward function, then workers could forge data. Meanwhile, requesters and workers may also be malicious. For example, requesters may post tasks but fail to pay and workers can upload wrong data to mislead the system. To solve the above problems, we combine the Crowdsensed Data Trading system with intelligent Blockchain (CDT-B), which contains a smart contract called CDToken. As a credible third-party, the CDToken is used to record the requesters’ reward function and workers’ data uploading function to avoid targeted trick. At the same time, we not only design a Data Uploading and Preprocessing (DUP) mechanism in CDToken to collect and process the workers’ sensed data, but also propose a Grouping Truth Discovery (GTD) to evaluate their data quality for determining the payments. Moreover, to hold a large number of requesters and workers in CDT-B, we propose a Layered Sharding blockchain based on Membership Degree (LSMD) to solve the blockchain inefficiency problem. Finally, we deploy CDToken to an experimental environment based on Ethereum and demonstrate its efficient performance and practicability.

4 June 2025 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
LCLong Chen
Long Chen
YCYi Ching Chou
Yi Ching Chou
HZHaoyuan Zhao
Haoyuan Zhao
HWHengzhi Wang
Hengzhi Wang
FWFeng Wang
Feng Wang
JLJiangchuan Liu
Jiangchuan Liu
Inter-Satellite Links (ISLs) are pivotal for delivering global connectivity services and optimizing resource utilization in 6 G and beyond. However, delivering effective topology control services through ISL provisioning faces critical challenges in sustainability and reliability. Reducing ISLs can conserve energy and extend satellite battery life for Low-Earth-Orbit (LEO) satellites where replacing batteries is impractical. Conversely, increasing ISLs can enhance service reliability but may lead to uneven traffic distribution, overloading nodes, and accelerating battery degradation, ultimately degrading the quality of 6 G services. To tackle this dilemma, we propose TASRI—a service-oriented framework for Traffic-Aware, Sustainable, and Reliable ISL provisioning. TASRI provides a dynamic topology control service by partitioning network topologies into logical zones, enabling flexible ISL activation and deactivation to adapt to varying service demands, ensuring efficient resource utilization and dynamic service orchestration. Using a sustainability-oriented weight model, we formulate the topology control service optimization problem and introduce a scalable on-demand topology evolving algorithm with a bounded approximation ratio. Extensive real-world deployment-based simulation results show that, compared to the state-of-the-art, our TASRI can substantially reduce battery life consumption, while achieving comparable reliability and excellent scalability with considerably fewer ISLs or ISL handovers.