A Secure Cluster Head Selection Mechanism Based on Node's Features and Behavior in Wireless Sensor Networks

2019 ◽  
Vol 13 (3) ◽  
pp. 74-90
Author(s):  
Deepika Agrawal ◽  
Sudhakar Pandey ◽  
Veena Anand

Security is the utmost importance for the safe operation of the Internet of Things (IoT) devices. Behind IoT, a sensor network operates. Hence, security and lifetime extensions of the sensor networks are the primary concern. Node clustering is a technique to lengthen the lifetime of sensor networks. In a clustering technique, Cluster Heads (CH) are chosen. To provide the security to the sensor network, reliable CHs are elected. In this article, a protocol is proposed which elects reliable CHs based on node features such as residual energy, distance to the sink and node behavior such as the number of packets transmitted and received successfully, data consistency factor. The simulation results obtained prove that the proposed protocol performs better.

Author(s):  
Jong-Yong Lee ◽  
Daesung Lee

<p>A Wireless Sensor Network is a wirelessly configured Sensor Node with limited power such as a battery. There are many Wireless Sensor Network Protocols to increase energy efficiency, among which LEACH Protocol and SEP are typical. The LEACH Protocol is mainly used for homogeneous sensor networks with the same initial energy, and SEP is used for heterogeneous sensor networks with different initial energies. In the case of SEP-E, another heterogeneous sensor with different initial energy is added. SEP and SEP-E provide a higher probability of Cluster Head election for node types with more energy than Normal Nodes. Since the current residual energy of the node is not confirmed, even if the energy is low, the Cluster Head may be elected because of the node type. In this paper, considering the residual energy of a node when a Cluster Head is elected, we increase the probability of electing a Cluster Head with more residual energy. Cluster Head consumes a lot of energy. A node with a lot of residual energy is elected as a Cluster Head, so the network lifetime can be used for a long time.</p>


2021 ◽  
Vol 2074 (1) ◽  
pp. 012030
Author(s):  
Jing Luo ◽  
Xiaoxu Xiao ◽  
Rongxia Wang

Abstract The topology control of sensor sensor network was studied based on fuzzy control algorithm. Aiming at the dynamic changes of the topology of large-scale and heterogeneous artificial intelligence sensor networks and the incomplete information between nodes, a smart network-based congestion control algorithm for sensor networks was proposed and the performance of fuzzy control algorithms was analyzed. Based on this, a fuzzy control algorithm was designed. The algorithm fully considered the residual energy of nodes and the distribution of nodes in the network. Therefore, the reasonable election of the cluster head can be realized through the game between nodes, which effectively avoided energy holes, made the network energy consumption more uniform, prolonged the network life cycle, and optimized the network topology.


2013 ◽  
Vol 7 (2) ◽  
pp. 549-557 ◽  
Author(s):  
Deepali Virmani ◽  
Akshay Jain ◽  
Ankit Khandelwal ◽  
Divik Gupta ◽  
Nitin Garg

Energy being the very key concern area with sensor networks, so the main focus lies in developing a mechanism to increase the lifetime of a sensor network by energy balancing. To achieve energy balancing and maximizing network lifetime we use an idea of clustering and dividing the whole network into different clusters. In this paper we propose a dynamic cluster formation method where clusters are refreshed periodically based on residual energy, distance and cost. Refreshing clustering minimizes workload of any single node and in turn enhances the energy conservation. Sleep and wait methodology is applied to the proposed protocol to enhance the network lifetime by turning the nodes on and off according to their duties. The node that has some data to be transmitted is in on state and after forwarding its data to the cluster head it changes its state to off which saves the energy of entire network. Simulations have been done using MAT lab. Simulation results prove the betterment of our proposed method over the existing Leach protocol.


2016 ◽  
Vol 13 (1) ◽  
pp. 116
Author(s):  
Wan Isni Sofiah Wan Din ◽  
Saadiah Yahya ◽  
Mohd Nasir Taib ◽  
Ahmad Ihsan Mohd Yassin ◽  
Razulaimi Razali

Clustering in Wireless Sensor Network (WSN) is one of the methods to minimize the energy usage of sensor network. The design of sensor network itself can prolong the lifetime of network. Cluster head in each cluster is an important part in clustering to ensure the lifetime of each sensor node can be preserved as it acts as an intermediary node between the other sensors. Sensor nodes have the limitation of its battery where the battery is impossible to be replaced once it has been deployed. Thus, this paper presents an improvement of clustering algorithm for two-tier network as we named it as Multi-Tier Algorithm (MAP). For the cluster head selection, fuzzy logic approach has been used which it can minimize the energy usage of sensor nodes hence maximize the network lifetime. MAP clustering approach used in this paper covers the average of 100Mx100M network and involves three parameters that worked together in order to select the cluster head which are residual energy, communication cost and centrality. It is concluded that, MAP dominant the lifetime of WSN compared to LEACH and SEP protocols. For the future work, the stability of this algorithm can be verified in detailed via different data and energy. 


Author(s):  
Yakubu Abdul-Wahab Nawusu ◽  
Alhassan Abdul-Barik ◽  
Salifu Abdul-Mumin

