scholarly journals Energy-Balanced Uneven Clustering Protocol Based on Regional Division for Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-11 ◽  
Author(s):  
Chao Sha ◽  
Tian-cheng Shen ◽  
Jin-yu Chen ◽  
Yao Zhang ◽  
Ru-chuan Wang
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Collection ◽  
Lower Layer ◽  
Outer Region ◽  
Base Station ◽  
Sensor Data ◽  
Clustering Protocol ◽  
Simulation Results ◽  
Inner Region

In view of the unbalanced energy consumption of traditional cluster-based sensor networks, this paper proposes a type of uneven clustering protocol in data collection. The network is divided into inner and outer regions according to the distance between nodes and the base station. The inner region is consisted of several layers and nodes in outer region are deployed in grids of different sizes. Sensor data is collected by nodes in outer region and then is be transmitted to the inner region. Nodes in the inner region do data fusion and forward data from the lower layer to the higher one. Simulation results show that, compared with MTP and CDFUD, the proposed algorithm performs well in balance of energy consumption and could effectively prolong the network lifetime.

scholarly journals EGCIR: Energy-Aware Graph Clustering and Intelligent Routing Using Supervised System in Wireless Sensor Networks

Energies ◽  
2020 ◽  
Vol 13 (16) ◽  
pp. 4072
Author(s):  
Tanzila Saba ◽  
Khalid Haseeb ◽  
Ikram Ud Din ◽  
Ahmad Almogren ◽  
Ayman Altameem ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Graph Clustering ◽  
Base Station ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Energy Aware ◽  
Intelligent Routing

In recent times, the field of wireless sensor networks (WSNs) has attained a growing popularity in observing the environment due to its dynamic factors. Sensor data are gathered and forwarded to the base station (BS) through a wireless transmission medium. The data from the BS is further distributed to end-users using the Internet for their post analysis and operations. However, all sensors except the BS have limited constraints in terms of memory, energy and computational resources that degrade the network performance concerning the network lifetime and trustworthy routing. Therefore, improving energy efficiency with reliable and secure transmissions is a valuable debate among researchers for critical applications based on low-powered sensor nodes. In addition, security plays a significant cause to achieve responsible communications among sensors due to their unfixed and variable infrastructures. Keeping in view the above-mentioned issues, this paper presents an energy-aware graph clustering and intelligent routing (EGCIR) using a supervised system for WSNs to balance the energy consumption and load distribution. Moreover, a secure and efficient key distribution in a hierarchy-based mechanism is adopted by the proposed solution to improve the network efficacy in terms of routes and links integrity. The experimental results demonstrated that the EGCIR protocol enhances the network throughput by an average of 14%, packet drop ratio by an average of 50%, energy consumption by an average of 13%, data latency by an average of 30.2% and data breaches by an average of 37.5% than other state-of-the-art protocols.

scholarly journals A Type of Annulus-Based Energy Balanced Data Collection Method in Wireless Rechargeable Sensor Networks

Sensors ◽  
2018 ◽  
Vol 18 (9) ◽  
pp. 3150 ◽  
Author(s):  
Chao Sha ◽  
Qin Liu ◽  
Si-Yi Song ◽  
Ru-Chuan Wang
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Data Collection ◽  
Large Scale ◽  
Energy Hole ◽  
Node Scheduling ◽  
Wireless Rechargeable Sensor Networks ◽  
Energy Consumption Optimization ◽  
Balance Energy ◽  
Simulation Results

With the increasing number of ubiquitous terminals and the continuous expansion of network scale, the problem of unbalanced energy consumption in sensor networks has become increasingly prominent in recent years. However, a node scheduling strategy or an energy consumption optimization algorithm may be not enough to meet the requirements of large-scale application. To address this problem a type of Annulus-based Energy Balanced Data Collection (AEBDC) method is proposed in this paper. The circular network is divided into several annular sectors of different sizes. Nodes in the same annulus-sector form a cluster. Based on this model, a multi-hop data forwarding strategy with the help of the candidate cluster headers is proposed to balance energy consumption during transmission and to avoid buffer overflow. Meanwhile, in each annulus, there is a Wireless Charging Vehicle (WCV) that is responsible for periodically recharging the cluster headers as well as the candidate cluster headers. By minimizing the recharging cost, the energy efficiency is enhanced. Simulation results show that AEBDC can not only alleviate the “energy hole problem” in sensor networks, but also effectively prolong the network lifetime.

