scholarly journals Secure Key Pre-distribution in Wireless Sensor Networks Using Combinatorial Design and Traversal Design Based Key Distribution

Author(s):  
Saba Khalid ◽  
Faiyaz Ahmad ◽  
Mohd. Rizwan Beg

Security is an indispensable concern in Wireless Sensor Network (WSN) due to the presence of potential adversaries. For secure communication in infrastructure less sensor nodes various key pre distribution have been proposed. In this paper we have evaluated various existing deterministic, probabilistic and hybrid type of key pre distribution and dynamic key generation algorithms for distributing pair-wise, group-wise and network-wise keys and we have propose a key pre distribution scheme using deterministic approach based on combinatorial design and traversal design which will improve the resiliency and achieve sufficient level of security in the network. This design can be used where large number of nodes are to be deployed in the WSN.

Author(s):  
Saba Khalid ◽  
Faiyaz Ahmad ◽  
Mohd. Rizwan Beg

Security is an indispensable concern in Wireless Sensor Network (WSN) due to the presence of potential adversaries. For secure communication in infrastructureless sensor nodes various key predistribution have been proposed. In this paper we have evaluated various existing deterministic, probabilistic and hybrid type of key pre-distribution and dynamic key generation algorithms for distributing pair-wise, group-wise and network-wise keys and we have propose a key predistribution scheme using deterministic approach based on combinatorial design and traversal design which will improve the resiliency and achieve sufficient level of security in the network.This design can be used where large number of nodes are to be deployed in the WSN.


Main problem is when setting up Wireless(W)-Sensor(S)-Network(N) intended for node communication arises for security. Discussed here is a three-tier architecture with two polynomial pools containing wireless routers, key generation center and few access points which are also sensor nodes that can be mobile devices that intend to get better security. The crucial feature of three tier architecture authentication, where communication between WN to access(A) point(P) is established from AP to the sensor node, resulted by pair(P)wise(W) key(K) pre-distribution (PD) methodology and the nodes are authenticated utilizing polynomial keys and Paillier cryptosystem algorithm. Presently, the WN attacks the duplication, such as seeing the nodes in the network. In the event that a nasty node is found and if you want to send packets within the network, you need to store many of keys from both pools for validation. But because there are no sufficient keys available and therefore can't communicate with other nodes in the network. This paper describes an effective contrivance for accomplishing security between node communications by formulating three-level security architecture.


2014 ◽  
Vol 622 ◽  
pp. 191-198
Author(s):  
Devasagayam Jayashree ◽  
V. Uma Rani ◽  
K. Soma Sundaram

Due to emerging technology Wireless Sensor Network (WSN), it is necessary to monitor the behavior of sensor nodes and establish the secure communication in network. Security is a challenging task in wireless environment. Several encryption mechanisms are available to prevent outsider attacks, but no mechanism available for insider attacks. A trust model is a collection of rules used to establish co-operation or collaboration among nodes as well as monitoring misbehavior of wireless sensor networks. Trust model is necessary to enhance secure localization, communication or routing, aggregation, collaboration among nodes. In this paper, proposed a behavior based distributed trust model for wireless sensor network to effectively deal with self-ish or malicious nodes. Here, take multidimensional trust attributes derived from communications and networks to evaluate the overall trust of sensor nodes. It monitors the behavior of nodes and establishes secure communication among networks.


2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Chin-Ling Chen ◽  
Chih-Cheng Chen ◽  
De-Kui Li

In recent years, wireless sensor network (WSN) applications have tended to transmit data hop by hop, from sensor nodes through cluster nodes to the base station. As a result, users must collect data from the base station. This study considers two different applications: hop by hop transmission of data from cluster nodes to the base station and the direct access to cluster nodes data by mobile users via mobile devices. Due to the hardware limitations of WSNs, some low-cost operations such as symmetric cryptographic algorithms and hash functions are used to implement a dynamic key management. The session key can be updated to prevent threats of attack from each communication. With these methods, the data gathered in wireless sensor networks can be more securely communicated. Moreover, the proposed scheme is analyzed and compared with related schemes. In addition, an NS2 simulation is developed in which the experimental results show that the designed communication protocol is workable.


Sensors ◽  
2019 ◽  
Vol 19 (19) ◽  
pp. 4281
Author(s):  
Ngoc-Thanh Dinh ◽  
Younghan Kim

