Zhihua Zhang
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
Zhihua Zhang has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
Shoushan Luo
Beijing University of Posts and Telecommunications, Beijing, China
3 shared publicationsYang Xin
Beijing University of Posts and Telecommunications, Beijing, China
3 shared publicationsHongliang Zhu
Beijing University of Posts and Telecommunications, Beijing, China
2 shared publications- Jun Zheng
School of Mathematics, Southwest Jiaotong University, Chengdu 611756, China
2 shared publications - Binhua Feng
Department of Mathematics, Northwest Normal University, Lanzhou, China
1 shared publication - Hongliang Zhu
School of Cyberspace Security, Beijing University of Posts and Telecommunications, Beijing, China
1 shared publication
Latest Publications
- Open Access
- 27 November 2018
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 14 (11)
Detection of selective forwarding attacks based on adaptive learning automata and communication quality in wireless sensor networks
Wireless sensor networks face threats of selective forwarding attacks which are simple to implement but difficult to detect. It is difficult to distinguish between malicious packet dropping and the normal packet loss on unstable wireless channels. For this situation, a selective forwarding attack detection method is proposed based on adaptive learning automata and communication quality; the method can eliminate the impact of normal packet loss on selective forwarding attack detection and can detect ordinary selective forwarding attack and special cases of selective forwarding attack. The current and comprehensive communication quality of nodes are employed to reflect the short- and long-term forwarding behaviors of nodes, and the normal packet loss caused by unstable channels and medium-access-control layer collisions is considered. The adaptive reward and penalty parameters of a detection learning automata are determined by the comprehensive communication quality of the node and the voting of its neighbors to reward normal nodes or punish malicious ones. Simulation results indicate the effectiveness of the proposed method in detecting ordinary selective forwarding attacks, black-hole attacks, on-off attacks, and energy exhaustion attacks. In addition, the communication overhead of the method is lower than that of other methods.
- 27 November 2018
- Published by SAGE Publications in International Journal of Distributed Sensor Networks
- Vol. 14 (11)
Open AccessDetection of selective forwarding attacks based on adaptive learning automata and communication quality in wireless sensor networks
Wireless sensor networks face threats of selective forwarding attacks which are simple to implement but difficult to detect. It is difficult to distinguish between malicious packet dropping and the normal packet loss on unstable wireless channels. For this situation, a selective forwarding attack detection method is proposed based on adaptive learning automata and communication quality; the method can eliminate the impact of normal packet loss on selective forwarding attack detection and can detect ordinary selective forwarding attack and special cases of selective forwarding attack. The current and comprehensive communication quality of nodes are employed to reflect the short- and long-term forwarding behaviors of nodes, and the normal packet loss caused by unstable channels and medium-access-control layer collisions is considered. The adaptive reward and penalty parameters of a detection learning automata are determined by the comprehensive communication quality of the node and the voting of its neighbors to reward normal nodes or punish malicious ones. Simulation results indicate the effectiveness of the proposed method in detecting ordinary selective forwarding attacks, black-hole attacks, on-off attacks, and energy exhaustion attacks. In addition, the communication overhead of the method is lower than that of other methods.
- Open Access
- 1 January 2018
- Published by Wiley in Journal of Sensors
- Vol. 2018, 1-16
A Clone Detection Algorithm with Low Resource Expenditure for Wireless Sensor Networks
Wireless sensor networks (WSNs) are facing the threats of clone attacks which can launch a variety of other attacks to control or damage the networks. In this paper, a novel distributed clone detection protocol with low resource expenditure is proposed for randomly deployed networks. The method consisting of witness chain establishment and clone detection route generation is implemented in the nonhotspot area of the network organized in a ring structure, which balances the resource consumption in the whole network. The witness chains and detection routes are in the centrifugal direction and circumferential direction, respectively, which can ensure the encounter of witnesses and detection routes of nodes with the same ID but different positions to detect clone attacks. Theoretical analysis demonstrates that the detection probability can be up to 1 with reliable witnesses. Moreover, both theoretical analysis and simulation results manifest that the proposed method can achieve better network lifetime and storage requirements with low resource expenditure and outperforms most methods in the literature.
- 1 January 2018
- Published by Wiley in Journal of Sensors
- Vol. 2018, 1-16
Open AccessA Clone Detection Algorithm with Low Resource Expenditure for Wireless Sensor Networks
Wireless sensor networks (WSNs) are facing the threats of clone attacks which can launch a variety of other attacks to control or damage the networks. In this paper, a novel distributed clone detection protocol with low resource expenditure is proposed for randomly deployed networks. The method consisting of witness chain establishment and clone detection route generation is implemented in the nonhotspot area of the network organized in a ring structure, which balances the resource consumption in the whole network. The witness chains and detection routes are in the centrifugal direction and circumferential direction, respectively, which can ensure the encounter of witnesses and detection routes of nodes with the same ID but different positions to detect clone attacks. Theoretical analysis demonstrates that the detection probability can be up to 1 with reliable witnesses. Moreover, both theoretical analysis and simulation results manifest that the proposed method can achieve better network lifetime and storage requirements with low resource expenditure and outperforms most methods in the literature.
- Open Access
- 20 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 5, 12088-12102
Intrusion Detection Based on State Context and Hierarchical Trust in Wireless Sensor Networks
Security problems have become obstacles in the practical application of wireless sensor networks (WSNs), and intrusion detection is the second line of defense. In this paper, an intrusion detection based on dynamic state context and hierarchical trust in WSNs is proposed, which is flexible and suitable for constantly changing WSNs characterized by changes in the perceptual environment, transitions of states of nodes, and variations in trust value. A multidimensional two-tier hierarchical trust mechanism in the level of sensor nodes (SNs) and cluster heads (CHs) considering interactive trust, honesty trust, and content trust is put forward, which combines direct evaluation and feedback-based evaluation in the fixed hop range. This means that the trust of SNs is evaluated by CHs, and the trust of CHs is evaluated by neighbor CHs and BS; in this way, the complexity of evaluation is reduced without evaluations by all other CHs in networks. Meanwhile, the intrusion detection mechanism based on a self-adaptive dynamic trust threshold is described, which improves the flexibility and applicability and is suitable for cluster-based WSNs. The experiment simulation and evaluation indicate that the mechanism we proposed outperforms the existing typical system in malicious detection and resource overhead.
- 20 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 5, 12088-12102
Open AccessIntrusion Detection Based on State Context and Hierarchical Trust in Wireless Sensor Networks
Security problems have become obstacles in the practical application of wireless sensor networks (WSNs), and intrusion detection is the second line of defense. In this paper, an intrusion detection based on dynamic state context and hierarchical trust in WSNs is proposed, which is flexible and suitable for constantly changing WSNs characterized by changes in the perceptual environment, transitions of states of nodes, and variations in trust value. A multidimensional two-tier hierarchical trust mechanism in the level of sensor nodes (SNs) and cluster heads (CHs) considering interactive trust, honesty trust, and content trust is put forward, which combines direct evaluation and feedback-based evaluation in the fixed hop range. This means that the trust of SNs is evaluated by CHs, and the trust of CHs is evaluated by neighbor CHs and BS; in this way, the complexity of evaluation is reduced without evaluations by all other CHs in networks. Meanwhile, the intrusion detection mechanism based on a self-adaptive dynamic trust threshold is described, which improves the flexibility and applicability and is suitable for cluster-based WSNs. The experiment simulation and evaluation indicate that the mechanism we proposed outperforms the existing typical system in malicious detection and resource overhead.
- Open Access
The obstacle problem for nonlinear degenerate equations with $L^{1}$-data
The aim of this paper is to study the obstacle problem with an elliptic operator having degenerate coercivity. We prove the existence of an entropy solution to the obstacle problem under the assumption of $L^{1}-$summability on the data. Meanwhile, we prove that every entropy solution belongs to some Sobolev space $W^{1,q}(\Omega)$.Open AccessThe obstacle problem for nonlinear degenerate equations with $L^{1}$-data
The aim of this paper is to study the obstacle problem with an elliptic operator having degenerate coercivity. We prove the existence of an entropy solution to the obstacle problem under the assumption of $L^{1}-$summability on the data. Meanwhile, we prove that every entropy solution belongs to some Sobolev space $W^{1,q}(\Omega)$. - Open Access
- 17 July 2015
- Published by MDPI AG in Information
- Vol. 6 (3) , 375-387
Controlled Remote State Preparation via General Pure Three-Qubit State
The protocols for controlled remote state preparation of a single qubit and a general two-qubit state are presented in this paper. The general pure three-qubit states are chosen as shared quantum channel, which are not Local operations and classical communication (LOCC) equivalent to the mostly used GHz state. This is the first time that general pure three-qubit states have been introduced to complete remote state preparation. The probability of successful preparation is presented. Moreover, in some special cases, the successful probability could reach a unit value.
- 17 July 2015
- Published by MDPI AG in Information
- Vol. 6 (3) , 375-387
Open AccessControlled Remote State Preparation via General Pure Three-Qubit State
The protocols for controlled remote state preparation of a single qubit and a general two-qubit state are presented in this paper. The general pure three-qubit states are chosen as shared quantum channel, which are not Local operations and classical communication (LOCC) equivalent to the mostly used GHz state. This is the first time that general pure three-qubit states have been introduced to complete remote state preparation. The probability of successful preparation is presented. Moreover, in some special cases, the successful probability could reach a unit value.
- 17 July 2014
- Published by Springer Nature in Quantum Information Processing
- Vol. 13 (9) , 1979-2005
Joint remote state preparation between multi-sender and multi-receiver
- 17 July 2014
- Published by Springer Nature in Quantum Information Processing
- Vol. 13 (9) , 1979-2005
Joint remote state preparation between multi-sender and multi-receiver
- Open Access
Some operator convex functions of several variables
We obtain operator concavity (convexity) of some functions of two or three variables by using perspectives of regular operator mappings of one or several variables. As an application, we obtain, for $ 0<p < 1,$ concavity, respectively convexity, of the Frech\'{e}t differential mapping associated with the functions $t \to t^{1+p} $ and $t \to t^{1-p}.$Open AccessSome operator convex functions of several variables
We obtain operator concavity (convexity) of some functions of two or three variables by using perspectives of regular operator mappings of one or several variables. As an application, we obtain, for $ 0<p < 1,$ concavity, respectively convexity, of the Frech\'{e}t differential mapping associated with the functions $t \to t^{1+p} $ and $t \to t^{1-p}.$