A Study on the Implementation of Dynamic Routing Algorithm to Improve Efficiency for Wireless Sensor Networks

2013 ◽  
Vol 284-287 ◽  
pp. 2021-2026
Author(s):  
Won Hyuck Choi ◽  
Min Seok Jie
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Sensor Network ◽  
Dynamic Routing ◽  
Base Station ◽  
Sensor Nodes ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Routing Method

The development of wireless communication and electronic technology leads to wireless sensor networks in various fields. Wireless sensor networks can exchange the data that generated from near environment field observation between other sensor nodes. Generally, Wireless sensor networks consist of multi sensor nodes and one or more sink nodes The sensor sensing data that nodes detected transmit from sensor networks to base station and deliver to users through internet. However sensor networks are restricted in the aspects of communication, processing data and energy consumption. Because of the low capacity batteries with devices of sensor networks, it is important to increase the lifespan operation life of sensor nodes by using energy efficiently. In this kind of sensor nodes, the energy consumption for message sending and receiving is very important for the maintenance of sensor nodes. In the existing static routing method, it consumes more energy for the maintenance of sensor network than dynamic routing method because data transmits repeatedly when the sensor data begin to spread. In this study, based on the difference in the cycle of information gathering in accordance with the characteristic of the sensor in sensor network and the cycle of demands from the sink in accordance with the characteristic of application layer, dynamic routing of wireless sensor network is proposed which actively responds to its various needs.

scholarly journals Adaptive scheme to Control Power Aware for PDR in Wireless Sensor Networks

2016 ◽  
Vol 12 (11) ◽  
pp. 4507-4514
Author(s):  
R. Sivaranjini ◽  
S.Palanivel Rajan
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Collection ◽  
Cluster Head ◽  
Sensor Data ◽  
Wireless Sensor ◽  
Cluster Method ◽  
Prediction Scheme

Nowadays Wireless sensor networks playing vital role in all area. Which is used to sense the environmental monitoring, Temperature, Soil erosin etc. Low data delivery efficiency and high energy consumption are the inherent problems in Wireless Sensor Networks. Finding accurate data is more difficult and also it will leads to more expensive to collect all sensor readings. Clustering and prediction techniques, which exploit spatial and temporal correlation among the sensor data, provide opportunities for reducing the energy consumption of continuous sensor data collection and to achieve network energy efficiency and stability. So as we propose Dynamic scheme for energy consumption and data collection in wireless sensor networks by integrating adaptively enabling/disabling prediction scheme, sleep/awake method with dynamic scheme. Our framework is clustering based. A cluster head represents all sensor nodes within the region and collects data values from them. Our framework is general enough to incorporate many advanced features and we show how sleep/awake scheduling can be applied, which takes our framework approach to designing a practical dynamic algorithm for data aggregation, it avoids the need for rampant node-to-node propagation of aggregates, but rather it uses faster and more efficient cluster-to-cluster propagation. To the best of our knowledge, this is the first work adaptively enabling/disabling prediction scheme with dynamic scheme for clustering-based continuous data collection in sensor networks. When a cluster node fails because of energy depletion we need to choose alternative cluster head for that particular region. It will help to achieve less energy consumption. Our proposed models, analysis, and framework are validated via simulation and comparison with Static Cluster method in order to achieve better energy efficiency and PDR.

scholarly journals NEW CLUSTERING SCHEMES FOR WIRELESS SENSOR NETWORKS

2010 ◽  
Vol 11 (1) ◽  
pp. 51-69
Author(s):  
S. M. Mazinani ◽  
J. Chitizadeh ◽  
M. H. Yaghmaee ◽  
M. T. Honary ◽  
F. Tashtarian
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Clustering Algorithm ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Clustering Protocol

