FEHCA: A Fault-Tolerant Energy-Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks

نویسندگان

چکیده

Technological advancements have led to increased confidence in the design of large-scale wireless networks that comprise small energy constraint devices. Despite boost technological advancements, dissipation and fault tolerance are amongst key deciding factors while designing deploying sensor networks. This paper proposes a Fault-tolerant Energy-efficient Hierarchical Clustering Algorithm (FEHCA) for (WSNs), which demonstrates energy-efficient clustering fault-tolerant operation cluster heads (CHs). It treats CHs as no special node but equally prone faults normal sensing nodes cluster. The proposed scheme addresses some limitations prominent hierarchical algorithms, such randomized election after each round, results significant dissipation; non-consideration residual selecting heads, etc. utilizes capability vector quantization partition deployed sensors into an optimal number clusters ensures almost entire area be monitored is alive most network’s lifetime. supports better decision-making compared decisions made on basis limited data few rounds communication. implemented both friendly well hostile deployments. simulation encouraging validate algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid Bio-Inspired Clustering Algorithm for Energy Efficient Wireless Sensor Networks

In order to achieve the sensing, communication and processing tasks of Wireless Sensor Networks, an energy-efficient routing protocol is required to manage the dissipated energy of the network and to minimalize the traffic and the overhead during the data transmission stages. Clustering is the most common technique to balance energy consumption amongst all sensor nodes throughout the network. I...

متن کامل

An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks

A wireless network consisting of a large number of small sensors with low-power transceivers can be an effective tool for gathering data in a variety of environments. The data collected by each sensor is communicated through the network to a single processing center that uses all reported data to determine characteristics of the environment or detect an event. The communication or message passi...

متن کامل

An Energy Efficient Clustering Method using Bat Algorithm and Mobile Sink in Wireless Sensor Networks

Wireless sensor networks (WSNs) consist of sensor nodes with limited energy. Energy efficiency is an important issue in WSNs as the sensor nodes are deployed in rugged and non-care areas and consume a lot of energy to send data to the central station or sink if they want to communicate directly with the sink. Recently, the IEEE 802.15.4 protocol is employed as a low-power, low-cost, and low rat...

متن کامل

An Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks

LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...

متن کامل

proposing a novel algorithm for fault-tolerant relay node placement in wireless sensor networks

wireless sensor networks are composed of hundreds or thousands of small nodes called sensor that work together and are associated with a specific task or tasks to do. each of these nodes includes sensor, processor, communication components, a small memory and a source of energy. it is expected that wireless sensor networks will be used widely in many applications in near future. scalability and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Energies

سال: 2021

ISSN: ['1996-1073']

DOI: https://doi.org/10.3390/en14133935