What is it about?

The article is about how efficiently we can use the energy of Wireless Sensor Networks (WSNs). WSNs are the group of sensors that form a network and can be very effective in areas where human presence is quite difficult. These sensors are powered by external resources like batteries, and the main task is to sense the nearby environment and transfer this information to some remote location (base station) by forming the optimal network. The energy consumption to transmit the data is directly proportional to the distance between the source and destination. So, in this work, our main motive is to select the optimal path between nodes to the base station. The whole communication is carried out with the help of some intermediate node (i.e. cluster head). In this paper, we tried to select the cluster heads in such a way that prolong the lifetime of the network.

Featured Image

Why is it important?

In previous works, the algorithms can work either only with homogeneous or heterogeneous types of sensor nodes, but due to dynamic clustering; our algorithm can efficiently work with homogeneous as well as heterogeneous nodes. The work is important because the selection of Cluster heads is an NP-Hard problem, so we always have to search for more optimal solutions.

Read the Original

This page is a summary of: Dynamic Cluster Head Selection in WSN, ACM Transactions on Embedded Computing Systems, May 2024, ACM (Association for Computing Machinery),
DOI: 10.1145/3665867.
You can read the full text:

Read

Contributors

The following have contributed to this page