In this paper, two clustering algorithms are proposed. In the first one, we investigate a clustering protocol for single hop wireless sensor networks that employs a competitive scheme for cluster head selection. The proposed algorithm is named EECS-M that is a modified version to the well known protocol EECS where some of the nodes become volunteers to be cluster heads with an equal probability.  In the competition phase in contrast to EECS using a fixed competition range for any volunteer node, we assign a variable competition range to it that is related to its distance to base station. The volunteer nodes compete in their competition ranges and every one with more residual energy would become cluster head. In the second one, we develop a clustering protocol for single hop wireless sensor networks. In the proposed algorithm some of the nodes become volunteers to be cluster heads. We develop a time based competitive clustering algorithm that the advertising time is based on the volunteer node’s residual energy. We assign to every volunteer node a competition range that may be fixed or variable as a function of distance to BS. The volunteer nodes compete in their competition ranges and every one with more energy would become cluster head. In both proposed algorithms, our objective is to balance the energy consumption of the cluster heads all over the network. Simulation results show the more balanced energy consumption and longer lifetime.

Performance Analysis of RNC Clustering Protocol in Wireless Sensor Network

2019 ◽  
Vol 10 ◽  
Author(s):  
Piyush Rawat ◽  
Siddhartha Chauhan
Keyword(s):  
Energy Consumption ◽  
Network Performance ◽  
Energy Levels ◽  
Cluster Head ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Threshold Function ◽  
Efficient Manner ◽  
Clustering Protocol

Background and Objective: The functionalities of wireless sensor networks (WSN) are growing in various areas, so to handle the energy consumption of network in an efficient manner is a challenging task. The sensor nodes in the WSN are equipped with limited battery power, so there is a need to utilize the sensor power in an efficient way. The clustering of nodes in the network is one of the ways to handle the limited energy of nodes to enhance the lifetime of the network for its longer working without failure. Methods: The proposed approach is based on forming a cluster of various sensor nodes and then selecting a sensor as cluster head (CH). The heterogeneous sensor nodes are used in the proposed approach in which sensors are provided with different energy levels. The selection of an efficient node as CH can help in enhancing the network lifetime. The threshold function and random function are used for selecting the cluster head among various sensors for selecting the efficient node as CH. Various performance parameters such as network lifespan, packets transferred to the base station (BS) and energy consumption are used to perform the comparison between the proposed technique and previous approaches. Results and Discussion: To validate the working of the proposed technique the simulation is performed in MATLAB simulator. The proposed approach has enhanced the lifetime of the network as compared to the existing approaches. The proposed algorithm is compared with various existing techniques to measure its performance and effectiveness. The sensor nodes are randomly deployed in a 100m*100m area. Conclusion: The simulation results showed that the proposed technique has enhanced the lifespan of the network by utilizing the node’s energy in an efficient manner and reduced the consumption of energy for better network performance.

QoS Aware Multi-hop Multi-path Routing Approach in Wireless Sensor Networks

2019 ◽  
Vol 9 (1) ◽  
pp. 43-52
Author(s):  
Omkar Singh ◽  
Vinay Rishiwal
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Life Time ◽  
Base Station ◽  
Environmental Data ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
End To End

Background & Objective: Wireless Sensor Network (WSN) consist of huge number of tiny senor nodes. WSN collects environmental data and sends to the base station through multi-hop wireless communication. QoS is the salient aspect in wireless sensor networks that satisfies end-to-end QoS requirement on different parameters such as energy, network lifetime, packets delivery ratio and delay. Among them Energy consumption is the most important and challenging factor in WSN, since the senor nodes are made by battery reserved that tends towards life time of sensor networks. Methods: In this work an Improve-Energy Aware Multi-hop Multi-path Hierarchy (I-EAMMH) QoS based routing approach has been proposed and evaluated that reduces energy consumption and delivers data packets within time by selecting optimum cost path among discovered routes which extends network life time. Results and Conclusion: Simulation has been done in MATLAB on varying number of rounds 400- 2000 to checked the performance of proposed approach. I-EAMMH is compared with existing routing protocols namely EAMMH and LEACH and performs better in terms of end-to-end-delay, packet delivery ratio, as well as reduces the energy consumption 13%-19% and prolongs network lifetime 9%- 14%.

