IEEE Spectrum
On k-connectivity for a geometric random graph
Random Structures & Algorithms
The Mathematics of Infectious Diseases
SIAM Review
On the minimum node degree and connectivity of a wireless multihop network
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
How to Own the Internet in Your Spare Time
Proceedings of the 11th USENIX Security Symposium
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Measuring and Modeling Computer Virus Prevalence
SP '93 Proceedings of the 1993 IEEE Symposium on Security and Privacy
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Sharp thresholds For monotone properties in random geometric graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The dynamic behavior of a data dissemination protocol for network programming at scale
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
MNP: multihop network reprogramming service for sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
On the Distribution and Revocation of Cryptographic Keys in Sensor Networks
IEEE Transactions on Dependable and Secure Computing
Modeling Node Compromise Spread in Wireless Sensor Networks Using Epidemic Theory
WOWMOM '06 Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks
A key pre-distribution scheme using deployment knowledge for wireless sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Diversify sensor nodes to improve resilience against node compromise
Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
IEEE Communications Magazine
Enhancing the attacking efficiency of the node capture attack in WSN: a matrix approach
The Journal of Supercomputing
Mobile Networks and Applications
| Hi-index | 0.00 |
Motivated by recently surfacing viruses that can spread over the air interfaces, in this article, we investigate the potentially disastrous threat of node compromise spreading in wireless sensor networks. We assume such a compromise originating from a single infected node, can propagate to other sensor nodes via communication and pre-established mutual trust. We focus on the possible epidemic breakout of such propagations where the whole network may fall victim to the attack. Using epidemic theory, we model and analyze this spreading process and identify key factors determining potential outbreaks. In particular, we perform our study on random graphs precisely constructed according to the parameters of the network, such as distance, key sharing constrained communication and node recovery, thereby reflecting the true characteristics therein. Moreover, a comparative study of the epidemic propagation is performed based on the effects of two types of sensor deployment strategies, viz., uniform random and group-based deployment. The analytical results provide deep insights in designing potential defense strategies against this threat. Furthermore, through extensive simulations, we validate the model and perform investigations on the system dynamics. Our analysis and simulation results indicate that the uniform random deployment is more vulnerable to an epidemic outbreak than the group based deployment strategy.