scholarly journals Optimization of Cluster Heads Selection by Imperialist Competitive Algorithm in Wireless Sensor Networks

2014 ◽  
Vol 89 (19) ◽  
pp. 29-34 ◽  
Author(s):  
Marjan Maadi ◽  
Masoureh Maadi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Imperialist Competitive Algorithm ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Competitive Algorithm

Solving the k-Coverage and m-Connected Problem in Wireless Sensor Networks through the Imperialist Competitive Algorithm

2020 ◽  
Vol 20 (01) ◽  
pp. 2050002
Author(s):  
HEMMAT SHEIKHI ◽  
WAFA BARKHODA
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Mathematical Formulation ◽  
Imperialist Competitive Algorithm ◽  
Wireless Sensor ◽  
Placement Problem ◽  
Competitive Algorithm ◽  
Np Hard Problem ◽  
Node Count

This study presents a new method based on the imperialist competitive algorithm (ICA-based) to solve the k-coverage and m-connected problem in wireless sensor networks (WSNs) through the least sensor node count, where the candidate positions for placing nodes are pre-specified. This dual featured problem in WSNs is a nondeterministic polynomial (NP)-hard problem therefore, ICA the social-inspired evolutionary algorithm is assessed and ICA-based scheme is designed to solve the problem. This newly proposed ICA-based scheme provides an efficient algorithm for representing the imperialistic competition among some of the best solutions to the problem in order to decrease the network cost. The mathematical formulation is presented for the node placement problem. The main issue of concern here is the deployed sensor node count. The simulation results confirm that ICA-based method can reduce the required sensor node count unlike other genetic-based and biogeography-based evolutionary algorithms. The experimental results are presented for WSN_Random and WSN_Grid scenarios.

scholarly journals Calculating the Number of Cluster Heads Based on the Rate-Distortion Function in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Mingxin Yang ◽  
Jingsha He ◽  
Yuqiang Zhang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Fusion ◽  
Rate Distortion ◽  
Distortion Function ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Wireless Sensor Nodes ◽  
Cluster Heads

Due to limited resources in wireless sensor nodes, energy efficiency is considered as one of the primary constraints in the design of the topology of wireless sensor networks (WSNs). Since data that are collected by wireless sensor nodes exhibit the characteristics of temporal association, data fusion has also become a very important means of reducing network traffic as well as eliminating data redundancy as far as data transmission is concerned. Another reason for data fusion is that, in many applications, only some of the data that are collected can meet the requirements of the sink node. In this paper, we propose a method to calculate the number of cluster heads or data aggregators during data fusion based on the rate-distortion function. In our discussion, we will first establish an energy consumption model and then describe a method for calculating the number of cluster heads from the point of view of reducing energy consumption. We will also show through theoretical analysis and experimentation that the network topology design based on the rate-distortion function is indeed more energy-efficient.

scholarly journals An Integrated Routing Mechanism on Homogenous Wireless Sensor Networks using Genetic Algorithm

2021 ◽  
Author(s):  
Ramin Danehchin
Keyword(s):  
Genetic Algorithm ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Collection ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Hop Count ◽  
Routing Problem ◽  
Cluster Heads

Abstract Data collection on Wireless Sensor Networks (WSNs) is a significant challenge to satisfy the requirements of various applications. Providing an energy-efficient routing technique is the primary step in data collection over WSNs. The existing data collection techniques in the WSNs field struggle with the imbalance load distribution and the short lifetime of the network. This paper proposes a novel mechanism to select cluster-heads, cluster the wireless sensor nodes, and determine the optimal route from source nodes to the sink. We employ the genetic algorithm to solve the routing problem considering the hop-count of the cluster-heads to the sink, the number of each cluster member, residual energy of cluster-heads, and the number of cluster-heads connected to the sink as the fitness criteria. Our proposed mechanism uses a greedy approach to calculate the hop-count of each cluster-head to the sink for integrating the clustering and routing process on WSNs. The simulation results demonstrate that our proposed mechanism improves the energy consumption, the number of live nodes, and the lifetime of the network compared to other data collection approaches on WSNs.

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.

Sign in / Sign up

Export Citation Format

Share Document