scholarly journals Routing Protocols for Energy Efficiency in WSNs: A review

2021 ◽  
pp. 29-33
Author(s):  
Dheyab Salman Ibrahim ◽  
Abd Ali Hussein ◽  
Fadhil Kadhem Zaidan
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Minimum Energy ◽  
Shortest Paths ◽  
Network Routing ◽  
Wireless Sensor ◽  
Maximum Lifespan ◽  
Data Routing ◽  
Minimum Energy Consumption

Wireless sensor networks (WSNs) is a significant part of networking area. They are cheap, efficient, and small, they are become more and more important for several applications. However, with the widespread use of applications that rely on wireless sensor networks, they continue to suffer from limitations such as data routing and security. WSNs can be used for several applications. Nodes of Sensor work on batteries. It is impossible to charge or replace the battery in some applications. For that purpose, optimal use of node’s energy is a key issue in the network. Routing is a significant challenge to extend the lifespan of network. Several protocols are implemented in WSNs. In this study, a survey on clustering techniques, present a characteristic and requirements routing design of WSNs. Result of this study shows how to solve some of these problems. WSN routing protocols have to ensure shortest paths, minimum energy consumption, less delay and maximum lifespan of network.

scholarly journals Research on LEACH-Based Wireless Sensor Network Routing

2019 ◽  
Vol 25 ◽  
pp. 01011
Author(s):  
Junke Lv
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocols ◽  
Routing Algorithm ◽  
Network Routing ◽  
Wireless Sensor ◽  
Practical Significance ◽  
Routing Optimization ◽  
Leach Protocol ◽  
Routing Technology

Routing technology is one of the main supporting technologies of wireless sensor networks. Only by using routing algorithm reasonably or finding better routing optimization algorithm, can the function of wireless sensor networks be maximized. Therefore, the research of routing technology for wireless sensor networks has important theoretical and practical significance. Based on the analysis of existing routing protocols in wireless sensor networks, this paper focuses on LEACH protocol.

scholarly journals Maximizing Network Lifetime Operator for Wireless Sensor Networks

2013 ◽  
Vol 4 (2) ◽  
pp. 267-272
Author(s):  
Dr. Deepali Virmani
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Topology Control ◽  
Performance Metrics ◽  
Minimum Energy ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Minimum Energy Consumption

Optimizing and enhancing network lifetime with minimum energy consumption is the major challenge in field of wireless sensor networks. Existing techniques for optimizing network lifetime are based on exploiting node redundancy, adaptive radio transmission power and topology control. Topology control protocols have a significant impact on network lifetime, available energy and connectivity. In this paper we categorize sensor nodes as strong and weak nodes based on their residual energy as well as operational lifetime and propose a Maximizing Network lifetime Operator (MLTO) that defines cluster based topology control mechanism to enhance network lifetime while guarantying the minimum energy consumption and minimum delay. Extensive simulations in Java-Simulator (J-Sim) show that our proposed operator outperforms the existing protocols in terms of various performance metrics life network lifetime, average delay and minimizes energy utilization.

scholarly journals Analysis of clustering in wireless sensor networks

2018 ◽  
Vol 7 (3.3) ◽  
pp. 228
Author(s):  
Arul Stephen C ◽  
Ebenezer Abishek.B ◽  
Dr V.Rajendran
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Minimum Energy ◽  
Route Optimization ◽  
Wireless Sensor ◽  
Network Clustering ◽  
Tree Algorithm ◽  
Minimum Energy Consumption

Location based routing using Global Position System used for establishing the nodes in wireless sensor networks making uses of clustering along with the location based routing is used for faster reliable and reduced Hops with minimum energy consumption and by using of minimum spanning tree algorithm to achieve a shortest path in a network. Clustering in wireless sensor network is used for improving network lifetime. We propose effective method called enhanced route optimization in clustering is performed using minimum spanning tree algorithm.  

scholarly journals A Hierarchical QoS Routing Protocol for the Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 2018-2022
Author(s):  
Ze Sshun Zhou ◽  
Yi Xu ◽  
Min Qin ◽  
Chu Yang Mao ◽  
La Yuan Li
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Complexity Analysis ◽  
Minimum Energy ◽  
Qos Routing ◽  
Multicast Tree ◽  
Wireless Sensor ◽  
Minimum Energy Consumption ◽  
Message Overhead

The large wireless sensor networks are often structured hierarchically by grouping nodes into different domains in order to deal with the scaling problem. This paper proposes a new protocol called hierarchical QoS routing protocol (HQRP) that achieves scalability by organizing the network as a hierarchy of domains using the full-mesh aggregation technique. In HQRP, each local node just only needs to maintain local routing and summary information of other domains, but does not requires any global states maintained. The HQRP uses a Reverse Best Metric Path Forwarding approach with hierarchical, topological and QoS forwarding conditions to construct the multicast tree while minimizing message overhead and satisfying delay-bandwidth and minimum energy consumption. The paper presents proof of correctness and complexity analysis of the HQRP. Simulation results show very good performance in terms of success ratio and message overhead.

Algorithms for Spatial Partitioning in Wireless Sensor Network

2013 ◽  
pp. 109-133
Author(s):  
Kakia Panagidi
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Scheduling Algorithm ◽  
Voronoi Tessellation ◽  
Minimum Energy ◽  
Wireless Sensor ◽  
Coverage Problem ◽  
Minimum Energy Consumption ◽  
Wide Range ◽  
Military Healthcare

Recent interest in integrated electronic devices (sensors) that operate wirelessly creates a wide range of applications related to national security, surveillance, military, healthcare, and environmental monitoring. Many visions of the future include people immersed in an environment surrounded by sensors and intelligent devices, which use smart infrastructures to improve the quality of life. However, a fundamental feature of sensor networks is coverage: how these tiny devices can cover a certain terrain. These devices should be organized in an optimal manner, consuming the minimum energy and covering the whole area of interest. The coverage concept is subject to a wide range of interpretations due to the variety of sensors and applications. Different coverage formulations have been proposed based on the subject to be covered (area in relation to specific items and obstacles), sensor development mechanisms (random versus deterministic), and other properties of wireless sensor networks (e.g. network connectivity and minimum energy consumption). In this chapter, the authors study the coverage problem in wireless sensor networks using the most recent algorithms. The aim of this chapter is to present these algorithms and a comparison between them based on various criteria. The Node Self-Scheduling algorithm, the Centralized Voronoi Tessellation (CVT), the Particle Swarm Optimization Algorithm (PSO), the Virtual Forces Algorithm (VFA), etc. are analyzed. Through the algorithms’ analysis, the interested reader can have a complete view of the proposed solutions related to the coverage problem.

Sign in / Sign up

Export Citation Format

Share Document