Security Authentication Scheme Research for Wireless Sensor Networks

2014 ◽  
Vol 687-691 ◽  
pp. 1802-1805
Author(s):  
Yuan Chen ◽  
Qing Ye
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Cluster Head ◽  
Base Station ◽  
Authentication Scheme ◽  
Wireless Sensor ◽  
Security Authentication ◽  
Head Node ◽  
Authentication Schemes

Existing security authentication schemes are mostly concentrated on the key management and cryptographic algorithms. However, there are few authentication schemes designed according to the application needs. To solve this problem, considering the limited resource of wireless sensor networks and the practical application, a partially distributed authentication scheme is proposed. We use hierarchical network structure. Centralized authentication is used between the base station and cluster head nodes, while cluster head node and ordinary nodes use a distributed authentication. Analysis shows that this method has some advantages in the overhead of the storage, computing and communication, while network security can be guaranteed.

An Improved Cluster Key Management Algorithm for Wireless Sensor Networks

2014 ◽  
Vol 998-999 ◽  
pp. 1092-1095
Author(s):  
Qi Sheng Zhao ◽  
Xiao Ming Liu ◽  
Hui Sheng Zhu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Authentication Mechanism ◽  
Management Algorithm ◽  
Management Scheme ◽  
Dynamic Key Management ◽  
Dynamic Key

The information security of wireless sensor networks is one of hot issues on the current research; this paper combines threshold key scheme with the management of security key sharing and group agreement and proposes dynamic key management scheme through clustering level key matrix of authentication mechanism from the cluster to node. The network is divided into different clusters, and the cluster head conducts the key authentication exchange and updates the key management with threshold key schemes, with no need of third authentication center, reduces the computing and communication costs, and promotes communication.

scholarly journals Mobile Device Based Dynamic Key Management Protocols for Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10
Author(s):  
Chin-Ling Chen ◽  
Chih-Cheng Chen ◽  
De-Kui Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Key Management ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Direct Access ◽  
Session Key ◽  
Dynamic Key Management ◽  
Dynamic Key

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.

scholarly journals Energy Consumption Based Low Energy Aware Gateway (LEAG) Protocol in Wireless Sensor Networks

2019 ◽  
Vol 8 (5S3) ◽  
pp. 128-132 ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Cluster Head ◽  
Base Station ◽  
Low Energy ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Aware

Wireless Sensor Networks (WSN) consists of a large amount of nodes connected in a self-directed manner. The most important problems in WSN are Energy, Routing, Security, etc., price of the sensor nodes and renovation of these networks is reasonable. The sensor node tools included a radio transceiver with an antenna and an energy source, usually a battery. WSN compute the environmental conditions such as temperature, sound, pollution levels, etc., WSN built the network with the help of nodes. A sensor community consists of many detection stations known as sensor nodes, every of which is small, light-weight and portable. Nodes are linked separately. Each node is linked into the sensors. In recent years WSN has grow to be an essential function in real world. The data’s are sent from end to end multiple nodes and gateways, the data’s are connected to other networks such as wireless Ethernet. MGEAR is the existing mechanism. It works with the routing and energy consumption. The principal problem of this work is choosing cluster head, and the selection is based on base station, so the manner is consumes energy. In this paper, develop the novel based hybrid protocol Low Energy Aware Gateway (LEAG). We used Zigbee techniques to reduce energy consumption and routing. Gateway is used to minimize the energy consumption and data is send to the base station. Nodes are used to transmit the data into the cluster head, it transmit the data into gateway and gateway compress and aggregate the data then sent to the base station. Simulation result shows our proposed mechanism consumes less energy, increased throughput, packet delivery ration and secure routing when compared to existing mechanism (MGEAR).

scholarly journals A Novel Framework to Secure CBWSNS Against the Selfishness Problem

2019 ◽  
Vol 7 (2) ◽  
pp. 7-16
Author(s):  
Poonam Mittal ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Defense Mechanism ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Security Level ◽  
Stochastic Algorithm ◽  
Worst Case ◽  
Cluster Heads

