MSWiM '02 Proceedings of the 5th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Achieving availability and survivability in wireless sensor networks by software rejuvenation
Proceedings of the 4th international workshop on Security, privacy and trust in pervasive and ubiquitous computing
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stochastic games for security in networks with interdependent nodes
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the Survivability of Wireless Ad Hoc Networks with Node Misbehaviors and Failures
IEEE Transactions on Dependable and Secure Computing
Exploiting mobility diversity in sharing wireless access: a game theoretic approach
IEEE Transactions on Wireless Communications
Network Security: A Decision and Game-Theoretic Approach
Network Security: A Decision and Game-Theoretic Approach
Signaling game based strategy of intrusion detection in wireless sensor networks
Computers & Mathematics with Applications
IEEE Communications Surveys & Tutorials
An Anti-Jamming Stochastic Game for Cognitive Radio Networks
IEEE Journal on Selected Areas in Communications
Node clustering in wireless sensor networks: recent developments and deployment challenges
IEEE Network: The Magazine of Global Internetworking
Scale-free topology evolution for wireless sensor networks
Computers and Electrical Engineering
Hi-index | 0.00 |
Because a large number of Wireless Sensor Networks (WSNs) are deployed in unsafe surroundings, the survivability evaluation towards attacked WSNs has become a critical issue. Due to its popularity, the cluster-based structure of WSNs in this paper is selected to be studied and regarded as a serial-parallel system according to its characteristics. In order to set up the relation between the intention of attack behaviors and the randomness of continuous-time Markov chain (CTMC), we construct an attack-prediction stochastic game that is able to attain the attack probabilities adopted by the attacker in different states. Therefore, the consequence from a successful attack can be modeled as a deliberate state change of the CTMC. Upon this, the state transition matrix describing various states during the lifetime of an attacked sensor node can be formed. We are then able to compute the MTTF (Mean Time To Failure) of an attacked sensor node in perspective of CTMC. Based on the classical reliability theory, we thus propose a mechanism of survivability evaluation for attacked WSNs, which is composed of the reliability, survival lifetime, and availability in the steady state. Our experiments show the influence degree of the game parameters to the expected motivation of the attacker as well as disclose the relation between the MTTF of an attacked sensor node and the expected motivation of the attacker. In addition, the effectiveness of our survivability evaluation metrics is validated. These results will be able to build up the theoretical foundation to guide the design of highly survival WSNs.