scholarly journals Swarm intelligence based reliable and energy balance routing algorithm for wireless sensor network

2016 ◽  
Vol 29 (3) ◽  
pp. 339-355
Author(s):  
Fatma Elfouly ◽  
Rabie Ramadan ◽  
Mohamed Mahmoud ◽  
Moawad Dessouky
Keyword(s):  
Energy Consumption ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Algorithm ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Minimum Energy Consumption ◽  
Energy Balanced Routing ◽  
Memory Resources

Energy is an extremely crucial resource for Wireless Sensor Networks (WSNs). Many routing techniques have been proposed for finding the minimum energy routing paths with a view to extend the network lifetime. However, this might lead to unbalanced distribution of energy among sensor nodes resulting in, energy hole problem. Therefore, designing energy-balanced routing technique is a challenge area of research in WSN. Moreover, dynamic and harsh environments pose great challenges in the reliability of WSN. To achieve reliable wireless communication within WSN, it is essential to have reliable routing protocol. Furthermore, due to the limited memory resources of sensor nodes, full utilization of such resources with less buffer overflow remains as a one of main consideration when designing a routing protocol for WSN. Consequently, this paper proposes a routing scheme that uses SWARM intelligence to achieve both minimum energy consumption and balanced energy consumption among sensor nodes for WSN lifetime extension. In addition, data reliability is considered in our model where, the sensed data can reach the sink node in a more reliable way. Finally, buffer space is considered to reduce the packet loss and energy consumption due to the retransmission of the same packets. Through simulation, the performance of proposed algorithm is compared with the previous work such as EBRP, ACO, TADR, SEB, and CLR-Routing.

scholarly journals Digital Media Art Communication Based on Wireless Cooperative Routing with Minimum Energy Consumption

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Shuli Song
Keyword(s):  
Energy Consumption ◽  
Digital Media ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Target Area ◽  
Media Art ◽  
Cooperative Routing ◽  
Minimum Energy Consumption

Wireless cooperative routing algorithm transmits the data collected in the target area to users, so that users can obtain monitoring information timely and accurately. In the traditional low-power adaptive clustering hierarchical routing protocol, the process of building clusters is random, the resources of nodes are not fully utilized, the node death speed is fast, the network life cycle is short, and the performance is not stable enough. In addition, the route maintenance process is cumbersome and will occupy a lot of bandwidth. In order to solve the problems of real-time transmission of digital media art communication data and network lifetime optimization, a wireless cooperative routing algorithm based on minimum energy consumption is proposed. The facts of transmission strength consumption, node residual strength, and minimal information transmission extension are analyzed, a new weight feature is proposed, and a multipath statistics routing scheme is developed by using the usage of the minimal strength consumption. All digital media art propagation sensor nodes transmit data to sink nodes along multiple transmission paths. Simulation results show that the algorithm can prolong the network lifetime, reduce and balance the node energy consumption, reduce the data transmission delay, reduce the energy consumption of wireless cooperative routing based on the minimum energy consumption by 64.5%, and increase the number of compressed images by 182%.

scholarly journals An Enhanced Energy Optimization Routing Protocol with Fuzzy Logic in Wireless Sensor Network

2020 ◽  
Vol 9 (5) ◽  
pp. 1200-1206
Keyword(s):  
Fuzzy Logic ◽  
Energy Consumption ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
Routing Protocol ◽  
Routing Algorithm ◽  
Packet Transmission ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Intermediate Node

Wireless Sensor Network (WSN) is a huge collection of sensor nodes deployed without any predetermined infrastructure. They are powered by batteries and energy consumption is one of the major issues in WSN. Hence to prolong the lifetime of the networks, it is important to design the energy efficient optimized routing algorithm. In this paper, two hop forwarding scheme in AODV and Fuzzy Logic is proposed to find an optimal routing protocol and intermediate node acknowledgement is deducted by the use of Fuzzy rules. The parameters such as remaining energy, data packet transmission, packet received acknowledgement and number of rounds is given as input to the fuzzy system which gives an optimized routing decision. The efficacy of the proposed algorithm is evaluated using NS2 and compared with Fuzzy-based Energy-Aware Routing Mechanism (FEARM). The simulation results shows that the Fuzzy based AODV routing algorithm reduces the energy consumption, minimizes the routing response packets and improves the network life time compared to other similar routing protocols.

scholarly journals A Study on Existing Protocols and Energy-Balanced Routing Protocol for Data Gathering in Wireless Sensor Networks

2013 ◽  
Vol 11 (7) ◽  
pp. 2787-2791
Author(s):  
T. Lalitha ◽  
Jayanthila Devi ◽  
Dr.G.M. Kadh
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Minimum Energy ◽  
Residual Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Basic Algorithm ◽  
Energy Balanced Routing

