An Efficient Fitness Function for Clustering of Wireless Sensor Networks

2020 ◽  
Vol 10 (3) ◽  
pp. 318-324
Author(s):  
Atiieh Hoseinpour ◽  
Mojtaba Jafari Lahijani ◽  
Mohammad Hosseinpour ◽  
Javad Kazemitabar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fitness Function ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Evolutionary Clustering ◽  
Fitness Functions ◽  
Field Sensor ◽  
Simulation Results ◽  
And Control

Background & Objective: A sensor network is composed of a large number of sensor nodes that are deployed to perform measurement and/or command and control in a field. Sensor nodes are battery powered devices and replacement or recharging of their batteries may not be feasible. One of the major challenges with sensory wireless networks is excessive energy consumption in nodes. Clustering is one of the methods that has been offered for resolving this issue. In this paper, we pursue evolutionary clustering and propose a new fitness function that har-nesses multiple propagation indices. Methods: In this paper we develop an efficient fitness function by first selecting the best clusters, and then selecting the best attribution of cluster to clusters. The distance between the nodes and relevant cluster heads was used for the mathematical modelling necessary. In the end we develop the fitness function equation by using normalization of the raw data. Results: Simulation results show improvement compared to previous fitness functions in clustering of the wireless sensor networks.

An Improved Sensor Positioning for Wireless Sensor Networks

2014 ◽  
Vol 716-717 ◽  
pp. 1322-1325
Author(s):  
Jin Tao Lin ◽  
Guang Yu Fan ◽  
Wen Hong Liu ◽  
Ying Da Hu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Signal Strength ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Positioning Accuracy ◽  
Positioning Method ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Sensor Positioning

Sensor positioning is a fundamental block in various location-dependent applications of wireless sensor networks. In order to improve the positioning accuracy without increasing the complex and cost of sensor nodes, an improve sensor positioning method is proposed for wireless sensor networks. In the method, after receiving the broadcasting message of the neighboring anchor nodes, the sensor nodes calculate a modifying factor of the change of the signal strength. And they modify the distances between themselves and neighboring anchor nodes with the modifying factor. Simulation results show that the proposed method can obtain a high positioning accuracy.

Localization in Wireless Sensor Networks in Beacon Drifting Scenarios

2012 ◽  
Vol 562-564 ◽  
pp. 1234-1239
Author(s):  
Ming Xia ◽  
Qing Zhang Chen ◽  
Yan Jin
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Probability Density ◽  
Sensor Nodes ◽  
Density Model ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Scenarios Simulation ◽  
Simulation Results

The beacon drifting problem occurs when the beacon nodes move accidentally after deployment. In this occasion, the localization results of sensor nodes in the network will be greatly affected and become inaccurate. In this paper, we present a localization algorithm in wireless sensor networks in beacon drifting scenarios. The algorithm first uses a probability density model to calculate the location reliability of each node, and in localization it will dynamically choose nodes with highest location reliabilities as beacon nodes to improve localization accuracy in beacon drifting scenarios. Simulation results show that the proposed algorithm achieves its design goals.

scholarly journals An Adaptive Approach to Discriminate the Persistence of Faults in Wireless Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Arunanshu Mahapatro ◽  
Pabitra Mohan Khilar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Detection ◽  
Detection Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Transient Fault ◽  
Intermittent Faults ◽  
Parametric Fault ◽  
Simulation Results

This paper presents a parametric fault detection algorithm which can discriminate the persistence (permanent, intermittent, and transient) of faults in wireless sensor networks. The main characteristics of these faults are the amount the fault appears. We adopt this state-holding time to discriminate transient from intermittent faults. Neighbor-coordination-based approach is adopted, where faulty sensor nodes are detected based on comparisons between neighboring nodes and dissemination of the decision made at each node. Simulation results demonstrate the robustness of the work at varying transient fault rate.

scholarly journals SALP Swarm Optimization Approach for Maximization The Lifetime of Wireless Sensor Network

2021 ◽  
Vol 1 (2) ◽  
pp. 16-20
Author(s):  
Mohammed M. Ahmed*
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Minimum Spanning Tree ◽  
Fitness Function ◽  
Shortest Paths ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Optimization Approach ◽  
Sink Node ◽  
Swarm Optimization

