A STATIC-LEACH WSNs for Hazardous Materials Monitoring

2012 ◽  
Vol 463-464 ◽  
pp. 261-265
Author(s):  
Fei Hui ◽  
Xiao Le Wang ◽  
Xin Shi
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Low Cost ◽  
Hazardous Materials ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hazardous Materials Transportation ◽  
Adaptive Clustering

In this paper, hazardous materials transportation monitoring system is designed, implemented, and tested using Wireless Sensor Networks (WSNs). According to energy consumption and response time during clustering of Wireless Sensor Networks LEACH (Low Energy Adaptive Clustering Hierarchy) routing protocol, we proposed STATIC-LEACH routing protocol based on static clustering, it can effectively reduce energy consumption of the wireless sensor nodes and reduce network latency of cluster. With WSN and GSM/GPRS, low cost and easy deployment remote monitoring is possible without interfering with the operation of the transportation.

scholarly journals RBM: Region-Based Mobile Routing Protocol for Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Muhammad Fahad Mukhtar ◽  
Muhammad Shiraz ◽  
Qaisar Shaheen ◽  
Kamran Ahsan ◽  
Rizwan Akhtar ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Low Cost ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Key Technology ◽  
Adaptive Clustering ◽  
Normal Ranges

Wireless sensor networks (WSNs) are employed for different applications for the reason of small-sized and low-cost sensor nodes. However, several challenges that include a low powered battery of the sensor nodes restrict their functionality. Therefore, saving energy in the routing process to extend network life is a serious concern while deploying applications on WSN. To this end, the key technology is clustering, which helps maximize scalability and network lifecycle. Base station (BS) collects data, aggregates it, and extracts the required information. To obtain the maximum outcome, the lifetime of the network is maximized by the use of different techniques and protocols. Data transmissions consume most of the network energy, and the transmissions over normal ranges require less energy as compared to transmissions over long ranges. Moreover, the nodes closer to the BS deplete their energy faster as compared to distant nodes because of traffic overload. The proposed protocol is aimed at reducing energy consumption and increasing the network lifetime. For this purpose, the network is divided into two regions: region 1 closer to the BS communicating directly, whereas region 2 farther away from the BS having routing nodes to communicate with the BS. Routing nodes do not take part in sensing function but will only move in region 2 collecting data and forwarding it to BS. MATLAB is used as the simulation tool for evaluation, and the results are compared with the existing optimized region-based efficient routing (AORED) and low-energy adaptive clustering hierarchical protocol (LEACH) techniques. The comparison showed that energy conservation and lifetime increased by 15%, and throughput is increased by more than 5% approximately.

scholarly journals Energy-efficient hierarchical routing in wireless sensor networks based on Fog Computing

2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transmission ◽  
Energy Efficient ◽  
Fog Computing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Hierarchical Routing

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime

scholarly journals EFFICIENT ROUTING PROTOCOL ALGORITHM FOR WIRELESS SENSOR NETWORKS

2018 ◽  
Vol 44 (1) ◽  
pp. 11-17
Author(s):  
Sayed Seno ◽  
Doaa Abd Ali ◽  
Mohammed Mohammed
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Data Transfer ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Adaptive Clustering ◽  
Energy Consuming ◽  
Effective Transfer

Recently, different applications of wireless sensor networks (WSNs) in the industry fields using different data transfer protocols has been developed. As the energy of sensor nodes is limited, prolonging network lifetime in WSNs considered a significant occurrence. To develop network permanence, researchers had considered energy consuming in routing protocols of WSNs by using modified Low Energy Adaptive Clustering Hierarchy. This article presents a developed effective transfer protocols for autonomic WSNs. An efficient routing scheme for wireless sensor network regarded as significant components of electronic devices is proposed. An optimal election probability of a node to be cluster head has being presented. In addition, this article uses a Voronoi diagram, which decomposes the nodes into zone around each node. This diagram used in management architecture for WSNs.

scholarly journals Optimizing Energy Consumption in IoT-Based Scalable Wireless Sensor Networks

2021 ◽  
Vol 10 (4) ◽  
pp. 1-16
Author(s):  
Vinay Rishiwal ◽  
Preeti Yadav ◽  
Omkar Singh ◽  
B. G. Prasad
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Network Performance ◽  
Optimal Path ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Selection For

