Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Framework for Identifying Compromised Nodes in Wireless Sensor Networks
ACM Transactions on Information and System Security (TISSEC)
On supporting distributed collaboration in sensor networks
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume II
| Hi-index | 0.00 |
Wireless Sensor Networks are networks composed of hundreds or thousands of small sensors which are often placed in hostile environments to sense a particular event in that environment. Unfortunately sensors are characterized by low power, limited memory and low bandwidth. The network is vulnerable to attacks, some of which can compromise a node, which can render the network useless if not detected. Current algorithms which detect compromised nodes do so at a high computational cost. This paper introduces a centralized approach to identifying compromised nodes at a low computational cost. Simulations are conducted to verify the algorithm.