Extending the lifetime of a wireless sensor network is vital in ensuring continuous monitoring functions in a target environment. Many techniques have appeared that seek to achieve such prolonged sensing gains. Clustering and improved selection of cluster heads play essential roles in the performance of sensor network functions. Cluster head in a hierarchical arrangement is responsible for transmitting aggregated data from member nodes to a base station for further user-specific data processing and analysis. Minimising the quick dissipation of cluster heads energy requires a careful choice of network factors when selecting a cluster head to prolong the lifetime of a wireless sensor network. In this work, we propose a multi-criteria cluster head selection technique to extend the sensing lifetime of a heterogeneous wireless sensor network. The proposed protocol incorporates residual energy, distance, and node density in selecting a cluster head. Each factor is assigned a weight using the Rank Order Centroid based on its relative importance. Several simulation tests using MATLAB 7.5.0 (R2007b) reveal improved network lifetime and other network performance indicators, including stability and throughput, compared with popular protocols such as LEACH and the SEP. The proposed scheme will be beneficial in applications requiring reliable and stable data sensing and transmission functions.


2017 ◽  
Vol 16 (7) ◽  
pp. 7031-7039
Author(s):  
Chamanpreet Kaur ◽  
Vikramjit Singh

Wireless sensor network has revolutionized the way computing and software services are delivered to the clients on demand. Our research work proposed a new method for cluster head selection having less computational complexity. It was also found that the modified approach has improved performance to that of the other clustering approaches. The cluster head election mechanism will include various parameters like maximum residual energy of a node, minimum separation distance and minimum distance to the mobile node. Each CH will create a TDMA schedule for the member nodes to transmit the data. Nodes will have various level of power for signal amplification. The three levels of power are used for amplifying the signal. As the member node will send only its own data to the cluster head, the power level of the member node is set to low. The cluster head will send the data of the whole cluster to the mobile node, therefore the power level of the cluster head is set to medium. High power level is used for mobile node which will send the data of the complete sector to the base station. Using low energy level for intra cluster transmissions (within the cluster) with respect to cluster head to mobile node transmission leads in saving much amount of energy. Moreover, multi-power levels also reduce the packet drop ratio, collisions and/ or interference for other signals. It was found that the proposed algorithm gives a much improved network lifetime as compared to existing work. Based on our model, multiple experiments have been conducted using different values of initial energy.


2020 ◽  
Author(s):  
Hamid Reza Farahzadi ◽  
Mostafa Langarizadeh ◽  
Mohammad Mirhosseini ◽  
Seyed Ali Fatemi Aghda

AbstractWireless sensor network has special features and many applications, which have attracted attention of many scientists. High energy consumption of these networks, as a drawback, can be reduced by a hierarchical routing algorithm. The proposed algorithm is based on the Low Energy Adaptive Clustering Hierarchy (LEACH) and Quadrant Cluster based LEACH (Q-LEACH) protocols. To reduce energy consumption and provide a more appropriate coverage, the network was divided into several regions and clusters were formed within each region. In selecting the cluster head (CH) in each round, the amount of residual energy and the distance from the center of each node were calculated by the base station (including the location and residual energy of each node) for all living nodes in each region. In this regard, the node with the largest value had the highest priority to be selected as the CH in each network region. The base station calculates the CH due to the lack of energy constraints and is also responsible for informing it throughout the network, which reduces the load consumption and tasks of nodes in the network. The information transfer steps in this protocol are similar to the LEACH protocol stages. To better evaluate the results, the proposed method was implemented with LEACH LEACH-SWDN, and Q-LEACH protocols using MATLAB software. The results showed better performance of the proposed method in network lifetime, first node death time, and the last node death time.


2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Zuo Chen ◽  
Min He ◽  
Wei Liang ◽  
Kai Chen

Wireless sensor network (WSN) is a kind of distributed and self-organizing networks, in which the sensor nodes have limited communication bandwidth, memory, and limited energy. The topology construction of this network is usually vulnerable when attacked by malicious nodes. Besides, excessive energy consumption is a problem that can not be ignored. Therefore, this paper proposes a secure topology protocol of WSN which is trust-aware and of low energy consumption, called TLES. The TLES considers the trust value as an important factor affecting the behavior of node. In detail, the TLES would take trust value, residual energy of the nodes, and node density into consideration when selecting cluster head nodes. Then, TLES constructs these cluster head nodes by choosing the next hop node according to distance to base station (BS), nodes’ degrees, and residual energy, so as to establish a safe, reliable, and energy saving network. Experimental results show that the algorithm can effectively isolate the malicious node in the network and reduce the consumption of energy of the whole network.


2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Tapan Kumar Jain ◽  
Davinder Singh Saini ◽  
Sunil Vidya Bhooshan

The research work proposes a cluster head selection algorithm for a wireless sensor network. A node can be a cluster head if it is connected to at least one unique neighbor node where the unique neighbor is the one that is not connected to any other node. If there is no connected unique node then the CH is selected on the basis of residual energy and the number of neighbor nodes. With the increase in number of clusters, the processing energy of the network increases; hence, this algorithm proposes minimum number of clusters which further leads to increased network lifetime. The major novel contribution of the proposed work is an algorithm that ensures a completely connected network with minimum number of isolated nodes. An isolated node will remain only if it is not within the transmission range of any other node. With the maximum connectivity, the coverage of the network is automatically maximized. The superiority of the proposed design is verified by simulation results done in MATLAB, where it clearly depicts that the total numbers of rounds before the network dies out are maximum compared to other existing protocols.


Sign in / Sign up

Export Citation Format

Share Document