scispace - formally typeset
Search or ask a question

Showing papers by "Xiaodong Lin published in 2006"


Proceedings ArticleDOI
Xiaodong Lin1, Haojin Zhu1, Bin Lin1, Pin-Han Ho1, Xuemin Shen1 
01 Nov 2006
TL;DR: This paper proposes an energy efficient malicious node removal mechanism, and a new attack on routing service called entrap attack is introduced, where an innocent node is incriminated as a malicious node.
Abstract: Due to the nature of wireless ad hoc networks such as dynamic infrastructure and non-centralized management, the routing process has a huge exposure to malicious hacking and intrusions. This fact results in a likelihood of node compromise, leading to a disruption of the legitimate network functions/services. Most reported studies in coping with the problem have focused on the effort of protection on route discovery and data transmission against various attacks. In this paper, we solve the problem from a different perspective by targeting the node compromise revocation, i.e., isolating and breaking off the misbehaving nodes. To mitigate the security breaches from internal compromised nodes and eventually eliminate compromised nodes from the wireless ad hoc networks, we propose an energy efficient malicious node removal mechanism. Further, a new attack on routing service called entrap attack is introduced, where an innocent node is incriminated as a malicious node.

10 citations


Journal Article
TL;DR: In this paper, the authors presented a two-sided model, Janus, to characterize and analyze the behavior of attacker and defender in multi-stage coordinated attack (MSCA) scenarios, where an ANTS algorithm was developed from the perspective of attacker to approximately search attack schemes with the minimum cost and another backward searching algorithm APD-BS was designed from the defender's standpoint to seek the pivots of attack schemes in order to effectively countermine them by removing those key observations associated with the system state estimates.
Abstract: The multi-stage coordinated attack (MSCA) bring many challenges to the security analysts due to their special temporal an spacial characteristics. This paper presents a two-sided model, Janus, to characterize and analyze the the behavior of attacker and defender in MSCA. Their behavior is firstly formulated as Multi-agent Partially Observable Markov Decision Process (MPO-MDP), an ANTS algorithm is then developed from the perspective of attacker to approximately search attack schemes with the minimum cost, and another backward searching algorithm APD-BS is designed from the defender's standpoint to seek the pivots of attack schemes in order to effectively countermine them by removing those key observations associated with the system state estimates. Two case studies are conducted to show the application of our models and algorithms to practical scenarios, some preliminary analysis are also given to validate their performance and advantages.

6 citations


Book ChapterDOI
30 Nov 2006
TL;DR: A two-sided model is presented, Janus, to characterize and analyze the the behavior of attacker and defender in MSCA, and an ANTS algorithm is developed from the perspective of attacker to approximately search attack schemes with the minimum cost.
Abstract: The multi-stage coordinated attack (MSCA) bring many challenges to the security analysts due to their special temporal an spacial characteristics. This paper presents a two-sided model, Janus, to characterize and analyze the the behavior of attacker and defender in MSCA. Their behavior is firstly formulated as Multi-agent Partially Observable Markov Decision Process (MPO-MDP), an ANTS algorithm is then developed from the perspective of attacker to approximately search attack schemes with the minimum cost, and another backward searching algorithm APD-BS is designed from the defender's standpoint to seek the pivots of attack schemes in order to effectively countermine them by removing those key observations associated with the system state estimates. Two case studies are conducted to show the application of our models and algorithms to practical scenarios, some preliminary analysis are also given to validate their performance and advantages.

5 citations