In recent years, the maximization of a lifetime for wireless sensor networks is considered an important area for researchers. The wireless sensor networks (WSNs) contain two types of sensors that called sensor nodes and sink nodes which sensor node send information to the central node (sink node) that collected its data. Choosing the best location of sink node considered the critical problem that faces the lifetime of wireless sensor networks. In this paper, we propose a method that choosing best location of a sink node by applying Salp Swarm Algorithm (SSA) after determining sink node location we create transmission paths between the sink node and rest of nodes using Prim's minimum spanning tree to choose shortest paths. Accordingly, for fitness function that used to decrease energy consumption for a network. Simulation results clarify that our proposed algorithm that solves localization of sink node presents the best results for prolonging the network's lifetime compared to Cat Swarm Optimization algorithm (CSA) and Particle Swarm Optimization (PSO).

scholarly journals Energy-Efficient QoS-Aware Intelligent Hybrid Clustered Routing Protocol for Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-12
Author(s):  
Parvinder Singh ◽  
Rajeshwar Singh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Large Scale ◽  
Fitness Function ◽  
Geographical Area ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor

A wireless sensor network consists of numerous low-power microsensor devices that can be deployed in a geographical area for remote sensing, surveillance, control, and monitoring applications. The advancements of wireless devices in terms of user-friendly interface, size, and deployment cost have given rise to many smart applications of wireless sensor networks (WSNs). However, certain issues like energy efficiency, long lifetime, and communication reliability restrict their large scale utilization. In WSNs, the cluster-based routing protocols assist nodes to collect, aggregate, and forward sensed data from event regions towards the sink node through minimum cost links. A clustering method helps to improve data transmission efficiency by dividing the sensor nodes into small groups. However, improper cluster head (CH) selection may affect the network lifetime, average network energy, and other quality of service (QoS) parameters. In this paper, a multiobjective clustering strategy is proposed to optimize the energy consumption, network lifetime, network throughput, and network delay. A fitness function has been formulated for heterogenous and homogenous wireless sensor networks. This fitness function is utilized to select an optimum CH for energy minimization and load balancing of cluster heads. A new hybrid clustered routing protocol is proposed based on fitness function. The simulation results conclude that the proposed protocol achieves better efficiency in increasing the network lifetime by 63%, 26%, and 10% compared with three well-known heterogeneous protocols: DEEC, EDDEEC, and ATEER, respectively. The proposed strategy also attains better network stability than a homogenous LEACH protocol.

Performance of Wireless Sensor Networks for Different Mobile Event Path Scenarios

2012 ◽  
pp. 55-68
Author(s):  
Tao Yang ◽  
Gjergji Mino ◽  
Leonard Barolli ◽  
Makoto Ikeda ◽  
Fatos Xhafa ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Energy Characteristic ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Movement Path ◽  
Random Movement ◽  
Simulation Results

In this paper, the authors investigate how the sensor network performs when the event moves with special movement path. Simulation results are compared with four scenarios: when the event is stationary, moving randomly, moving with simple 4 path, and boids path. The simulation results show that for the case when the event is moving randomly, the performance is the worst in the four scenarios. The characteristic of goodput decreases with the increase of number of sensor nodes. In the case of the boids model, the goodput is unstable when the is lower than 10 pps. The consumed energy characteristic increases with the increase of Simulation results show that the consumed energy of random movement is the worst among the four scenarios. The consumed energy of boids model is the lowest in four cases. This shows that the event movement with boids model can decrease the consumed energy in large scale WSNs.

Trust Aware Moth Flame Optimization based Secure Clustering for Wireless Sensor Networks

2019 ◽  
pp. 54-64
Author(s):  
Abdul Rahaman Wahab Sait ◽  
◽  
M. Ilayaraja ◽  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Selection Process ◽  
Fitness Function ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Channel ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Trust Level

