An optimal communication in WSN enabled by fuzzy clustering and improved meta-heuristic model

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Yerra Readdy Alekya Rani ◽  
Edara Sreenivasa Reddy
Keyword(s):  
Utility Function ◽  
Network Lifetime ◽  
Fuzzy Clustering ◽  
Heuristic Algorithm ◽  
Residual Energy ◽  
Content Type ◽  
Wsn Lifetime ◽  
Whale Optimization ◽  
Ch Selection ◽  
Communication Path

Purpose Wireless sensor networks (WSN) have been widely adopted for various applications due to their properties of pervasive computing. It is necessary to prolong the WSN lifetime; it avails its benefit for a long time. WSN lifetime may vary according to the applications, and in most cases, it is considered as the time to the death of the first node in the module. Clustering has been one of the successful strategies for increasing the effectiveness of the network, as it selects the appropriate cluster head (CH) for communication. However, most clustering protocols are based on probabilistic schemes, which may create two CH for a single cluster group, leading to cause more energy consumption. Hence, it is necessary to build up a clustering strategy with the improved properties for the CH selection. The purpose of this paper is to provide better convergence for large simulation space and to use it for optimizing the communication path of WSN. Design/methodology/approach This paper plans to develop a new clustering protocol in WSN using fuzzy clustering and an improved meta-heuristic algorithm. The fuzzy clustering approach is adopted for performing the clustering of nodes with respective fuzzy centroid by using the input constraints such as signal-to-interference-plus-noise ratio (SINR), load and residual energy, between the CHs and nodes. After the cluster formation, the combined utility function is used to refine the CH selection. The CH is determined based on computing the combined utility function, in which the node attaining the maximum combined utility function is selected as the CH. After the clustering and CH formation, the optimal communication between the CH and the nodes is induced by a new meta-heuristic algorithm called Fitness updated Crow Search Algorithm (FU-CSA). This optimal communication is accomplished by concerning a multi-objective function with constraints with residual energy and the distance between the nodes. Finally, the simulation results show that the proposed technique enhances the network lifetime and energy efficiency when compared to the state-of-the-art techniques. Findings The proposed Fuzzy+FU-CSA algorithm has achieved low-cost function values of 48% to Fuzzy+Particle Swarm Optimization (PSO), 60% to Fuzzy+Grey Wolf Optimizer (GWO), 40% to Fuzzy+Whale Optimization Algorithm (WOA) and 25% to Fuzzy+CSA, respectively. Thus, the results prove that the proposed Fuzzy+FU-CSA has the optimal performance than the other algorithms, and thus provides a high network lifetime and energy. Originality/value For the efficient clustering and the CH selection, a combined utility function was developed by using the network parameters such as energy, load, SINR and distance. The fuzzy clustering uses the constraint inputs such as residual energy, load and SINR for clustering the nodes of WSN. This work had developed an FU-CSA algorithm for the selection of the optimal communication path for the WSN.

scholarly journals An Energy-Efficient and Fault-Tolerant Topology Control Game Algorithm for Wireless Sensor Network

Electronics ◽  
2019 ◽  
Vol 8 (9) ◽  
pp. 1009 ◽  
Author(s):  
Yongwen Du ◽  
Jinzong Xia ◽  
Junhui Gong ◽  
Xiaohui Hu
Keyword(s):  
Utility Function ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Topology Control ◽  
Resource Constraints ◽  
Fault Tolerant ◽  
Residual Energy ◽  
Wireless Sensor ◽  
Potential Game ◽  
Game Model

