scholarly journals Energy-Efficient Clustering Scheme for Flying Ad-Hoc Networks Using an Optimized LEACH Protocol

Energies ◽  
2021 ◽  
Vol 14 (19) ◽  
pp. 6016
Author(s):  
Salil Bharany ◽  
Sandeep Sharma ◽  
Sumit Badotra ◽  
Osamah Ibrahim Khalaf ◽  
Youseef Alotaibi ◽  
...  
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Ad Hoc ◽  
Base Station ◽  
Low Energy ◽  
Sensor Nodes ◽  
Threshold Function ◽  
Adaptive Clustering ◽  
Leach Protocol ◽  
Energy Efficient Clustering

A Flying Ad-hoc network constitutes many sensor nodes with limited processing speed and storage capacity as they institute a minor battery-driven device with a limited quantity of energy. One of the primary roles of the sensor node is to store and transmit the collected information to the base station (BS). Thus, the life span of the network is the main criterion for the efficient design of the FANETS Network, as sensor nodes always have limited resources. In this paper, we present a methodology of an energy-efficient clustering algorithm for collecting and transmitting data based on the Optimized Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol. The selection of CH is grounded on the new optimized threshold function. In contrast, LEACH is a hierarchical routing protocol that randomly selects cluster head nodes in a loop and results in an increased cluster headcount, but also causes more rapid power consumption. Thus, we have to circumvent these limitations by improving the LEACH Protocol. Our proposed algorithm diminishes the energy usage for data transmission in the routing protocol, and the network’s lifetime is enhanced as it also maximizes the residual energy of nodes. The experimental results performed on MATLAB yield better performance than the existing LEACH and Centralized Low-Energy Adaptive Clustering Hierarchy Protocol in terms of energy efficiency per unit node and the packet delivery ratio with less energy utilization. In addition, the First Node Death (FND) is also meliorated when compared to the LEACH and LEACH-C protocols.

Energy-Efficient Routing Protocol of Wireless Sensor Network for Industrial Application

2013 ◽  
Vol 579-580 ◽  
pp. 732-739
Author(s):  
Zhi Yan Ma ◽  
Guang You Yang ◽  
Jing Jing Zhou ◽  
Xiong Gan
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Time Slot ◽  
Data Gathering ◽  
Base Station ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Death Time ◽  
Leach Protocol ◽  
Energy Efficient Clustering

An energy-efficient wireless sensor routing protocol (Energy-efficient clustering hierarchy routing protocol, EECH) for industrial field is proposed based on LEACH protocol according to the energy inefficiency of existing routing protocols and the characteristics of industrial field applications. The EECH protocol takes full advantages of the node clustering and time slot distribution in LEACH and implements the functions such as clustering, multi hop time slot distribution, node sleeping and data gathering. The cluster heads can be evenly distributed in the area with the geography location information of the wireless nodes, so that the optimal data gathering path can be established. Meanwhile, the EECH protocol can reduce the conflict in data receiving/transmitting and the energy consumption of the nodes, and extend the network lifetime through the multi hop time slot distribution and node sleep mechanism. The simulation results have shown that the death time of the first node in EECH protocol is extended double time than that of LEACH protocol. When most of the nodes dies, the amount of received data of the base station node is more than twice as much as the LEACH protocol, which has verified the energy efficiency characteristic of the EECH protocol.

scholarly journals Energy Efficient Secured Ring Based Clustering Protocol for WSN

2019 ◽  
Vol 9 (2) ◽  
pp. 336-339
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Optimal Path ◽  
Base Station ◽  
Sensor Nodes ◽  
Natural Phenomenon ◽  
Delivery Ratio ◽  
Clustering Protocol ◽  
Autonomous Nodes ◽  
Energy Efficient Clustering

WSN is a gathering of small autonomous nodes that are used to function the Natural Phenomenon. The sensed events are transmitted to the base station for processing the system. Given the Resource Constrained Nature of WSN, Optimizing the energy during Routing process is a major concern. In this Paper, a Novel Ring Based Clustering Routing Protocol(RBCRP) is proposed, where it can provides the energy efficient clustering to sensor nodes. By doing so the sensor nodes it reduces number of retransmission of data items. Moreover, the proposed protocol provides efficient Routing, where it discovers the optimal path. The proposed protocol is implemented in NS3 simulator. The simulator results justifies that, proposed protocol improves Energy efficiency, Reduces delay and Increases packet delivery Ratio. Simulate Results faster viability of the proposed Scheme

scholarly journals HIGHLY DISTRIBUTED AND ENERGY EFFICIENT CLUSTERING ALGORITHM FOR WIRELESS SENSOR NETWORKS

2016 ◽  
Vol 4 (9) ◽  
pp. 30-38
Author(s):  
Boselin Prabhu ◽  
Bala Kumar
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Networks ◽  
Sensor Network ◽  
Energy Efficient ◽  
Base Station ◽  
Low Energy ◽  
Energy Utilization ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Adaptive Clustering

