Yaping Zhu

Yaping Zhu

Auto-generated profile, based on publicly available information

Yaping Zhu

School of Computer Science and Technology, Tongji University, Shanghai, China

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
8 February 2017 in IEEE Communications Letters
Verified
Journal Article
Closed access
YZYueyue Zhang
Yueyue Zhang
SXSong Xing
Song Xing
YZYaping Zhu
Yaping Zhu
FYFeng Yan
Feng Yan
LSLianfeng Shen
Lianfeng Shen
Energy-based source localization methods are normally developed according to the channel path-loss models in which the noise is generally assumed to follow Gaussian distributions. In this letter, we represent the practical additive noise by the Gaussian mixture model, and develop a localization algorithm based on the received signal strength to achieve a maximum likelihood location estimator. By using Jensen's inequality and semidefinite relaxation, the initially proposed nonlinear and nonconvex estimator is relaxed into a convex optimization problem, which can be efficiently solved to obtain the globally optimal solution. Besides, the corresponding Cramer-Rao lower bound is derived for performance comparison. Simulation and experimental results show a substantial performance gain achieved by our proposed localization algorithm in wireless sensor networks.

9 September 2019 in IEEE Communications Letters
Verified
Journal Article
Closed access
YZYaping Zhu
Yaping Zhu
WXWeiwei Xia
Weiwei Xia
FYFeng Yan
Feng Yan
SXSong Xing
Song Xing
LSLianfeng Shen
Lianfeng Shen
In order to identify non-line-of-sight (NLOS) propagations for a high-resolution localization system in wireless networks, a strong NLOS classifier is proposed via a machine learning meta algorithm named AdaBoost. Signal features are extracted to characterize the distinctions between line-of-sight (LOS) and NLOS, based on which a series of weak learners are primarily given. By training and re-sampling data iteratively, weak learners with the minimal classification error are selected and the weighted sum is boosted into a strong classifier. Simulations demonstrate that the proposed AdaBoost-based NLOS classifier can improve NLOS identification performance, leading to reduced positioning errors.

24 January 2017 in IEEE Communications Letters
Verified
Journal Article
Closed access
YZYaping Zhu
Yaping Zhu
FYFeng Yan
Feng Yan
YZYueyue Zhang
Yueyue Zhang
RZRui Zhang
Rui Zhang
LSLianfeng Shen
Lianfeng Shen
In this letter, the anchor scheduling scheme for localization in heterogeneous wireless sensor networks is studied. In order to minimize the number of actively participating anchors to prolong the network lifetime, we propose a centralized anchor scheduling scheme on the basis of the software-defined networking (SDN) paradigm. First, an expression evaluating the connectivity degree of an agent is derived and used to judge if this agent has desired number of connected anchors for its localization. Then, the state of each anchor is determined by the SDN controller through a flow table via sensor OpenFlow. Simulations show that the proposed anchor scheduling scheme reduces the number of active anchors and prolongs the network lifetime. It can also be shown that this scheme ensures the desired number of anchors for the localization, and can tradeoff the localization accuracy for energy by ensuring a better balance of energy consumption among minimum number of active anchors.

1 December 2020 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
YZYaping Zhu
Yaping Zhu
FYFeng Yan
Feng Yan
Shengjie ZhaoShengjie Zhao
Shengjie Zhao
FSFei Shen
Fei Shen
SXSong Xing
Song Xing
LSLianfeng Shen
Lianfeng Shen
Cooperative localization has emerged as an appealing technology since it can improve the localization performance without any infrastructure change compared with non-cooperative localization. However, some well-localized agents may not be willing to sacrifice additional power to improve the others' localization accuracy. This paper proposes an incentive mechanism from an economic perspective for cooperative localization, whereby a pricing scheme is designed to lead each agent to the optimal state. A game-theoretic algorithm is proposed where each player (agent) can obtain the optimal budget strategy to minimize its individual utility. To make profits in the game, the relationship between the agent's network condition and its budget strategy is derived. Furthermore, a fairness-aware price allocation rule (PAR) is developed to distribute the budget among the reference agents proportional to each node's contribution. Analytical and numerical results show that agents with better network conditions are more likely to join the cooperation under the proposed incentive mechanism, leading to an improved localization performance.

2 October 2023 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YZYaping Zhu
Yaping Zhu
YQYing Qiu
Ying Qiu
JWJunyuan Wang
Junyuan Wang
JHJinming Hu
Jinming Hu
FYFeng Yan
Feng Yan
Shengjie ZhaoShengjie Zhao
Shengjie Zhao
High-precision location has become indispensable information in the era of Internet of Everything. However, the emergence of various location-based services leaves people exposed to the risk of location leakage at any time, which may cause potential safety hazards. This paper is concerned with the issue of position privacy preserving in the range-based crowdsourcing localization system, where the location information of all involved members is protected from being disclosed by others, including the service provider. In order to maintain the mutual confidentiality of positions when exchanging information with each other, a method of secret sharing is used to hide the location-related input of each anchor by constructing it into a polynomial. Combined with a homomorphic encryption scheme, the estimated location of user can be kept secrecy to the service provider. The feasibility of the proposed protocol for the defined privacy protecting goals is proved. Numerical results demonstrate that our algorithm is superior in localization accuracy to the noise-adding based protocols, and has moderate computation and communication costs in contrast with the encryption-based strategies.

12 April 2022 in IEEE Wireless Communications Letters
Verified
Journal Article
Closed access
YZYaping Zhu
Yaping Zhu
JHJinming Hu
Jinming Hu
The anchors in wireless network localization system suffer from the risk of location leakage, which may result in some catastrophic dangers. To preserve the location privacy of anchors, this letter proposes to hide the anchor’s position in range-based localization through a secret sharing method. By decomposing the private input of anchors into several secret shares and concealing it in the constant term of the secret polynomial, the location information of anchors cannot be disclosed by any other node in the network including the server, during the entire localization process. The performance of the proposed scheme in privacy preservation, positioning accuracy and efficiency improvement (i.e., low communication and computation costs) are evaluated through simulations.