Due to resource constraints and severe conditions, wireless sensor networks should be self-adaptive to maintain certain desirable properties, such as energy efficiency and fault tolerance. In this paper, we design a practical utility function that can effectively balance transmit power, residual energy, and network connectivity, and then we investigate a topology control game model based on non-cooperative game theory. The theoretical analysis shows that the topology game model is a potential game and can converge to a state of the Nash equilibrium. Based on this model, an energy-efficient and fault-tolerant topology control game algorithm, EFTCG, is proposed to adaptively constructs a network topology. In turn, we present two subalgorithms: EFTCG-1 and EFTCG-2. The former just guarantees network single connectivity, but the latter can guarantee network biconnectivity. We evaluate the energy-efficient effect of EFTCG-1. Meanwhile, we also analyze the fault-tolerant performance of EFTCG-2. The simulation results verify the validity of the utility function. EFTCG-1 can efficiently prolong the network lifetime compared with other game-based algorithms, and EFTCG-2 performs better in robustness, although does not significantly reduce the network lifetime.

Distributed Entropy Energy-Efficient Clustering algorithm for cluster head selection (DEEEC)

2020 ◽  
Vol 39 (6) ◽  
pp. 8139-8147
Author(s):  
Ranganathan Arun ◽  
Rangaswamy Balamurugan
Keyword(s):  
Energy Efficient ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Second Stage ◽  
Energy Efficient Clustering ◽  
Two Stages ◽  
Ch Selection

In Wireless Sensor Networks (WSN) the energy of Sensor nodes is not certainly sufficient. In order to optimize the endurance of WSN, it is essential to minimize the utilization of energy. Head of group or Cluster Head (CH) is an eminent method to develop the endurance of WSN that aggregates the WSN with higher energy. CH for intra-cluster and inter-cluster communication becomes dependent. For complete, in WSN, the Energy level of CH extends its life of cluster. While evolving cluster algorithms, the complicated job is to identify the energy utilization amount of heterogeneous WSNs. Based on Chaotic Firefly Algorithm CH (CFACH) selection, the formulated work is named “Novel Distributed Entropy Energy-Efficient Clustering Algorithm”, in short, DEEEC for HWSNs. The formulated DEEEC Algorithm, which is a CH, has two main stages. In the first stage, the identification of temporary CHs along with its entropy value is found using the correlative measure of residual and original energy. Along with this, in the clustering algorithm, the rotating epoch and its entropy value must be predicted automatically by its sensor nodes. In the second stage, if any member in the cluster having larger residual energy, shall modify the temporary CHs in the direction of the deciding set. The target of the nodes with large energy has the probability to be CHs which is determined by the above two stages meant for CH selection. The MATLAB is required to simulate the DEEEC Algorithm. The simulated results of the formulated DEEEC Algorithm produce good results with respect to the energy and increased lifetime when it is correlated with the current traditional clustering protocols being used in the Heterogeneous WSNs.

The value of sociality

foresight ◽  
2014 ◽  
Vol 16 (4) ◽  
pp. 309-328 ◽  
Author(s):  
Evgeniya Lukinova ◽  
Mikhail Myagkov ◽  
Pavel Shishkin
Keyword(s):  
Decision Making ◽  
Utility Function ◽  
Social Relationship ◽  
Social Utility ◽  
Content Type ◽  
Individual Level ◽  
Know How ◽  
General Utility ◽  
The Social ◽  
Individual Decisions

Purpose – This paper aims to study the value of sociality. Recent experimental evidence has brought to light that the assumptions of the Prospect Theory by Kahneman and Tversky do not hold in the proposed substantive domain of “sociality”. In particular, the desire to be a part of the social environment, i.e. the environment where individuals make decisions among their peers, is not contingent on the framing. Evolutionary psychologists suggest that humans are “social animals” for adaptive reasons. However, entering a social relationship is inherently risky. Therefore, it is extremely important to know how much people value “sociality”, when the social outcomes are valued more than material outcomes and what kinds of adaptations people use. Design/methodology/approach – We develop a new theory and propose the general utility function that features “sociality” component. We test the theory in the laboratory experiments carried out in several countries. Findings – Our results suggest that when stakes are low the theory of “sociality” is successful in predicting individual decisions: on average, people do value “sociality” and it surpasses the monetary loss. Originality/value – The main contribution of this paper is the breakdown of the risk attitudes under low stakes and individual level of decision-making. Another advancement is the ability to formalize the social utility or the theory of “sociality” in an economic model; we use general utility function that we define both on the outcomes and on the process of the decision-making itself and test in laboratory studies.