PERFORMANCE EVALUATION ANALYSIS OF WIRELESS SENSOR NETWORKS ROUTING PROTOCOLS IN SMART GRIDS

2016 ◽  
Vol 26 (1) ◽  
pp. 17
Author(s):  
Carlos Deyvinson Reges Bessa
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Smart Grids ◽  
Network Routing ◽  
Base Station ◽  
Wireless Sensor ◽  
Delay Jitter ◽  
La Red

ABSTRACTThis work aims to study which wireless sensor network routing protocol is more suitable for Smart Grids applications, through simulation of AODV protocols, AOMDV, DSDV and HTR in the NS2 simulation environment. Was simulated a network based on a residential area with 47 residences, with one node for each residence and one base station, located about 25m from the other nodes. Many parameters, such as packet loss, throughput, delay, jitter and energy consumption were tested.  The network was increased to 78 and 93 nodes in order to evaluate the behavior of the protocols in larger networks. The tests proved that the HTR is the routing protocol that has the best results in performance and second best in energy consumption. The DSDV had the worst performance according to the tests.Key words.- Smart grid, QoS analysis, Wireless sensor networks, Routing protocols.RESUMENEste trabajo tiene como objetivo estudiar el protocolo de enrutamiento de la red de sensores inalámbricos es más adecuado para aplicaciones de redes inteligentes, a través de la simulación de protocolos AODV, AOMDV, DSDV y HTR en el entorno de simulación NS2. Se simuló una red basada en una zona residencial con 47 residencias, con un nodo para cada residencia y una estación base, situada a unos 25 metros de los otros nodos. Muchos parámetros, tales como la pérdida de paquetes, rendimiento, retardo, jitter y el consumo de energía se probaron. La red se incrementó a 78 y 93 nodos con el fin de evaluar el comportamiento de los protocolos de redes más grandes. Las pruebas demostraron que el HTR es el protocolo de enrutamiento que tiene los mejores resultados en el rendimiento y el segundo mejor en el consumo de energía. El DSDV tuvo el peor desempeño de acuerdo a las pruebas.Palabras clave.- redes inteligentes, análisis de calidad de servicio, redes de sensores inalámbricas, protocolos de enrutamiento.

scholarly journals Energy-Efficient Packet Forwarding Scheme Based on Fuzzy Decision-Making in Underwater Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (13) ◽  
pp. 4368
Author(s):  
Jitander Kumar Pabani ◽  
Miguel-Ángel Luque-Nieto ◽  
Waheeduddin Hyder ◽  
Pablo Otero
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Efficient ◽  
Real Life ◽  
Base Station ◽  
Fuzzy Decision Making ◽  
Underwater Sensor Networks ◽  
Packet Forwarding ◽  
Node Number ◽  
The Impact

Underwater Wireless Sensor Networks (UWSNs) are subjected to a multitude of real-life challenges. Maintaining adequate power consumption is one of the critical ones, for obvious reasons. This includes proper energy consumption due to nodes close to and far from the sink node (gateway), which affect the overall energy efficiency of the system. These wireless sensors gather and route the data to the onshore base station through the gateway at the sea surface. However, finding an optimum and efficient path from the source node to the gateway is a challenging task. The common reasons for the loss of energy in existing routing protocols for underwater are (1) a node shut down due to battery drainage, (2) packet loss or packet collision which causes re-transmission and hence affects the performance of the system, and (3) inappropriate selection of sensor node for forwarding data. To address these issues, an energy efficient packet forwarding scheme using fuzzy logic is proposed in this work. The proposed protocol uses three metrics: number of hops to reach the gateway node, number of neighbors (in the transmission range of a node) and the distance (or its equivalent received signal strength indicator, RSSI) in a 3D UWSN architecture. In addition, the performance of the system is also tested with adaptive and non-adaptive transmission ranges and scalable number of nodes to see the impact on energy consumption and number of hops. Simulation results show that the proposed protocol performs better than other existing techniques or in terms of parameters used in this scheme.

Sign in / Sign up

Export Citation Format

Share Document