XinGong Chang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
XinGong Chang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
Fei Zhang
Shanxi University of Finance and Economics
1 shared publication- JiWei Luo
Shanxi University of Finance & Economics, No. 696, Wucheng Road, Taiyuan, Shanxi, China
1 shared publication - Panpan Li
College of Information Science and Engineering, Jiaxing University, Jiaxing 314041, China
1 shared publication - Yu Wang
Shanxi University of Finance & Economics, No. 696, Wucheng Road, Taiyuan, Shanxi, China
1 shared publication - Zhigang Zhou
School of Information, Shanxi University of Finance and Economics, Taiyuan, China
1 shared publication
Latest Publications
- Open Access
- 30 May 2021
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-17
Node Location Privacy Protection in Unattended Wireless Sensor Networks
Node location protection is critical to the wireless sensor networks (WSN), especially for unattended environment. However, due to most of the static deployment and the limitations in energy, storage, and communication capabilities of the sensors, WSNs are vulnerable to various location (and derivative) attacks. In this work, we study the node location privacy protection issue from both aspects of attacks and defenses. First, we present a new two-phase location attack for two important types of nodes (including base station and source node). It can locate a base station node within few amounts of local wireless transmission monitoring and then reversely trace the location of the source node. Different from existing methods, the proposed attack determines the node location based on the transmission direction, which can break through existing defenses. Then, to defend against such attacks, we design a pseudospiral-based routing protocol for WSN. We analyze the performance of parameters such as routing probability, maximum detectable angle, hop count, and number of loops based on PU SBRF, MoRF, and PLAUDIT methods. The theory analysis and confrontation experiment of attack and defense show that the proposed scheme can protect the location privacy of the target node with moderate communication and computation overhead.
- 30 May 2021
- Published by Hindawi Limited in Mathematical Problems in Engineering
- Vol. 2021, 1-17
Open AccessNode Location Privacy Protection in Unattended Wireless Sensor Networks
Node location protection is critical to the wireless sensor networks (WSN), especially for unattended environment. However, due to most of the static deployment and the limitations in energy, storage, and communication capabilities of the sensors, WSNs are vulnerable to various location (and derivative) attacks. In this work, we study the node location privacy protection issue from both aspects of attacks and defenses. First, we present a new two-phase location attack for two important types of nodes (including base station and source node). It can locate a base station node within few amounts of local wireless transmission monitoring and then reversely trace the location of the source node. Different from existing methods, the proposed attack determines the node location based on the transmission direction, which can break through existing defenses. Then, to defend against such attacks, we design a pseudospiral-based routing protocol for WSN. We analyze the performance of parameters such as routing probability, maximum detectable angle, hop count, and number of loops based on PU SBRF, MoRF, and PLAUDIT methods. The theory analysis and confrontation experiment of attack and defense show that the proposed scheme can protect the location privacy of the target node with moderate communication and computation overhead.
- 22 September 2020
- Published by Springer Nature
- p. 415-427
An Evolutionary Algorithm Based on Compressed Representation for Computing Weak Structural Balance in Large-Scale Signed Networks
- 22 September 2020
- Published by Springer Nature
- p. 415-427
An Evolutionary Algorithm Based on Compressed Representation for Computing Weak Structural Balance in Large-Scale Signed Networks