scholarly journals Reliable Link Level Routing Algorithm in Pipeline Monitoring Using Implicit Acknowledgements

Sensors ◽  
2021 ◽  
Vol 21 (3) ◽  
pp. 968
Author(s):  
Carlos Egas Acosta. ◽  
Felipe Gil-Castiñeira ◽  
Enrique Costa-Montenegro ◽  
Jorge Sá Silva
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Explicit Knowledge ◽  
Routing Algorithm ◽  
Linear Structure ◽  
High Energy ◽  
Wireless Sensor ◽  
Tree Topologies ◽  
End To End

End-to-end reliability for Wireless Sensor Network communications is usually provided by upper stack layers. Furthermore, most of the studies have been related to star, mesh, and tree topologies. However, they rarely consider the requirements of the multi-hop linear wireless sensor networks, with thousands of nodes, which are universally used for monitoring applications. Therefore, they are characterized by long delays and high energy consumption. In this paper, we propose an energy efficient link level routing algorithm that provides end-to-end reliability into multi-hop wireless sensor networks with a linear structure. The algorithm uses implicit acknowledgement to provide reliability and connectivity with energy efficiency, low latency, and fault tolerance in linear wireless sensor networks. The proposal is validated through tests with real hardware. The energy consumption and the delay are also mathematically modeled and analyzed. The test results show that our algorithm decreases the energy consumption and minimizes the delays when compared with other proposals that also apply the explicit knowledge technique and routing protocols with explicit confirmations, maintaining the same characteristics in terms of reliability and connectivity.

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%.

scholarly journals Cluster Routing Algorithm for Ring Based Wireless Sensor Network Using Particle Swarm And Lion Swarm Optimization

2021 ◽  
Author(s):  
Huangshui Hu ◽  
Yuxin Guo ◽  
Jinfeng Zhang ◽  
Chunhua Yin ◽  
Dong Gao
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Hot Spot ◽  
Fitness Function ◽  
Routing Algorithm ◽  
Particle Swarm ◽  
Relay Node ◽  
Wireless Sensor ◽  
Swarm Optimization

Abstract In order to solve the problem of hot spot caused by uneven energy consumption of nodes in Wireless Sensor Networks (WSNs) and reduce the network energy consumption, a novel cluster routing algorithm called CRPL for ring based wireless sensor networks using Particle Swarm Optimization (PSO) and Lion Swarm Optimization (LSO) is proposed in this paper. In CRPL, the optimal cluster head (CH) of each ring are selected by using LSO whose fitness function is composed of energy,number of neighbor nodes, number of cluster heads and distance. Moreover, PSO with a multi-objective fitness function considering distance, energy and cluster size is used to find the next hop relay node in the process of data transmission, and the optimal routing paths are obtained, so as to alleviate the hot spot problem as well as decrease the energy consumption in the routing process. The simulation results show that, compared with some existing optimization algorithms, CRPL has better effects in balancing the energy consumption of the network and prolonging the life cycle of the network.

scholarly journals Oppo-Flood: An Energy-Efficient Data Dissemination Protocol for Asynchronous Duty-Cycled Wireless Sensor Networks

2019 ◽  
Vol 2019 ◽  
pp. 1-19
Author(s):  
Hyeonsang Cho ◽  
Jungmin So
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Data Dissemination ◽  
High Energy ◽  
Wireless Sensor ◽  
Neighboring Node ◽  
Duty Cycling ◽  
Opportunistic Forwarding ◽  
Efficient Data

In this paper, we propose a data dissemination protocol for asynchronous duty-cycling wireless sensor networks. In an asynchronous duty-cycling network, each node independently selects its wake-up time. In this environment, data dissemination becomes energy consuming, because broadcasting a packet does reach all neighbors but only the neighbors that are awake at the time. A node can forward its packet to all neighbors by continuously transmitting the packet for a whole wake-up interval, but it leads to high energy consumption and high dissemination delay. The idea proposed in this paper is to use opportunistic forwarding, where each node forwards the packet to a neighbor that wakes up early and receives the packet. Each node forwards the packet, as long as there is a neighboring node that has not received the packet yet. The main benefit of this opportunistic forwarding-based dissemination is that every time a packet is disseminated, it may take a different path to reach the nodes. At the beginning of dissemination, a sender needs to transmit for a very short duration of time because there are plenty of neighboring nodes to receive the packet. As more nodes receive the packet, the transmit duration of the sender becomes longer, thus consuming more energy. Since the order of dissemination is different every time, energy consumption is naturally balanced among the nodes, without explicit measures. Through extensive simulations, we show that the proposed protocol achieves longer network lifetime and shorter dissemination delay compared to other dissemination protocols in various network environments.

scholarly journals Energy Balance Routing Algorithm Based on Virtual MIMO Scheme for Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Jianpo Li ◽  
Xue Jiang ◽  
I-Tai Lu
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Energy Balance ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Wireless Sensor ◽  
Virtual Mimo ◽  
Head Node

Wireless sensor networks are usually energy limited and therefore an energy-efficient routing algorithm is desired for prolonging the network lifetime. In this paper, we propose a new energy balance routing algorithm which has the following three improvements over the conventional LEACH algorithm. Firstly, we propose a new cluster head selection scheme by taking into consideration the remaining energy and the most recent energy consumption of the nodes and the entire network. In this way, the sensor nodes with smaller remaining energy or larger energy consumption will be much less likely to be chosen as cluster heads. Secondly, according to the ratio of remaining energy to distance, cooperative nodes are selected to form virtual MIMO structures. It mitigates the uneven distribution of clusters and the unbalanced energy consumption of the whole network. Thirdly, we construct a comprehensive energy consumption model, which can reflect more realistically the practical energy consumption. Numerical simulations analyze the influences of cooperative node numbers and cluster head node numbers on the network lifetime. It is shown that the energy consumption of the proposed routing algorithm is lower than the conventional LEACH algorithm and for the simulation example the network lifetime is prolonged about 25%.

An Opportunistic Large Array Concentric Geographic Routing Algorithm with a Relay Node in Wireless Sensor Networks

2015 ◽  
Vol 764-765 ◽  
pp. 838-842
Author(s):  
Young Long Chen ◽  
Yung Chi Chang ◽  
Yu Ling Zeng
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Routing Algorithm ◽  
Geographic Routing ◽  
Sensor Nodes ◽  
Source Node ◽  
Wireless Sensor ◽  
Sink Node ◽  
Large Array

Wireless sensor networks (WSNs) are a group of wireless sensor nodes, those sensor nodes with sensing and monitoring of environmental information. Energy consumption is an important topic; the node's power is limited. Therefore, we proposed an Opportunistic Large Array Concentric Geographic Routing Algorithm (OLACGRA) to reduce the node’s energy consumption and analysis the characteristic of energy model. The sink position of our proposed OLACGRA is at the center of concentric topology architecture. The source node wants to transmit data that it needs to calculate the distance between source node and sink node. If this distance bigger than threshold value, we use the multi-hop manner. Otherwise, source node transmits data to sink node directly. Simulation results show that our proposed algorithm can effectively reduce the node’s energy consumption.

Sign in / Sign up

Export Citation Format

Share Document