Wireless sensor networks (WSN) encompass numerous sensor nodes deployed in the physical environment to sense parameters and transmit to the base station (BS). Since the nodes in WSN communicate via a wireless channel, security remains a significant issue that needs to be resolved. The choice of cluster heads (CHs) is critical to achieving secure data transmission in WSN. In this aspect, this article presents a novel trust-aware mothflame optimization-based secure clustering (TAMFO-SC) technique for WSN. The goal of the TAMFO-SC technique is to determine the trust level of the nodes and determine the secure CHs. The proposed TAMFO-SC technique initially determines the nodes' trust level, and the node with maximum trust factor can be chosen as CHs. In addition, the TAMFO-SC technique derives a fitness function using two parameters, namely residual energy and trust level. The inclusion of trust level in the CH selection process helps to accomplish security in WSN. A comprehensive experimental analysis exhibits the promising performance of the TAMFO-SC technique over the other compared methods.

Braided Routing Technique to Balance Traffic Load in Wireless Sensor Networks

2020 ◽  
pp. 837-855
Author(s):  
Apostolos Demertzis ◽  
Konstantinos Oikonomou
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Local Variation ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Energy Hole ◽  
Local Variance ◽  
Routing Mechanism ◽  
Simulation Results

Many-to-one wireless sensor networks suffer from an extreme variation of traffic load between nodes. Sensor nodes near the sink consume much more energy than distant ones, resulting in the energy hole problem (global variation of load). In addition, even nodes located at the same distance from the sink experience very different traffic load with each other (local variation). This uneven distribution of traffic load, both globally and locally, results in a severe shortening of the time until first node runs out of battery. This work focuses on balancing the load of equally-distant nodes from the sink by sharing each one's load among its next-hop neighbors. Eventually, packets are travelling from node to sink by following interlaced paths. The proposed routing mechanism, called braided routing, is a simple one and can be applied over any cost-based routing, incurring a negligible overhead. Simulation results show that the local variance of load is reduced nearly 20-60% on average while the time until first death can be prolonged more than twice in many cases and the lifetime about 15%.

scholarly journals The Management of Indoor Thermal Comfort with Wireless Sensor Networks

2017 ◽  
Vol 50 (9-10) ◽  
pp. 206-213 ◽  
Author(s):  
Sinan Uguz ◽  
Osman Ipek
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Environmental Factors ◽  
Thermal Comfort ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Space Heating ◽  
Monitoring And Control ◽  
Comfort Index ◽  
And Control

In this study, real-time monitoring and control platform based on thermal comfort was developed to control space heating in living spaces. To calculate the thermal comfort level in a living space, environmental factors such as indoor air temperature, mean radiant temperature, air velocity, and humidity are needed. In order to obtain the environmental factors, sensor nodes based on wireless sensor networks were developed. According to the data obtained from the sensor nodes, the thermal comfort index was calculated, and radiators used for space heating were controlled via monitoring and control software based on PC. Furthermore, several experiments were performed between living spaces where real-time monitoring and control platform was installed and living spaces heated with conventional methods. The measurements were carried out in four rooms at the Faculty of Technology of Suleyman Demirel University in Turkey during the winter season. The heat transferred from room radiators by creating proper conditions that can change the thermal comfort index was compared in the experiments. During experimental measurements, it was observed that the heat transferred to the environment through the room radiators reduced significantly, especially with closed doors and windows.

Performance of Wireless Sensor Networks for Different Mobile Event Path Scenarios

2011 ◽  
Vol 2 (3) ◽  
pp. 49-63 ◽  
Author(s):  
Tao Yang ◽  
Gjergji Mino ◽  
Leonard Barolli ◽  
Makoto Ikeda ◽  
Fatos Xhafa ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Energy Characteristic ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Movement Path ◽  
Random Movement ◽  
Simulation Results

In this paper, the authors investigate how the sensor network performs when the event moves with special movement path. Simulation results are compared with four scenarios: when the event is stationary, moving randomly, moving with simple 4 path, and boids path. The simulation results show that for the case when the event is moving randomly, the performance is the worst in the four scenarios. The characteristic of goodput decreases with the increase of number of sensor nodes. In the case of the boids model, the goodput is unstable when the is lower than 10 pps. The consumed energy characteristic increases with the increase of . Simulation results show that the consumed energy of random movement is the worst among the four scenarios. The consumed energy of boids model is the lowest in four cases. This shows that the event movement with boids model can decrease the consumed energy in large scale WSNs.

Sign in / Sign up

Export Citation Format

Share Document