Dynamic and cooperative nature of sensor nodes in Wireless Sensor Networks raises question on security. Various researchers work in this direction to spot malicious, selfish and compromised nodes. Various mechanisms followed are uniqueness of clustering, reputation system and an operation at specific nodes. LEACH is a hierarchical protocol in which most nodes transmit to cluster heads, and the cluster heads aggregate and compress the data and forward it to the base station (sink). Each node uses a stochastic algorithm at each round to determine whether it will become a cluster head in this round. Clustering process carried out in two stages takes the role of the reputation scheme and reveals specific operation at CH, IN and MNs beside their usual activities in cluster based wireless sensor networks. This paper mentioned the final structure of the security framework, corresponding attacks and defense mechanism of the model. It also discusses various security level processes of wireless sensor networks. Results implies that in a cluster-based protocol such as LEACH in which optimally 5% of the nodes are cluster heads it is likely that a significant portion of the network can be paralyzed or the entire network disabled, in the worst-case scenario, if these cluster heads are compromised. Our main contribution in this paper is our novel approach in maintaining trusted clusters through a trust-based decision-making cluster head election algorithm.

A Node Authentication Model in Wireless Sensor Networks With Locked Cluster Generation

2021 ◽  
pp. 236-250
Author(s):  
C. R. Bharathi ◽  
Alapati Naresh ◽  
Arepalli Peda Gopi ◽  
Lakshman Narayana Vejendla
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Cluster Formation ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Generation ◽  
Secure Network

In wireless sensor networks (WSN), the majority of the inquiries are issued at the base station. WSN applications frequently require collaboration among countless sensor nodes in a network. One precedent is to persistently screen a region and report occasions. A sensor node in a WSN is initially allocated with an energy level, and based on the tasks of that sensor node, energy will be reduced. In this chapter, two proposed methods for secure network cluster formation and authentication are discussed. When a network is established then all the nodes in it must register with cluster head and then authentication is performed. The selection of cluster head is done using a novel selection algorithm and for authenticating the nodes. Also, a novel algorithm for authentication is used in this chapter. The validation and authorization of nodes are carried over by managing the keys in WSN. The results have been analyzed using NS2 simulator with an aid of list of relevant parameters.

scholarly journals A PSO-Based Uneven Dynamic Clustering Multi-Hop Routing Protocol for Wireless Sensor Networks

Sensors ◽  
2019 ◽  
Vol 19 (8) ◽  
pp. 1835 ◽  
Author(s):  
Ruan ◽  
Huang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Cluster Head ◽  
Base Station ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Energy Efficient Routing

Since wireless sensor networks (WSNs) are powered by energy-constrained batteries, many energy-efficient routing protocols have been proposed to extend the network lifetime. However, most of the protocols do not well balance the energy consumption of the WSNs. The hotspot problem caused by unbalanced energy consumption in the WSNs reduces the network lifetime. To solve the problem, this paper proposes a PSO (Particle Swarm Optimization)-based uneven dynamic clustering multi-hop routing protocol (PUDCRP). In the PUDCRP protocol, the distribution of the clusters will change dynamically when some nodes fail. The PSO algorithm is used to determine the area where the candidate CH (cluster head) nodes are located. The adaptive clustering method based on node distribution makes the cluster distribution more reasonable, which balances the energy consumption of the network more effectively. In order to improve the energy efficiency of multi-hop transmission between the BS (Base Station) and CH nodes, we also propose a connecting line aided route construction method to determine the most appropriate next hop. Compared with UCCGRA, multi-hop EEBCDA, EEMRP, CAMP, PSO-ECHS and PSO-SD, PUDCRP prolongs the network lifetime by between 7.36% and 74.21%. The protocol significantly balances the energy consumption of the network and has better scalability for various sizes of network.

scholarly journals An Energy-Aware Method for Selecting Cluster Heads in Wireless Sensor Networks