Wireless sensor network (WSN) is a low-powered prestigious network fashioned by sensor nodes that treasures application in civilian, military, visual sense models and many others. Reduced energy utilization is an exigent task for these sensor networks. By the data aggregation procedure, needless communication between sensor nodes, cluster head and the base station is eluded. An evaluation of energy efficient optical low energy adaptive clustering hierarchy has been performed and the enactments have been compared with the prevailing low energy adaptive clustering hierarchy algorithm, between two detached wireless sensor network fields. The proposed clustering procedure has been primarily implemented to join two distinct wireless sensor fields. An optical fiber is used to join two reserved wireless sensor fields. This distributed clustering methodology chiefly targets in exploiting the parameters like network lifetime, throughput and energy efficiency of the whole wireless sensor system.

Two Rounds Based LEACH

2017 ◽  
Vol 8 (3) ◽  
pp. 34-44
Author(s):  
Meriem Boumassata ◽  
Mohamed Benmohammed
Keyword(s):  
Low Power ◽  
Routing Protocol ◽  
Routing Protocols ◽  
Electronic Devices ◽  
Cluster Head ◽  
Hierarchical Cluster ◽  
Base Station ◽  
Sensor Nodes ◽  
Adaptive Clustering ◽  
Leach Protocol

Wireless sensor networks (WSNs) are networks formed by a large number of electronic devices called sensor nodes, where each node is capable of measuring environmental or physical values and communicating data, through wireless links, to a base station. The main problem that WSNs routing protocols face, is that sensors are powered with low power batteries, which plays an important role in network lifetime. Low Energy Adaptive Clustering Hierarchy (LEACH) is a hierarchical cluster based routing protocol that was proposed as a solution for low power consumption in WSNs. One of LEACH protocol limitations is “Extra Transmissions”. This paper studies LEACH protocol, some of its various enhancements and finally proposes a new clustering and selecting cluster head scheme with the goal of optimizing the energy consumption in WSNs.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

2018 ◽  
pp. 18-26
Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam
Keyword(s):  
Routing Protocol ◽  
Routing Protocols ◽  
Key Management ◽  
Energy Efficient ◽  
Base Station ◽  
Secure Routing ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Management Schemes ◽  
Cluster Based Routing

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC) for Wireless Sensor Networks

2020 ◽  
Vol 13 (2) ◽  
pp. 168-172
Author(s):  
Ravi Kumar Poluru ◽  
M. Praveen Kumar Reddy ◽  
Syed Muzamil Basha ◽  
Rizwan Patan ◽  
Suresh Kallam
Keyword(s):  
Network Lifetime ◽  
Routing Protocols ◽  
Energy Efficient ◽  
High Energy ◽  
Base Station ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Distributed Energy ◽  
Stability Period ◽  
Energy Efficient Clustering

Background:Recently Wireless Sensor Network (WSN) is a composed of a full number of arbitrarily dispensed energy-constrained sensor nodes. The sensor nodes help in sensing the data and then it will transmit it to sink. The Base station will produce a significant amount of energy while accessing the sensing data and transmitting data. High energy is required to move towards base station when sensing and transmitting data. WSN possesses significant challenges like saving energy and extending network lifetime. In WSN the most research goals in routing protocols such as robustness, energy efficiency, high reliability, network lifetime, fault tolerance, deployment of nodes and latency. Most of the routing protocols are based upon clustering has been proposed using heterogeneity. For optimizing energy consumption in WSN, a vital technique referred to as clustering.Methods:To improve the lifetime of network and stability we have proposed an Enhanced Adaptive Distributed Energy-Efficient Clustering (EADEEC).Results:In simulation results describes the protocol performs better regarding network lifetime and packet delivery capacity compared to EEDEC and DEEC algorithm. Stability period and network lifetime are improved in EADEEC compare to DEEC and EDEEC.Conclusion:The EADEEC is overall Lifetime of a cluster is improved to perform the network operation: Data transfer, Node Lifetime and stability period of the cluster. EADEEC protocol evidently tells that it improved the throughput, extended the lifetime of network, longevity, and stability compared with DEEC and EDEEC.

scholarly journals Performance Comparison of Routing Protocols for Underwater Sensor Networks

2018 ◽  
Vol 7 (4.15) ◽  
pp. 178
Author(s):  
Komal Memon ◽  
Nafeesa Bohra ◽  
Faisal K Shaikh
Keyword(s):  
Energy Consumption ◽  
Sensor Networks ◽  
High Throughput ◽  
Routing Protocols ◽  
Energy Efficient ◽  
Base Station ◽  
Low Energy ◽  
Sensor Nodes ◽  
Underwater Sensor Networks ◽  
Energy Efficient Routing