Energy is an extremely critical resource for battery-powered wireless sensor networks (WSN), thus making energy-efficient protocol design a key challenging problem. Most of the existing energy-efficient routing protocols always forward packets along the minimum energy path to the sink to merely minimize energy consumption, which causes an unbalanced distribution of forming residue energy among sensor nodes, and eventually results in a network partition. In this paper, with the help of the concept of potential in physics, we design an Energy-Balanced Routing Protocol (EBRP) by constructing a mixed virtual potential field in terms of depth, energy density, and residual energy. The goal of this basic approach is to force packets to move toward the sink through the dense energy area to protect the nodes with relatively low residual energy. To address the routing loop problem emerging in this basic algorithm, enhanced mechanisms are proposed to detect and eliminate loops. The basic algorithm and loop elimination mechanism are first validated through extensive simulation experiments. 

Optimal Hop Lengths to Ensure Minimum Energy Consumption in Wireless Sensor Networks

2020 ◽  
pp. 105-124
Author(s):  
Mekkaoui Kheireddine ◽  
Rahmoune Abdellatif
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
High Performance ◽  
Routing Algorithm ◽  
Minimum Energy ◽  
Wireless Sensor ◽  
Minimum Energy Consumption ◽  
Small Antenna ◽  
Save Energy

In wireless sensor networks, nodes have a low computing capacity, a small antenna and a very limited energy source; thereby batteries are considered as a critical resource and should be used efficiently. On the other hand, the antennas are the biggest consumers of energy, therefore, and their use must be very efficient to minimize energy consumption. In a dense WSN, each node may route messages to destination nodes either through short-hops or long-hops, by using a short or a long radio range. Thus, the hop length optimization can save energy. In this article, the authors propose a theorem to optimize the hop lengths and a routing algorithm to improve the WSN power consumption. The theorem establishes a simple condition to ensure the optimal hop lengths which guarantees the minimum energy consumption. And the proposed algorithm based on that condition is used to find the optimal routing path. The simulation results are obtained by applying the condition and the algorithm on WSNs and reveals a high performance regarding WSNs energy consumption and network lifetime.

Optimal Hop Lengths to Ensure Minimum Energy Consumption in Wireless Sensor Networks

2018 ◽  
Vol 9 (4) ◽  
pp. 1-18 ◽  
Author(s):  
Mekkaoui Kheireddine ◽  
Rahmoune Abdellatif
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
High Performance ◽  
Routing Algorithm ◽  
Minimum Energy ◽  
Wireless Sensor ◽  
Minimum Energy Consumption ◽  
Small Antenna ◽  
Save Energy

In wireless sensor networks, nodes have a low computing capacity, a small antenna and a very limited energy source; thereby batteries are considered as a critical resource and should be used efficiently. On the other hand, the antennas are the biggest consumers of energy, therefore, and their use must be very efficient to minimize energy consumption. In a dense WSN, each node may route messages to destination nodes either through short-hops or long-hops, by using a short or a long radio range. Thus, the hop length optimization can save energy. In this article, the authors propose a theorem to optimize the hop lengths and a routing algorithm to improve the WSN power consumption. The theorem establishes a simple condition to ensure the optimal hop lengths which guarantees the minimum energy consumption. And the proposed algorithm based on that condition is used to find the optimal routing path. The simulation results are obtained by applying the condition and the algorithm on WSNs and reveals a high performance regarding WSNs energy consumption and network lifetime.

Performance Analysis of TBC-ACO Routing Protocol with Existing Routing Protocols of Wireless Sensor Networks

2017 ◽  
Vol 7 (8) ◽  
pp. 169
Author(s):  
A. Radhika ◽  
D. Haritha
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Swarm Intelligence ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Congestion Aware

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.

Energy Efficient Group Based Linear Wireless Sensor Networks for Application in Pipeline Monitoring

2020 ◽  
Vol 10 ◽  
Author(s):  
Chinedu Duru ◽  
Neco Ventura ◽  
Mqhele Dlodlo
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Remote Monitoring ◽  
Linear Array ◽  
Minimum Energy ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Sink Node ◽  
Pipeline Monitoring

