Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network <s> IV. SURVEY OF VARIOUS DETECTION AND KEY PREDISTRIBUTION SCHEMES USED FOR RESILIENCE AGAINST NODE CAPTURE ATTACK <s> The low-cost, off-the-shelf hardware components in unshielded sensor-network nodes leave them vulnerable to compromise. With little effort, an adversary may capture nodes, analyze and replicate them, and surreptitiously insert these replicas at strategic locations within the network. Such attacks may have severe consequences; they may allow the adversary to corrupt network data or even disconnect significant parts of the network. Previous node replication detection schemes depend primarily on centralized mechanisms with single points of failure, or on neighborhood voting protocols that fail to detect distributed replications. To address these fundamental limitations, we propose two new algorithms based on emergent properties (Gligor (2004)), i.e., properties that arise only through the collective action of multiple nodes. Randomized multicast distributes node location information to randomly-selected witnesses, exploiting the birthday paradox to detect replicated nodes, while line-selected multicast uses the topology of the network to detect replication. Both algorithms provide globally-aware, distributed node-replica detection, and line-selected multicast displays particularly strong performance characteristics. We show that emergent algorithms represent a promising new approach to sensor network security; moreover, our results naturally extend to other classes of networks in which nodes can be captured, replicated and re-inserted by an adversary. <s> BIB001 </s> Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network <s> IV. SURVEY OF VARIOUS DETECTION AND KEY PREDISTRIBUTION SCHEMES USED FOR RESILIENCE AGAINST NODE CAPTURE ATTACK <s> Wireless sensor networks are vulnerable to node capture attacks because sensor nodes are usually deployed in unattended manner. Once attacker captures sensor nodes, he can compromise them and launch various types of attacks with those compromised nodes. Therefore, node capture attacks are hazardous and should be detected as soon as possible to reduce the harm incurred by them. To meet this need, we propose a node capture detection scheme in wireless sensor networks. Our scheme detects the captured sensor nodes by using the sequential analysis. We analytically show that our scheme detects node capture attacks in robust and efficient manner. <s> BIB002 </s> Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network <s> IV. SURVEY OF VARIOUS DETECTION AND KEY PREDISTRIBUTION SCHEMES USED FOR RESILIENCE AGAINST NODE CAPTURE ATTACK <s> In this paper we address the problem of physical node capture attacks in wireless sensor networks and provide a control theoretic framework to model physical node capture, cloned node detection and revocation of compromised nodes. By combining probabilistic analysis of logical key graphs and linear control theory, we derive a dynamical model that efficiently describes network behavior under attack. Using LQR and LQG optimal control theory tools, we develop a network response strategy, which guarantees secure network connectivity and stability under attack. Detailed simulations are presented to validate the methodology. <s> BIB003 </s> Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network <s> IV. SURVEY OF VARIOUS DETECTION AND KEY PREDISTRIBUTION SCHEMES USED FOR RESILIENCE AGAINST NODE CAPTURE ATTACK <s> Wireless Sensor Networks (WSN) usually consists of a large number of tiny sensors with limited computation capability, memory space and power resource. WSN's are extremely vulnerable against any kind of internal or external attacks, due to several factors such as resource constrained nodes and lack of tamper- resistant packages. To achieve security in Wireless Sensor Networks, it is important to encrypt messages sent among sensor nodes. In this paper, we propose a scheme called Modified Bloom's Scheme (MBS) that uses asymmetric matrices of keys in place of symmetric matrices in order to establish secret keys between node pairs. The network resilience against node capture attack is improved using the proposed scheme. <s> BIB004 </s> Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network <s> IV. SURVEY OF VARIOUS DETECTION AND KEY PREDISTRIBUTION SCHEMES USED FOR RESILIENCE AGAINST NODE CAPTURE ATTACK <s> Security services such as authentication and pairwise key establishment are critical to sensor networks. They enable sensor nodes to communicate securely with each other using cryptographic techniques. In this paper, we propose two key predistribution schemes that enable a mobile sink to establish a secure data-communication link, on the fly, with any sensor nodes. The proposed schemes are based on the polynomial pool-based key predistribution scheme, the probabilistic generation key predistribution scheme, and the Q-composite scheme. The security analysis in this paper indicates that these two proposed predistribution schemes assure, with high probability and low communication overhead, that any sensor node can establish a pairwise key with the mobile sink. Comparing the two proposed key predistribution schemes with the Q-composite scheme, the probabilistic key predistribution scheme, and the polynomial pool-based scheme, our analytical results clearly show that our schemes perform better in terms of network resilience to node capture than existing schemes if used in wireless sensor networks with mobile sinks. <s> BIB005 </s> Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network <s> IV. SURVEY OF VARIOUS DETECTION AND KEY PREDISTRIBUTION SCHEMES USED FOR RESILIENCE AGAINST NODE CAPTURE ATTACK <s> Wireless sensor networks are a new class of distributed systems that are an integral part of the physical space they inhabit. Key distribution plays an important role in wireless sensor networks. In WSN, node capture attack is the most series attack. The aim of this paper is to improve the resistance against the node capture attack. So a double hash function key pre-distribution scheme is used to stop an adversary to get information of non-compromised sensor nodes from the compromised sensor nodes and the deployment model, is based on hexagonal to improve the local connectivity. The proposed scheme provides the best resilience against sensor nodes capture and the probability of links between any sensor nodes are compromised is zero after pair wise keys establishment. <s> BIB006 </s> Optimized and Executive Survey of Physical Node Capture Attack in Wireless Sensor Network <s> IV. SURVEY OF VARIOUS DETECTION AND KEY PREDISTRIBUTION SCHEMES USED FOR RESILIENCE AGAINST NODE CAPTURE ATTACK <s> Wireless Sensor Networks (WSNs) have the potential of being employed in a variety of applications ranging from battlefield surveillance to everyday applications such as smart homes and patient monitoring. Security is a major challenge that all applications based on WSNs are facing nowadays. Firstly, due to the wireless nature of WSNs, and secondly due to their ability to operate in unattended environments makes them even more vulnerable to various sorts of attacks. Among these attacks is node capture attack in WSNs, whose threat severity can range from a single node being compromised in the network to the whole network being compromised as a result of that single node compromise. In this paper, we propose the use of ICMetric technology to provide resilience against node compromise in WSN. ICmetrics generates the security attributes of the sensor node based on measurable hardware and software characteristics of the integrated circuit. These properties of ICmetrics can help safeguard WSNs from various node capture attacks. <s> BIB007
Generally Asymmetric key cryptosystem don't seem to be appropriate for maintaining security in wireless sensor network as a result of their large computational requirements. The three new mechanisms proposed in [ To figure axis labels, use words rather than symbols. Do not label axes only with units. Do not label axes with a ratio of quantities and units. Figure labels should be legible, about 9-point type. Color figures will be appearing only in online publication. All figures will be black and white graphs in print publication. (Q-Composite), Q-common secret keys are needed instead of a single common sharing key as a key predistribution scheme to secure the link between sensor nodes. In the second scheme (Multipath-Reinforcement), a new secret key is assigned between two sensor nodes rather than using the same secret key that was allocated prior to deployment. This would enhance the network resilience against node capture attack. Node-to-node authentication scheme is used to verify communication between legitimate sensor nodes. This is achieved using third scheme (Random Pair wise Keys Scheme). With these schemes, we can obtain improved resilience against node capture attacks as well as node replication. The scheme presented by BIB002 quickly observes compromised node through Sequential Probability Ratio Test (SPRT). The absence of captured node is found out through pre-defined threshold limit. When threshold limit is less than the time period of the missing node, this condition indicates that the sensor node is captured. This scheme detects the node capture attack with more efficiency and additionally limits the time period of a captured node inside five time slots to prevent them from being detected. A framework presented BIB003 for node capture attack which has physical node capture, cloned node detection and revocation of compromised nodes. A dynamical model is employed to explain the behavior of a node within the network under node capture attack. This model is conceived by taking both probabilistic analysis of logical key graphs and linear control theory into account. The Linear Quadratic Regulator (LQR) and Linear Quadratic Gaussian (LQG) methods are intended to control the response of the network under node capture attacks and to revoke the captured node from the wireless sensor network. The estimation of optimal revocation rates gain secured network connectivity under attack. Thus provides resilience against node capture attack. Symmetric matrices of key is utilized for generating a shared secret key to establish a secure communication whereas Asymmetric matrices of key is utilized by Modified Bloom's Scheme (MBS) BIB004 for generating pair-wise key between two sensor nodes. Each sensor node stores master secret key in a tamper resistant hardware that will enhance the cost and energy consumption of the node. They established two shared secret keys to provide communication between sensor nodes. Bidirectional link is made available by the Asymmetric Matrices between pairs of nodes. This method reduces communication link that is compromised between two nodes within the network. Network resilience against node capture attack is enhanced by enhancing the amount of keys generated in each sensor nodes. Base station examines the node replication through the list of neighbor's location using centralized detection scheme and centralized mechanisms does not analyze distributed replication effectively. Two algorithms in BIB001 proposed such as Randomized Multicast Protocol to distribute node information and Line-Selected multicast uses the topology of the network to find replication. Nodes in wireless sensor network work like sensing unit as well as routers. An adversary is prevented by Randomized Multicast Protocol using witness identity. It has same communication overhead as that of broadcast scheme. The Line Selected Multicast uses intermediate nodes to reduce the communication overhead of randomized multicast protocol. So provides improved resilience against replication of the node within the network. The sensor nodes establish secure communication using key pre-distribution schemes in the WSN. In this paper BIB005 , the author proposed two key pre-distribution schemes. The first scheme is acquired by a combination of Polynomial Pool based Key Pre-distribution and probabilistic generation key pre-distribution. A secured key is generated from a pool of random bi-variate polynomial and random generation key with a unique ID. Sensor node can establish a communication by establishing secured pair-wise key. Node (A) can directly or indirectly communicate to node (B) using an intermediate node (I). The second scheme is acquired by using Q-Composite key generation with Polynomial Pool based scheme that enhance the number of generation key rather than a single common key. This will minimize the size of the key pool and provides better resilience against node capture attack in the network. The proposed scheme will minimize the percentage of captured sensor node below 45-29 percent. In this paper BIB007 , the author presented the ICmetric technique to provide safeguard against node capture attack in WSN. ICmetrics or Integrated Circuit metric generates shared keys for secure communication by making use of hardware and software characteristics. It is very hard for an adversary to deduce these characteristics. This metric or feature is not static, but in a predetermined manner. It is not dependent on any particular encryption algorithm. It generates an encryption key from measurable properties of any hardware and software properties of the sensor node. When an attacker tampers with hardware and software properties of the sensor node, it will change its parameters that will result in different computed ICmetric. This change will reflect an indication that the sensor node has been tampered. Therefore, the use of ICmetric improves resilience against node capture attack. In this paper  , the authors provides a network model appropriate for their proposed key management scheme supporting mobility in a heterogeneous WSN that consists of mobile sensor nodes with some static sensor nodes. This scheme based on the two disjoint key pools through which communication keys and authentication keys are derived. These two disjoint key pools gives better security by taking less memory space. They also showed that when a mobile node is in the radio coverage range of more than one static node and this result strongly support for node mobility in WSN then network connectivity in terms of authentication key sharing probability enhances. This scheme also provides improved network resilience against node capture attack compared to some basic schemes. In this paper BIB006 , the authors proposed Hashed key management scheme and deployment model for WSN. These scheme uses hash function to prevent adversary to get information about non-compromised sensor nodes from the compromised sensor nodes and the deployment model which is based on hexagonal for enhancing the local connectivity within the network. The main advantage of these scheme is that an adversary cannot gather key information after pair-wise key establishment, because it is computationally infeasible to revert the hash function. So, this scheme provides the best resilience against nodes capture attack. The authors proposed  the SCADD protocol for node capture attack detection and defense in WSN. SCADD gives a cost-effective solution against the node capture attacks in WSNs, increases the security of WSN for security-sensitive applications. SCADD consists of two building blocks: node attack detection and defense advocating measure block. The node attack detection block provides strategic-based attack detection to abolish the possibility of misjudgment and other block uses a self-destruction defense measure against node capture attack to avoid significant security while not really destroying the node's radio service. Table 2 represents the summarized existing mechanisms that provide resilience against node capture attack.