scholarly journals Clique Size in Sensor Networks with Key Pre-Distribution Based on Transversal Design

2005 ◽  
Vol 1 (3-4) ◽  
pp. 345-354 ◽  
Author(s):  
Dibyendu Chakrabarti ◽  
Subhamoy Maitra ◽  
Bimal Roy
Keyword(s):  
Sensor Networks ◽  
Distributed Computing ◽  
Secure Communication ◽  
Sensor Nodes ◽  
Transversal Design ◽  
Secret Key ◽  
Distributed Sensor Networks ◽  
Distributed Sensor

Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Two sensor nodes are considered connected for secure communication if they share one or more common secret key(s). It is important to analyse the largest subset of nodes in a DSN where each node is connected to every other node in that subset (i.e., the largest clique). This parameter (largest clique size) is important in terms of resiliency and capability towards efficient distributed computing in a DSN. In this paper, we concentrate on the schemes where the key pre-distribution strategies are based on transversal design and study the largest clique sizes. We show that merging of blocks to construct a node provides larger clique sizes than considering a block itself as a node in a transversal design.

Basic Concepts of Wireless Sensor Networks

2011 ◽  
pp. 57-64
Author(s):  
Lina M. Pestana Leão de Brito ◽  
Laura M. Rodríguez Peralta
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Low Cost ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Distributed Sensor Networks ◽  
Distributed Sensor ◽  
Technological Advances ◽  
The Cost ◽  
Communication Equipment

As with many technologies, defense applications have been a driver for research in sensor networks, which started around 1980 due to two important programs of the Defense Advanced Research Projects Agency (DARPA): the distributed sensor networks (DSN) and the sensor information technology (SensIT) (Chong & Kumar, 2003). However, the development of sensor networks requires advances in several areas: sensing, communication, and computing. The explosive growth of the personal communications market has driven the cost of radio devices down and has increased the quality. At the same time, technological advances in wireless communications and electronic devices (such as low-cost, low-power, small, simple yet efficient wireless communication equipment) have enabled the manufacturing of sensor nodes and, consequently, the development of wireless sensor networks (WSNs).

scholarly journals An Efficient Elliptic Curve based Key Management Scheme for Distributed Sensor Networks

2019 ◽  
Vol 4 (6) ◽  
pp. 111-116
Author(s):  
Porkodi Chinniah ◽  
Sangavai Krishnamoorthi
Keyword(s):  
Sensor Networks ◽  
Elliptic Curve ◽  
Key Management ◽  
Key Distribution ◽  
Secret Key ◽  
Distributed Sensor Networks ◽  
Prime Field ◽  
Distributed Sensor ◽  
Management Scheme ◽  
Key Management Scheme

Distributed Sensor Networks are broadly used in many applications and key distribution is a challenging task. In this work, a key management scheme is developed for distributed sensor networks based on elliptic curve cryptography over prime field. Key distribution among the nodes and interactive as well as non interactive protocols for agreement of common secret key for message transmission between two nodes are discussed. The probability for connectivity of the network generated according to the proposed key distribution scheme is discussed in detail. The implementation of the proposed scheme is done using NetSim interfaced with MATLAB. Connectivity of the network is also checked through eigenvalues of the Laplacian matrix of the network.   

Lightweight Key Management for Adaptive Addressing in Next Generation Internet

2021 ◽  
pp. 1890-1914
Author(s):  
Vinod Vijaykumar Kimbahune ◽  
Arvind V. Deshpande ◽  
Parikshit Narendra Mahalle
Keyword(s):  
Sensor Networks ◽  
Key Management ◽  
Secure Communication ◽  
Resource Constraints ◽  
Sensor Nodes ◽  
Security Requirements ◽  
Next Generation ◽  
Secret Key ◽  
Next Generation Internet ◽  
Node Capture

The continuous evolution of Next Generation Internet (NGI) amplifies the demand for efficient and secure communication capable of responding effectively to the challenges posed by the emerging applications. For secure communication between two sensor nodes, a secret key is needed. Cryptographic key management is a challenging task in sensor networks as the hostile environment of sensor networks makes it more prone to attacks. Apart from resource constraints of the devices, unknown topology of the network, the higher risk of node capture and lack of a fixed infrastructure makes the key management more challenging in Wireless Sensor Network (WSN). Paper surveys different key Management schemes for WSN. The paper presents the efficiency versus security requirements tradeoffs in key management for WSN. Paper also proposes a novel key management protocol which provides strong resistance against replay attacks. The results obtained from the mathematical model based on conditional probability of the scheme suggest that the proposed key management in NGI is efficient and attack resistant.

Delaunay Triangulation Based Key Distribution for Three-Dimensional Wireless Sensor Networks

2021 ◽  
pp. 2150009
Author(s):  
Monjul Saikia
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Delaunay Triangulation ◽  
Secure Communication ◽  
Three Dimensional ◽  
Key Distribution ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Secret Key ◽  
Symmetric Key

The security of wireless sensor networks is a significant concern and can be achieved by the application of cryptographic algorithms. The symmetric key encryption techniques are widely used cryptographic mechanisms for the security of sensor networks due to its low computational complexity. A symmetric key encryption technique requires a secret key to be shared between both parties for confidential communication. In a wireless sensor network, it is difficult to know which node is going to be in its communication range at the deployment phase. If prior knowledge of sensor location exists, it is an added advantage and helps in the distribution of secret keys among nodes. Even if with the expected location information, distributing the keys properly among the nodes is a challenging task. A proper algorithm must be used so that it gives the adequate utilization of the distributed keys with a minimal number of keys per sensor node. In this paper, we propose a location-dependent key distribution scheme. We use Delaunay Triangulation for the efficient distribution of keys among sensor nodes. The method gives a high probability of secure communication links among nodes with high resilience to the network.