Background: Wireless Sensor Networks (WSNs) have been researched to be one of the ground-breaking technologies for the remote monitoring of pipeline infrastructure of the Oil and Gas industry. Research have also shown that the preferred deployment approach of the sensor network on pipeline structures follows a linear array of nodes, placed a distance apart from each other across the infrastructure length. The linear array topology of the sensor nodes gives rise to the name Linear Wireless Sensor Networks (LWSNs) which over the years have seen themselves being applied to pipelines for effective remote monitoring and surveillance. This paper aims to investigate the energy consumption issue associated with LWSNs deployed in cluster-based fashion along a pipeline infrastructure. Methods: Through quantitative analysis, the study attempts to approach the investigation conceptually focusing on mathematical analysis of proposed models to bring about conjectures on energy consumption performance. Results: From the derived analysis, results have shown that energy consumption is diminished to a minimum if there is a sink for every placed sensor node in the LWSN. To be precise, the analysis conceptually demonstrate that groups containing small number of nodes with a corresponding sink node is the approach to follow when pursuing a cluster-based LWSN for pipeline monitoring applications. Conclusion: From the results, it is discovered that energy consumption of a deployed LWSN can be decreased by creating groups out of the total deployed nodes with a sink servicing each group. In essence, the smaller number of nodes each group contains with a corresponding sink, the less energy consumed in total for the entire LWSN. This therefore means that a sink for every individual node will attribute to minimum energy consumption for every non-sink node. From the study, it can be concurred that energy consumption of a LWSN is inversely proportional to the number of sinks deployed and hence the number of groups created.

Energy Efficient Clustering and Routing Algorithm for WSN

2019 ◽  
Vol 12 ◽  
Author(s):  
Mohit Kumar ◽  
Sonu Mittal ◽  
Md. Amir Khusru Akhtar
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Energy Efficient ◽  
Hot Spot ◽  
Routing Algorithm ◽  
Relay Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Energy Efficient Clustering ◽  
Hot Spot Problem

Background: This paper presents a novel Energy Efficient Clustering and Routing Algorithm (EECRA) for WSN. It is a clustering-based algorithm that minimizes energy dissipation in wireless sensor networks. The proposed algorithm takes into consideration energy conservation of the nodes through its inherent architecture and load balancing technique. In the proposed algorithm the role of inter-cluster transmission is not performed by gateways instead a chosen member node of respective cluster is responsible for data forwarding to another cluster or directly to the sink. Our algorithm eases out the load of the gateways by distributing the transmission load among chosen sensor node which acts as a relay node for inter-cluster communication for that round. Grievous simulations show that EECRA is better than PBCA and other algorithms in terms of energy consumption per round and network lifetime. Objective: The objective of this research lies in its inherent architecture and load balancing technique. The sole purpose of this clustering-based algorithm is that it minimizes energy dissipation in wireless sensor networks. Method: This algorithm is tested with 100 sensor nodes and 10 gateways deployed in the target area of 300m × 300m. The round assumed in this simulation is same as in LEACH. The performance metrics used for comparisons are (a) network lifetime of gateways and (b) energy consumption per round by gateways. Our algorithm gives superior result compared to LBC, EELBCA and PBCA. Fig 6 and Fig 7 shows the comparison between the algorithms. Results: The simulation was performed on MATLAB version R2012b. The performance of EECRA is compared with some existing algorithms like PBCA, EELBCA and LBCA. The comparative analysis shows that the proposed algorithm outperforms the other existing algorithms in terms of network lifetime and energy consumption. Conclusion: The novelty of this algorithm lies in the fact that the gateways are not responsible for inter-cluster forwarding, instead some sensor nodes are chosen in every cluster based on some cost function and they act as a relay node for data forwarding. Note the algorithm does not address the hot-spot problem. Our next endeavor will be to design an algorithm with consideration of hot-spot problem.

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 Maximization of Lifetime of Wireless Sensor Network with Sensitive Power Dynamic Protocol

2018 ◽  
Vol 7 (3.12) ◽  
pp. 380
Author(s):  
Manish Bhardwaj ◽  
Anil Ahlawat ◽  
Nidhi Bansal
Keyword(s):  
Routing Protocol ◽  
Steering System ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Destination Node ◽  
Power Efficient ◽  
Data Packets ◽  
And Performance ◽  
Energy Balanced Routing ◽  
Power Balancing

A vitality effective protocol configuration is a key testing issue in a network of Wireless Sensor. A portion of the few existing vitality effective protocols plots dependably forward the bundles through the base vitality based ideal course to the sink to limit vitality utilization. It causes a disturbed dispersion of remaining vitality between sensor nodes, which prompts partitioning of the network. The prime objective of this method is to pass the data packets to destination node through the vitality denser range within Sensor Networks Lifetime. The current procedure Energy Balanced Routing Protocol (EBRP) neglects to accomplish Throughput, Delay part, keeping in mind the end goal to enhance the Network Lifetime and Performance so the proficient steering convention is required with the abilities of both the Power Efficient and Power Balancing. To resolve this problem, this manuscript proposed Impediment Sensitive Power Unbiased Dynamic Routing Protocol (ISPUDRP). The proposed steering system accomplishes as far as End-to-End Delay, Throughput and Lifetime of network. This manuscript shows that proposed calculation accomplishes better execution performance than the current strategies.   

Sign in / Sign up

Export Citation Format

Share Document