Preventive maintenance scheduling using analysis of variance-based ant lion optimizer

2018 ◽  
Vol 15 (2) ◽  
pp. 254-272 ◽  
Author(s):  
Umamaheswari Elango ◽  
Ganesan Sivarajan ◽  
Abirami Manoharan ◽  
Subramanian Srikrishna
Keyword(s):  
Analysis Of Variance ◽  
Heuristic Algorithm ◽  
Heuristic Algorithms ◽  
Statistical Tests ◽  
Population Based ◽  
Maintenance Scheduling ◽  
Content Type ◽  
Ant Lion Optimizer ◽  
Ant Lion ◽  
Selection Of

Purpose Generator maintenance scheduling (GMS) is an essential task for electric power utilities as the periodical maintenance activity enhances the lifetime and also ensures the reliable and continuous operation of generating units. Though numerous meta-heuristic algorithms have been reported for the GMS solution, enhancing the existing techniques or developing new optimization procedure is still an interesting research task. The meta-heuristic algorithms are population based and the selection of their algorithmic parameters influences the quality of the solution. This paper aims to propose statistical tests guided meta-heuristic algorithm for solving the GMS problems. Design/methodology/approach The intricacy characteristics of the GMS problem in power systems necessitate an efficient and robust optimization tool. Though several meta-heuristic algorithms have been applied to solve the chosen power system operational problem, tuning of their control parameters is a protracting process. To prevail over the previously mentioned drawback, the modern meta-heuristic algorithm, namely, ant lion optimizer (ALO), is chosen as the optimization tool for solving the GMS problem. Findings The meta-heuristic algorithms are population based and require proper selection of algorithmic parameters. In this work, the ANOVA (analysis of variance) tool is proposed for selecting the most feasible decisive parameters in algorithm domain, and the statistical tests-based validation of solution quality is described. The parametric and non-parametric statistical tests are also performed to validate the selection of ALO against the various competing algorithms. The numerical and statistical results confirm that ALO is a promising tool for solving the GMS problems. Originality/value As a first attempt, ALO is applied to solve the GMS problem. Moreover, the ANOVA-based parameter selection is proposed and the statistical tests such as Wilcoxon signed rank and one-way ANOVA are conducted to validate the applicability of the intended optimization tool. The contribution of the paper can be summarized in two folds: the ANOVA-based ALO for GMS applications and statistical tests-based performance evaluation of intended algorithm.

Prolonging network lifetime and optimizing energy consumption using swarm optimization in mobile wireless sensor networks

Sensor Review ◽  
2018 ◽  
Vol 38 (4) ◽  
pp. 534-541
Author(s):  
Sangeetha M. ◽  
Sabari A.
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Mobile Wireless ◽  
Swarm Optimization ◽  
Content Type ◽  
Mobile Wireless Sensor ◽  
Practical Implications

Purpose This paper aims to provide prolonging network lifetime and optimizing energy consumption in mobile wireless sensor networks (MWSNs). Forming clusters of mobile nodes is a great task owing to their dynamic nature. Such clustering has to be performed with a higher consumption of energy. Perhaps sensor nodes might be supplied with batteries that cannot be recharged or replaced while in the field of operation. One optimistic approach to handle the issue of energy consumption is an efficient way of cluster organization using the particle swarm optimization (PSO) technique. Design/methodology/approach In this paper two improved versions of centralized PSO, namely, unequal clustering PSO (UC-PSO) and hybrid K-means clustering PSO (KC-PSO), are proposed, with a focus of achieving various aspects of clustering parameters such as energy consumption, network lifetime and packet delivery ratio to achieve energy-efficient and reliable communication in MWSNs. Findings Theoretical analysis and simulation results show that improved PSO algorithms provide a balanced energy consumption among the cluster heads and increase the network lifetime effectively. Research limitations/implications In this work, each sensor node transmits and receives packets at same energy level only. In this work, focus was on centralized clustering only. Practical implications To validate the proposed swarm optimization algorithm, a simulation-based performance analysis has been carried out using NS-2. In each scenario, a given number of sensors are randomly deployed and performed in a monitored area. In this work, simulations were carried out in a 100 × 100 m2 network consisting 200 nodes by using a network simulator under various parameters. The coordinate of base station is assumed to be 50 × 175. The energy consumption due to communication is calculated using the first-order radio model. It is considered that all nodes have batteries with initial energy of 2 J, and the sensing range is fixed at 20 m. The transmission range of each node is up to 25 m and node mobility is set to 10 m/s. Practical implications This proposed work utilizes the swarm behaviors and targets the improvement of mobile nodes’ lifetime and energy consumption. Originality/value PSO algorithms have been implemented for dynamic sensor nodes, which optimize the clustering and CH selection in MWSNs. A new fitness function is evaluated to improve the network lifetime, energy consumption, cluster formation, packet transmissions and cluster head selection.