There is a great demand of an Underwater Sensor Networks (UWSNs) in applications of water monitoring and offshore exploration. In such applications, network comprises of multiple sensor nodes which are deployed at different locations and depths of water. Sensor nodes perform collective tasks such as data collection and data transmission to other nodes or Base Station (BS). The bottom nodes are located at depth of water, and are not able to communicate directly with the surface level nodes, these nodes require multi-hop communication with appropriate routing protocol. Therefore, an energy efficient routing protocols are used for such scenarios, which is necessary as well as challenging task. As sensors are battery operated devices, which are really problematic to recharge or replace. The error and propagation path delays are high in acoustic channels therefore underwater communication is much effected. Realizing the circumstances, more attention has been given to compare energy efficient routing protocols which comparatively consume low energy and achieve high throughput. This paper, comprises of analysis and comparison of existing UWSN based efficient energy routing protocols. Based upon the analysis and comparison, VBF and DBR have been proposed that fulfill the requirements. The analysis is done on NS-2 and for comparison, the performance metrics which are evaluated are: Packet delivery Ratio (PDR), energy consumption, throughput and average End to End (E2E) delay. The results show that VBF protocol consume very large amount of energy as compared to DBR protocol. Whereas DBR protocol have characteristics like low energy consumption, minimum delay high PDR and high throughput than VBF protocol.  

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.

scholarly journals An Energy-Efficient Clustering Routing Protocol Based on a High-QoS Node Deployment with an Inter-Cluster Routing Mechanism in WSNs

Sensors ◽  
2019 ◽  
Vol 19 (12) ◽  
pp. 2752 ◽  
Author(s):  
Kaida Xu ◽  
Zhidong Zhao ◽  
Yi Luo ◽  
Guohua Hui ◽  
Liqin Hu
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Base Station ◽  
Dijkstra Algorithm ◽  
Node Deployment ◽  
Deployment Strategy ◽  
Routing Mechanism ◽  
Energy Efficient Clustering ◽  
Information Integrity

Currently, wireless sensor network (WSN) protocols are mainly used to achieve low power consumption of the network, but there are few studies on the quality of services (QoS) of these networks. Coverage can be used as a measure of the WSN’s QoS, which can further reflect the quality of data information. Additionally, the coverage requirements of regional monitoring target points are different in real applications. On this basis, this paper proposes an energy-efficient clustering routing protocol based on a high-QoS node deployment with an inter-cluster routing mechanism (EECRP-HQSND-ICRM) in WSNs. First, this paper proposes formula definitions for information integrity, validity, and redundancy from the coverage rate and introduces a node deployment strategy based on twofold coverage. Then, in order to satisfy the uniformity of the distribution of cluster heads (CHs), the monitoring area is divided into four small areas centered on the base station (BS), and the CHs are selected in the respective cells. Finally, combined with the practical application of the WSN, this paper optimizes the Dijkstra algorithm, including: (1) nonessential paths neglecting considerations, and (2) a simultaneous introduction of end-to-end weights and path weights, achieving the selection of optimal information transmission paths between the CHs. The simulation results show that, compared with the general node deployment strategies, the deployment strategy of the proposed protocol has higher information integrity and validity, as well as lower redundancy. Meanwhile, compared with some classic protocols, this protocol can greatly reduce and balance network energy consumption and extend the network lifetime.

scholarly journals Design and Implementation of EOICHD Based Clustered Routing Protocol Variants for Wireless Sensor Networks

2021 ◽  
Vol 4 (2) ◽  
pp. 25
Author(s):  
Anupkumar Bongale ◽  
Arunkumar Bongale ◽  
Satish Kumar ◽  
Rahul Joshi ◽  
Kishore Bhamidipati
Keyword(s):  
Routing Protocol ◽  
Cluster Head ◽  
Residual Energy ◽  
Base Station ◽  
Energy Utilization ◽  
Wireless Sensor ◽  
Data Packets ◽  
Adaptive Clustering ◽  
Network Cluster ◽  
Leach Protocol

Efficient energy utilization and network life prolongation are primary objectives to be considered when designing a Wireless Sensor Network. Cluster-based routing protocols are most suitable for achieving such goals. Energy and Optimal Inter Cluster Head Distance (EOICHD) is a cluster-based hierarchical routing protocol inspired by the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol. EOICHD resolves the problems associated with LEACH protocol, such as selecting cluster head nodes in close proximity. By carefully selecting the cluster head nodes based on residual energy and optimal inter-cluster head distance, EOICHD ensures that selected cluster head nodes are separated by a certain optimal distance. This approach ensures uniform distribution of cluster head nodes across the entire network. The study of the EOICHD protocol presented so far is not sufficient. Hence, in this paper, we propose three variants of EOICHD protocol to understand its behavior in a better manner. A comparative analysis of all three EOICHD variants, LEACH and LEACH-central constrained (LEACH-C) protocol, is performed by considering comparative parameters such as alive nodes, cumulative network energy, data packets arrived at the base station, and stability of the network.

Sign in / Sign up

Export Citation Format

Share Document