In recent era of IoT, energy ingesting by sensor nodes in Wireless Sensor Networks (WSN) is one of the key challenges. It is decisive to diminish energy ingesting due to restricted battery lifespan of sensor nodes, Objective of this research is to develop efficient routing protocol/algorithm in IoT based scenario to enhance network performance with QoS parameters. Therefore, keeping this objective in mind, a QoS based Optimized Energy Clustering Routing (QOECR) protocol for IoT based WSN is proposed and evaluated. QOECR discovers optimal path for sink node and provides better selection for sub-sink nodes. Simulation has been done in MATLAB to assess the performance of QOECR with pre-existing routing protocols. Simulation outcomes represent that QOECR reduces E2E delay 30%-35%, enhances throughput 25%-30%, minimizes energy consumption 35%-40%, minimizes packet loss 28%-32%, improves PDR and prolongs network lifetime 32%-38% than CBCCP, HCSM and ZEAL routing protocols.

scholarly journals A new hybrid architecture with an intersection-based coverage algorithm in wireless sensor networks

2014 ◽  
Vol 11 (3) ◽  
pp. 1017-1035 ◽  
Author(s):  
Young-Long Chen ◽  
Mu-Yen Chen ◽  
Fu-Kai Cheung ◽  
Yung-Chi Chang
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sleep Mode ◽  
Hybrid Architecture ◽  
Power Efficient ◽  
Adaptive Clustering ◽  
Average Distribution

Energy is limited in wireless sensor networks (WSNs) so that energy consumption is very important. In this paper, we propose a hybrid architecture based on power-efficient gathering in sensor information system (PEGASIS) and low-energy adaptive clustering hierarchy (LEACH). This architecture can achieve an average distribution of energy loads, and reduced energy consumption in transmission. To further extend the system lifetime, we combine the intersection-based coverage algorithm (IBCA) with LEACH architecture and the hybrid architecture to prolong the system lifetime that introducing sensor nodes to enter sleep mode when inactive. This step can save more energy consumption. Simulation results show that the performance of our proposed LEACH architecture with IBCA and the hybrid architecture with IBCA perform better than LEACH architecture with PBCA in terms of energy efficiency, surviving nodes and sensing areas.

scholarly journals Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks Based on Yellow Saddle Goatfish Algorithm

Mathematics ◽  
2020 ◽  
Vol 8 (9) ◽  
pp. 1515 ◽  
Author(s):  
Alma Rodríguez ◽  
Carolina Del-Valle-Soto ◽  
Ramiro Velázquez
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Cluster Structure ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Energy Efficient Clustering

The usage of wireless sensor devices in many applications, such as in the Internet of Things and monitoring in dangerous geographical spaces, has increased in recent years. However, sensor nodes have limited power, and battery replacement is not viable in most cases. Thus, energy savings in Wireless Sensor Networks (WSNs) is the primary concern in the design of efficient communication protocols. Therefore, a novel energy-efficient clustering routing protocol for WSNs based on Yellow Saddle Goatfish Algorithm (YSGA) is proposed. The protocol is intended to intensify the network lifetime by reducing energy consumption. The network considers a base station and a set of cluster heads in its cluster structure. The number of cluster heads and the selection of optimal cluster heads is determined by the YSGA algorithm, while sensor nodes are assigned to its nearest cluster head. The cluster structure of the network is reconfigured by YSGA to ensure an optimal distribution of cluster heads and reduce the transmission distance. Experiments show competitive results and demonstrate that the proposed routing protocol minimizes the energy consumption, improves the lifetime, and prolongs the stability period of the network in comparison with the stated of the art clustering routing protocols.

An Improvement Routing Protocol Based LEACH for Wireless Sensor Networks

2014 ◽  
Vol 614 ◽  
pp. 472-475 ◽  
Author(s):  
Jin Gang Cao
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Base Station ◽  
Optimal Number ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Number Of Clusters ◽  
Cluster Heads

Due to limited energy, computing ability, and memory of Wireless sensor Networks(WSN), routing issue is one of the key factors for WSN. LEACH is the first clustering routing protocol, which can efficiently reduce the energy consumption and prolong the lifetime of WSN, but it also has some disadvantage. This paper proposed an improvement based LEACH, called LEACH-T. According to different number of clusters, LEACH-T uses variable time slot for different clusters in steady-state phase, and single-hop or multi-hop to transmit data between cluster heads and Base Station. Also it considered residual energy of sensor nodes and the optimal number of clusters during selection of the cluster heads. The simulation results show that LEACH-T has better performance than LEACH for prolonging the lifetime and reducing the energy consumption.