Enhanced GAF protocol based on graph theory to optimize energy efficiency and lifetime in WSN technology

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Aznaoui Hanane ◽  
Arif Ullah ◽  
Said Raghay
Keyword(s):  
Energy Efficiency ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Optimal Path ◽  
Sensor Nodes ◽  
Sleep State ◽  
Single Node ◽  
Content Type ◽  
Area Of Interest ◽  
Entire Network

PurposeThe purpose of this paper is to design an enhanced routing protocol to minimize energy consumed and extend network lifetime in sensor network (WSN).Design/methodology/approachWith the use of appropriate routing protocols, data collected by sensor nodes reache the BS. The entire network lifetime can be extended well beyond that of its single nodes by putting the nodes in sleep state when they are not in use, and make active just a single node at a time within a given area of interest. So that, the lowest-cost routing arises by minimizing the communication cost. This paper proposes an enhanced adaptive geographic fidelity (E-GAF) routing protocol based on theory of graphs approach to improve the discovery phase, select the optimal path, reduce the energy used by nodes and therefore extend the network lifetime. Following the simulations established by varying the number of grids and tests, a comparison is made between the E-GAF and basic GAF (B-GAF) based on the number of dead nodes and energy consumption.FindingsThe results obtained show that E-GAF is better than the existing basic GAF protocol in terms of energy efficiency and network lifetime.Originality/valueThis paper adopts the latest optimization algorithm know as E-GAF, which is used to solve the problem of energy and improve the network lifetime in a WSN. This is the first work that utilizes network lifetime in WSN.

Sailfish optimizer algorithm (SFO) for optimized clustering in wireless sensor network (WSN)

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Battina Srinuvasu Kumar ◽  
S.G. Santhi ◽  
S. Narayana
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Energy Efficient ◽  
Cluster Head ◽  
Cuckoo Search ◽  
Wireless Sensor ◽  
Content Type ◽  
Network Cluster ◽  
Ideal Situation ◽  
Ch Selection

Purpose Inspired optimization algorithms respond to numerous scientific and engineering difficulties based on its flexibility and simplicity. Such algorithms are valid for optimization difficulties devoid of structural alterations. Design/methodology/approach This paper presents a nature-inspired optimization algorithm, named Sailfish optimizer (SFO) stimulated using sailfish group. Monetary custom of energy is a dangerous problem on wireless sensor network (WSN). Findings Network cluster is an effective method of reducing node power consumption and increasing network life. An algorithm for selecting cluster head (CHs) based on enhanced cuckoo search was proposed. But this algorithm uses a novel encoding system and wellness work. It integrates a few problems. To overthrow this method many metaheuristic-based CH selection algorithms are presented. To avoid this problem, this paper proposed the SFO algorithm based energy-efficient CH selection of WSN. Originality/value The proposed SFO algorithm based energy-efficient algorithm is used for discovering the CHs ideal situation. The simulations under delay, delratio, drop, energy, network lifetime, overhead and throughput are carried out.

