Many basic key distribution schemes specifically tuned to wireless sensor networks have been proposed in the literature. Recently, several researchers have proposed schemes in which they have used group-based deployment models and assumed predeployment knowledge of the expected locations of nodes. They have shown that these schemes achieve better performance than the basic schemes, in terms of connectivity, resilience against node capture and storage requirements. But in many situations expected locations of nodes are not available. In this paper we propose a solution which uses the basic scheme, but does not use group-based deployment model and predeployment knowledge of the locations of nodes, and yet performs better than schemes which make the aforementioned assumptions. In our scheme, groups are formed after deployment of sensor nodes, on the basis of their physical locations, and the nodes sample keys from disjoint key pools. Compromise of a node affects secure links with other nodes that are part of its group only. Because of this reason, our scheme performs better than the basic schemes and the schemes using predeployment knowledge, in terms of connectivity, storage requirement, and security. Moreover, the post-deployment key generation process completes sooner than in schemes like LEAP+.
In addition, our scheme is also different in the way nodes choose their key rings. In @cite_0 , on receiving the nonce, nodes map it to some different value. In contrast, in our scheme, some nodes transmit their id, and corresponding to every id there is an associated key pool. Nodes sample keys from the key pool corresponding to the received id. The main advantage of doing this is the improved resilience against node capture. @cite_0 , all nodes receiving the same nonce use the same key for secure communication; so if any node is compromised, all the secure links formed by the nonce received by this node will be compromised. On the other hand, in our scheme, communication with other nodes is compromised , because nodes receiving the same id sample keys from the key pool instead of using the same key.
@cite_0
2950479988 2006853333 2089421240 1799001532
Consider a scenario of broadcasting a common content to a group of cooperating wireless nodes that are within proximity of each other. Nodes in this group may receive partial content from the source due to packet losses over wireless broadcast links. We further consider that packet losses are different for different nodes. The remaining missing content at each node can then be recovered, thanks to cooperation among the nodes. In this context, the minimum amount of time that can guarantee a complete acquisition of the common content at every node is referred to as the completion time. It has been shown that instantly decodable network coding (IDNC) reduces the completion time as compared to no network coding in this scenario. Yet, for applications such as video streaming, not all packets have the same importance and not all users are interested in the same quality of content. This problem is even more interesting when additional, but realistic constraints, such as strict deadline, bandwidth, or limited energy are added to the problem formulation. We assert that direct application of IDNC in such a scenario yields poor performance in terms of content quality and completion time. In this paper, we propose a novel Content-Aware IDNC scheme that improves content quality and network coding opportunities jointly by taking into account significance of each packet towards the desired quality of service (QoS). Our proposed Content-Aware IDNC maximizes the quality under the completion time constraint, and minimizes the completion time under the quality constraint.We demonstrate the benefits of Content-Aware IDNC through simulations. In the wireless sensor networks (WSNs), sensor nodes may be deployed in the hostile areas. The eavesdropper can intercept the messages in the public channel and the communication between the nodes is easily monitored. Furthermore, any malicious intermediate node can act as a legal receiver to alter the passing messages. Hence, message protection and sensor node identification become important issues in WSN. In this paper, we propose a novel scheme providing unconditional secure communication based on the quantum characteristics, including no-cloning and teleportation. We present a random EPR-pair allocation scheme that is designed to overcome the vulnerability caused by possible compromised nodes. EPR pairs are pre-assigned to sensor nodes randomly and the entangled qubits are used by the nodes with the quantum teleportation scheme to form a secure link. We also show a scheme on how to resist the man-in-the-middle attack. In the framework, the qubits are allocated to each node before deployment and the adversary is unable to create the duplicated nodes. Even if the malicious nodes are added to the network to falsify the messages transmitting in the public channel, the legal nodes can easily detect the fake nodes that have no entangled qubits and verify the counterfeit messages. In addition, we prove that one node sharing EPR pairs with a certain amount of neighbor nodes can teleport information to any node in the sensor network if there are sufficient EPR pairs in the qubits pool. The proposal shows that the distributed quantum wireless sensor network gains better security than classical wireless sensor network and centralized quantum wireless network. We give, for the first time, a precise mathematical analysis of the connectivity and security properties of sensor networks that make use of the random predistribution of keys. We also show how to set the parameters---pool and key ring size---in such a way that the network is not only connected with high probability via secure links but also provably resilient, in the following sense: We formally show that any adversary that captures sensors at random with the aim of compromising a constant fraction of the secure links must capture at least a constant fraction of the nodes of the network. In the context of wireless sensor networks where random predistribution of keys is employed, we are the first to provide a mathematically precise proof, with a clear indication of parameter choice, that two crucial properties---connectivity via secure links and resilience against malicious attacks---can be obtained simultaneously. We also show in a mathematically rigorous way that the network enjoys another strong security property. The adversary cannot partition the network into two linear size components, compromising all the links between them, unless it captures linearly many nodes. This implies that the network is also fault tolerant with respect to node failures. Our theoretical results are complemented by extensive simulations that reinforce our main conclusions. In this paper we propose novel deterministic key predistribution schemes using codes. In particular we use Reed Solomon codes to present key predistribution scheme, which is better than existing schemes in terms of connectivity. We show that selective node compromise attack cannot be launched, because there is no clever way of knowing which nodes to compromise. An important advantage of our scheme is that we can increase the scalability of the network without redistributing keys in the existing nodes.