Lightweight Key Management for Adaptive Addressing in Next Generation Internet

2017 ◽  
Vol 8 (1) ◽  
pp. 50-69 ◽  
Author(s):  
Vinod Vijaykumar Kimbahune ◽  
Arvind V. Deshpande ◽  
Parikshit N Mahalle
Keyword(s):  
Sensor Networks ◽  
Key Management ◽  
Secure Communication ◽  
Resource Constraints ◽  
Sensor Nodes ◽  
Security Requirements ◽  
Next Generation ◽  
Secret Key ◽  
Next Generation Internet ◽  
Management Protocol

The continuous evolution of Next Generation Internet (NGI) amplifies the demand for efficient and secure communication capable of responding effectively to the challenges posed by the emerging applications. For secure communication between two sensor nodes, a secret key is needed. Cryptographic key management is a challenging task in sensor networks as the hostile environment of sensor networks makes it more prone to attacks. Apart from resource constraints of the devices, unknown topology of the network, the higher risk of node capture and lack of a fixed infrastructure makes the key management more challenging in Wireless Sensor Network (WSN). Paper surveys different key Management schemes for WSN. The paper presents the efficiency versus security requirements tradeoffs in key management for WSN. Paper also proposes a novel key management protocol which provides strong resistance against replay attacks. The results obtained from the mathematical model based on conditional probability of the scheme suggest that the proposed key management in NGI is efficient and attack resistant.

scholarly journals Key Management and Cryptography in Wireless Sensor Networks

2020 ◽  
Vol 8 (5) ◽  
pp. 3847-4851
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Secure Communication ◽  
Data Communication ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Secret Key ◽  
Healthcare Applications ◽  
Intended Receiver

The use of Wireless Sensor Networks (WSN) in the field of military, battlefield, healthcare applications etc has seen a plethora of growth towards variety of sensory devices. Irrespective of different locations, the sensor nodes has to do its task. Hence, the dynamic wireless sensor networks should ensure better quality of sensor nodes that covers wider network area and additional services in relative to static WSNs systems. By doing so, it requires secure data communication among the sensor nodes in wireless environment. Key Management is the recent security concept enabled to provide secure communication between sender and receiver nodes. In this paper, we have proposed efficient key updates systems between the nodes. In any scenario, the nodes may join or leaves the network environment which facilitates to initiate a secret key between intended sender and intended receiver. A certificate less key secrecy system is designed for secure communication in wireless links. By designing so, we have addressed the issues like node authentication, data confidentiality and data integrity. Experimental analyses have shown the effectiveness of proposed system.

scholarly journals Design and Implementation of Secure Communication using Elliptic Curve Cryptograph between Wireless Sensor Nodes

2019 ◽  
Vol 9 (1) ◽  
pp. 920-925
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Elliptic Curve ◽  
Elliptic Curve Cryptography ◽  
Secure Communication ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Secret Key ◽  
Wide Range ◽  
Secret Keys

Wireless Sensor Networks is an emerging trend and has become gradually popular across wide range. A key distributional protocol is intended to safely provide authentic motes with secret keys system using Elliptic Curve Cryptography functions. The convention is a variation of the Diffie_Hellman convention utilizing Elliptic Curve Cryptography. It’s agreement of a key convention that permits pair of gatherings, both having a elliptic open and closed key, to build up a mutual secret key over an uncertain channel. This shared secret key may be either utilized as key or used to determine another key which would then be able to be utilized to subsequent correspondences utilizing a cipher of symmetric key. The use of advanced encryption standard for the encrypt and decrypt of the data also ensures that security is never flawed. Therefore Elliptic curve cryptograph is a best candidate for providing secure communication between Wireless Sensor Networks.

scholarly journals Adaptive Sensor Activity Scheduling in Distributed Sensor Networks: A Statistical Mechanics Approach

2009 ◽  
Vol 5 (3) ◽  
pp. 242-261 ◽  
Author(s):  
Abhishek Srivastav ◽  
Asok Ray ◽  
Shashi Phoha
Keyword(s):  
Sensor Networks ◽  
Statistical Mechanics ◽  
Sensor Network ◽  
Sensor Nodes ◽  
Centralized Control ◽  
Activity Scheduling ◽  
Distributed Sensor Networks ◽  
Distributed Sensor ◽  
Wake Modes ◽  
Temporal Events

This article presents an algorithm for adaptive sensor activity scheduling ( A-SAS) in distributed sensor networks to enable detection and dynamic footprint tracking of spatial-temporal events. The sensor network is modeled as a Markov random field on a graph, where concepts of Statistical Mechanics are employed to stochastically activate the sensor nodes. Using an Ising-like formulation, the sleep and wake modes of a sensor node are modeled as spins with ferromagnetic neighborhood interactions; and clique potentials are defined to characterize the node behavior. Individual sensor nodes are designed to make local probabilistic decisions based on the most recently sensed parameters and the expected behavior of their neighbors. These local decisions evolve to globally meaningful ensemble behaviors of the sensor network to adaptively organize for event detection and tracking. The proposed algorithm naturally leads to a distributed implementation without the need for a centralized control. The A-SAS algorithm has been validated for resource-aware target tracking on a simulated sensor field of 600 nodes.

Sign in / Sign up

Export Citation Format

Share Document