A review on optimization of antenna array by evolutionary optimization techniques

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
D.D. Devisasi Kala ◽  
D. Thiripura Sundari
Keyword(s):  
Antenna Array ◽  
Antenna Arrays ◽  
Optimization Algorithm ◽  
Firefly Algorithm ◽  
Side Lobe ◽  
Optimization Techniques ◽  
Swarm Optimization ◽  
Content Type ◽  
Gain Enhancement ◽  
Whale Optimization

PurposeOptimization involves changing the input parameters of a process that is experimented with different conditions to obtain the maximum or minimum result. Increasing interest is shown by antenna researchers in finding the optimum solution for designing complex antenna arrays which are possible by optimization techniques.Design/methodology/approachDesign of antenna array is a significant electro-magnetic problem of optimization in the current era. The philosophy of optimization is to find the best solution among several available alternatives. In an antenna array, energy is wasted due to side lobe levels which can be reduced by various optimization techniques. Currently, developing optimization techniques applicable for various types of antenna arrays is focused on by researchers.FindingsIn the paper, different optimization algorithms for reducing the side lobe level of the antenna array are presented. Specifically, genetic algorithm (GA), particle swarm optimization (PSO), ant colony optimization (ACO), cuckoo search algorithm (CSA), invasive weed optimization (IWO), whale optimization algorithm (WOA), fruitfly optimization algorithm (FOA), firefly algorithm (FA), cat swarm optimization (CSO), dragonfly algorithm (DA), enhanced firefly algorithm (EFA) and bat flower pollinator (BFP) are the most popular optimization techniques. Various metrics such as gain enhancement, reduction of side lobe, speed of convergence and the directivity of these algorithms are discussed. Faster convergence is provided by the GA which is used for genetic operator randomization. GA provides improved efficiency of computation with the extreme optimal result as well as outperforming other algorithms of optimization in finding the best solution.Originality/valueThe originality of the paper includes a study that reveals the usage of the different antennas and their importance in various applications.

A combined effective time series model based on clustering and whale optimization algorithm for forecasting smart meters electricity consumption

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Medhat Abd el Azem El Sayed Rostum ◽  
Hassan Mohamed Mahmoud Moustafa ◽  
Ibrahim El Sayed Ziedan ◽  
Amr Ahmed Zamel
Keyword(s):  
Optimization Algorithm ◽  
Prediction Accuracy ◽  
Electricity Consumption ◽  
Whale Optimization Algorithm ◽  
Computational Time ◽  
Smart Meters ◽  
Content Type ◽  
Individual Level ◽  
Consumption Values ◽  
Whale Optimization

Purpose The current challenge for forecasting smart meters electricity consumption lies in the uncertainty and volatility of load profiles. Moreover, forecasting the electricity consumption for all the meters requires an enormous amount of time. Most papers tend to avoid such complexity by forecasting the electricity consumption at an aggregated level. This paper aims to forecast the electricity consumption for all smart meters at an individual level. This paper, for the first time, takes into account the computational time for training and forecasting the electricity consumption of all the meters. Design/methodology/approach A novel hybrid autoregressive-statistical equations idea model with the help of clustering and whale optimization algorithm (ARSEI-WOA) is proposed in this paper to forecast the electricity consumption of all the meters with best performance in terms of computational time and prediction accuracy. Findings The proposed model was tested using realistic Irish smart meters energy data and its performance was compared with nine regression methods including: autoregressive integrated moving average, partial least squares regression, conditional inference tree, M5 rule-based model, k-nearest neighbor, multilayer perceptron, RandomForest, RPART and support vector regression. Results have proved that ARSEI-WOA is an efficient model that is able to achieve an accurate prediction with low computational time. Originality/value This paper presents a new hybrid ARSEI model to perform smart meters load forecasting at an individual level instead of an aggregated one. With the help of clustering technique, similar meters are grouped into a few clusters from which reduce the computational time of the training and forecasting process. In addition, WOA improves the prediction accuracy of each meter by finding an optimal factor between the average electricity consumption values of each cluster and the electricity consumption values for each one of its meters.

Sign in / Sign up

Export Citation Format

Share Document