2020 ◽  
Vol 10 (21) ◽  
pp. 7886
Author(s):  
Atefeh Rahiminasab ◽  
Peyman Tirandazi ◽  
M. J. Ebadi ◽  
Ali Ahmadian ◽  
Mehdi Salimi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Cluster Head ◽  
Base Station ◽  
Energy Resources ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Dynamic Clustering ◽  
Clustering Protocol

Wireless sensor networks (WSNs) include several sensor nodes that have limited capabilities. The most critical restriction in WSNs is energy resources. Moreover, since each sensor node’s energy resources cannot be recharged or replaced, it is inevitable to propose various methods for managing the energy resources. Furthermore, this procedure increases the network lifetime. In wireless sensor networks, the cluster head has a significant impact on system global scalability, energy efficiency, and lifetime. Furthermore, the cluster head is most important in combining, aggregating, and transferring data that are received from other cluster nodes. One of the substantial challenges in a cluster-based network is to choose a suitable cluster head. In this paper, to select an appropriate cluster head, we first model this problem by using multi-factor decision-making according to the four factors, including energy, mobility, distance to centre, and the length of data queues. Then, we use the Cluster Splitting Process (CSP) algorithm and the Analytical Hierarchy Process (AHP) method in order to provide a new method to solve this problem. These four factors are examined in our proposed approach, and our method is compared with the Base station Controlled Dynamic Clustering Protocol (BCDCP) algorithm. The simulation results show the proposed method in improving the network lifetime has better performance than the base station controlled dynamic clustering protocol algorithm. In our proposed method, the energy reduction is almost 5% more than the BCDCP method, and the packet loss rate in our proposed method is almost 25% lower than in the BCDCP method.

scholarly journals Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

Cluster-to-Cluster Relay Schemes in Wireless Sensor Network

2011 ◽  
Vol 179-180 ◽  
pp. 728-733
Author(s):  
Xue Fen Zhang ◽  
Fang Zhen Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Cooperative Communications ◽  
Cluster Head ◽  
Cooperative Transmission ◽  
Wireless Sensor ◽  
Transmission Scheme ◽  
Numerical Examples ◽  
Data Packets ◽  
Head Node

Cooperative communications is a promising technology to improve the performance of wireless sensor networks. To ensure scalability sensor networks are often partitioned into clusters, each managed by a cluster head. most of the previous research focused on the optimal communication of sensors in one cluster, very little attention has been paid to the efficiency of cooperation among the clusters .In this paper, we consider cluster-to-cluster cooperative communications where cluster head node relay data packets to nearby cluster head nodes using cooperative communications, and propose two cooperative transmission scheme and analysis on the throughput and outage probability. Finally, we demonstrate the applicability of our results through numerical examples.

scholarly journals A Security Framework for Cluster-Based Wireless Sensor Networks against the Selfishness Problem

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Zeba Ishaq ◽  
Seongjin Park ◽  
Younghwan Yoo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Limited Resources ◽  
Security Framework ◽  
Insider Attack ◽  
Head Node ◽  
Special Working

Over the last few decades, Cluster-Based Wireless Sensor Networks (CBWSNs) have played a crucial role in handling various challenges (load balancing, routing, network lifetime, etc.) of large scale Wireless Sensor Networks (WSNs). However, the security becomes a big problem for CBWSNs, especially when nodes in the cluster selfishly behave, e.g., not forwarding other nodes’ data, to save their limited resources. This may make the cluster obsolete, even destroying the network. Thus, a way to guarantee the secure and consistent clusters is needed for proper working of CBWSNs. We showed that the selfishness attack, i.e., passive attack or insider attack, in CBWSNs can cause severe performance disaster, when particularly a cluster head node becomes selfish. In order to prevent this situation, this paper proposes a security framework that involves a novel clustering technique as well as a reputation system at nodes for controlling selfishness, making them cooperative and honest. The novelty of the clustering comes from the existence of inspector node (IN) to monitor the cluster head (CH) and its special working style. The experimental results showed that the proposed security framework can control the selfishness and improve the security of the clusters.

Sign in / Sign up

Export Citation Format

Share Document