A Clustering Protocol for Maximum Coverage in Large-Scale Wireless Sensor Networks

2015 ◽  
Vol 11 (2) ◽  
pp. 1-21 ◽  
Author(s):  
Wassim Jerbi ◽  
Abderrahmen Guermazi ◽  
Hafedh Trabelsi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Large Scale ◽  
Cluster Head ◽  
Low Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Basic Algorithm ◽  
Adaptive Clustering

The optimum use of coverage in wireless sensor networks (WSNs) is very important. The hierarchical routing protocol LEACH (Low Energy Adaptive Clustering Hierarchy) is referred to as the basic algorithm of distributed clustering protocols. LEACH allows clusters formation. Each cluster has a leader called Cluster Head (CH). The selection of CHs is made with a probabilistic calculation. It is supposed that each non-CH node join a cluster and becomes a cluster member. Nevertheless, some CHs can be concentrated in a specific part of the network. Thus several sensor nodes cannot reach any CH. As a result, the remaining part of the controlled field will not be covered; some sensor nodes will be outside the network. To solve this problem, the authors propose O-LEACH (Orphan Low Energy Adaptive Clustering Hierarchy), a routing protocol that takes into account the orphan nodes. O-LEACH presents two scenarios, a gateway and sub cluster that allow the joining of orphan nodes.

scholarly journals SDFMUCR: Software-defined and fuzzy-based multi-hop unequal cluster routing

2020 ◽  
Vol 16 (10) ◽  
pp. 155014772096299
Author(s):  
Lu Sixu ◽  
Wu Muqing ◽  
Zhao Min
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Software Defined Network ◽  
Control Overhead ◽  
Unequal Cluster

Recently, wireless sensor networks play an important role in our life. Researchers give more and more attention to the design of the routing algorithm. Cluster routing is the most popular routing protocol in wireless sensor networks. However, hotspot problem always exists. Unequal cluster routing is an effective method to solve this problem. In these protocols, nodes closer to base station have the smaller cluster size than other sensor nodes. It will reduce the relay pressure of the node which is near to the base station. The development of the software-defined network optimizes the performance of wireless sensor networks. In this article, we propose a software-defined and fuzzy-based multi-hop unequal cluster routing protocol. It adopts three methods to make the routing protocol outstanding. First, it uses a novel software-defined network architecture to reduce computation overhead and energy overhead in sensor nodes. Then, the fuzzy logic–based intracluster and intercluster routing is designed to balance energy consumption. Finally, residual energy–based rotating scheme is proposed to reduce most of the control overhead. According to the simulation results, the proposed protocol balances and reduces the energy consumption, extends the lifetime, and reduces the control overhead and latency of the network.

scholarly journals Energy-Efficient Multi-Disjoint Path Opportunistic Node Connection Routing Protocol in Wireless Sensor Networks for Smart Grids

Sensors ◽  
2019 ◽  
Vol 19 (17) ◽  
pp. 3789 ◽  
Author(s):  
Anees ◽  
Zhang ◽  
Baig ◽  
Lougou
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Real Time ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Smart Grids ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Disjoint Path

The gradual increase in the maturity of sensor electronics has resulted in the increasing demand for wireless sensor networks for many industrial applications. One of the industrial platforms for efficient usage and deployment of sensor networks is smart grids. The critical network traffic in smart grids includes both delay-sensitive and delay-tolerant data for real-time and non-real-time usage. To facilitate these traffic requirements, the asynchronous working–sleeping cycle of sensor nodes can be used as an opportunity to create a node connection. Efficient use of wireless sensor network in smart grids depends on various parameters like working–sleeping cycle, energy consumption, network lifetime, routing protocol, and delay constraints. In this paper, we propose an energy-efficient multi-disjoint path opportunistic node connection routing protocol (abbreviated as EMOR) for sensor nodes deployed in neighborhood area network. EMOR utilizes residual energy, availability of sensor node’s buffer size, working–sleeping cycle of the sensor node and link quality factor to calculate optimum path connectivity after opportunistic connection random graph and spanning tree formation. The multi-disjoint path selection in EMOR based on service differentiation of real-time and non-real-time traffic leads to an improvement in packet delivery rate, network lifetime, end-end delay and total energy consumption.

Sign in / Sign up

Export Citation Format

Share Document