Wireless sensor network (WSN) studies have been carried out for multiple years. At this stage, many real WSNs have been deployed. Therefore, configuration and updating are critical issues. In this paper, we discuss the issues of configuring and updating a wireless sensor network (WSN). Due to a large number of sensor nodes, in addition to the limited resources of each node, manual configuring turns out to be impossible. Therefore, various auto-configuration approaches have been proposed to address the above challenges. In this survey, we present a comprehensive review of auto-configuration mechanisms with the taxonomy of classifications of the existing studies. For each category, we discuss and compare the advantages and disadvantages of related schemes. Lastly, future works are discussed for the remaining issues in this topic.


2020 ◽  
Vol 16 (6) ◽  
pp. 155014772092577 ◽  
Author(s):  
Shahwar Ali ◽  
A Humaria ◽  
M Sher Ramzan ◽  
Imran Khan ◽  
Syed M Saqlain ◽  
...  

In wireless sensor networks, the sensors transfer data through radio signals to a remote base station. Sensor nodes are used to sense environmental conditions such as temperature, strain, humidity, sound, vibration, and position. Data security is a major issue in wireless sensor networks since data travel over the naturally exposed wireless channel where malicious attackers may get access to critical information. The sensors in wireless sensor networks are resource-constrained devices whereas the existing data security approaches have complex security mechanisms with high computational and response times affecting the network lifetime. Furthermore, existing systems, such as secure efficient encryption algorithm, use the Diffie–Hellman approach for key generation and exchange; however, Diffie–Hellman is highly vulnerable to the man-in-the-middle attack. This article introduces a data security approach with less computational and response times based on a modified version of Diffie–Hellman. The Diffie–Hellman has been modified to secure it against attacks by generating a hash of each value that is transmitted over the network. The proposed approach has been analyzed for security against various attacks. Furthermore, it has also been analyzed in terms of encryption/decryption time, computation time, and key generation time for different sizes of data. The comparative analysis with the existing approaches shows that the proposed approach performs better in most of the cases.


Author(s):  
Saloni Dhiman ◽  
Deepti Kakkar ◽  
Gurjot Kaur

Wireless sensor networks (WSNs) consist of several sensor nodes (SNs) that are powered by battery, so their lifetime is limited, which ultimately affects the lifespan and hence performance of the overall networks. Till now many techniques have been developed to solve this problem of WSN. Clustering is among the effective technique used for increasing the network lifespan. In this chapter, analysis of multi-hop routing protocol based on grid clustering with different selection criteria is presented. For analysis, the network is divided into equal-sized grids where each grid corresponds to a cluster and is assigned with a grid head (GH) responsible for collecting data from each SN belonging to respective grid and transferring it to the base station (BS) using multi-hop routing. The performance of the network has been analyzed for different position of BS, different number of grids, and different number of SNs.


2019 ◽  
Vol 29 (09) ◽  
pp. 2050141 ◽  
Author(s):  
Muhammed Enes Bayrakdar

In this paper, a monitoring technique based on the wireless sensor network is investigated. The sensor nodes used for monitoring are developed in a simulation environment. Accordingly, the structure and workflow of wireless sensor network nodes are designed. Time-division multiple access (TDMA) protocol has been chosen as the medium access technique to ensure that the designed technique operates in an energy-efficient manner and packet collisions are not experienced. Fading channels, i.e., no interference, Ricean and Rayleigh, are taken into consideration. Energy consumption is decreased with the help of ad-hoc communication of sensor nodes. Throughput performance for different wireless fading channels and energy consumption are evaluated. The simulation results show that the sensor network can quickly collect medium information and transmit data to the processing center in real time. Besides, the proposed technique suggests the usefulness of wireless sensor networks in the terrestrial areas.


2012 ◽  
Vol 04 (01) ◽  
pp. 1250010 ◽  
Author(s):  
DEYING LI ◽  
ZHENG LI ◽  
WENKAI MA ◽  
WENPING CHEN

An underwater acoustic wireless sensor network (UA-WSN) consists of many resource-constrained underwater sensor nodes (USNs), which are deployed to perform collaborative monitoring tasks over a given region. One way to preserve network connectivity while guaranteeing other network QoS is to deploy some relay nodes (RNs) in the networks. Although RNs' function is more powerful than USNs, but they can lead to more interference and their cost is more expensive. This paper addresses constrained low-interference relay node deployment problem for 3-D UA-WSNs in which the RNs are placed at a subset of candidate locations to ensure connectivity between the USNs such that the number of RNs deployed and the value of total incremental interference are minimized. We first prove that it is NP-hard, then propose a general approximation algorithm framework. Based on the framework, we get two polynomial time O(1)-approximation algorithms.


Sign in / Sign up

Export Citation Format

Share Document