EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Mitigating routing misbehavior in mobile ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Efficient tracing of failed nodes in sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Denial of Service in Sensor Networks
Computer
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
IEEE Transactions on Computers
SeRLoc: secure range-independent localization for wireless sensor networks
Proceedings of the 3rd ACM workshop on Wireless security
Sensor node compromise detection: the location perspective
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
On supporting distributed collaboration in sensor networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
Designing secure sensor networks
IEEE Wireless Communications
IEEE Communications Magazine
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Defending against attack is the key successful factor for sensor network security. There are many approaches that can be used to detect and defend against attacks, yet few are focused on modeling attack distribution. Knowing the distribution models of attacks can help system estimate the attack probability and thus defend against them effectively and efficiently. In this paper, we use probability theory to develop a basic uniform model, a basic gradient model, an intelligent uniform model and an intelligent gradient model of attack distribution in order to adapt to different application environments. These models allow systems to estimate the attack probability of each node under a given position and time. Applying these models in system security designs can improve system security performance and decrease the overheads in nearly every security area. Based on these models, we describe a novel probability secure routing algorithm that is effective to defend against attacks whether they are detected or not. Besides this application, we also introduce some other applications, such as secure routing that can save systems available energy and resources while still providing enough security, detecting attack, and key management.