Evolution of Advanced Clustering Methods in WSN: A Review
---
paper_title: Wireless sensor networks: a survey

paper_content:

This paper describes the concept of sensor networks which has been made viable by the convergence of micro-electro-mechanical systems technology, wireless communications and digital electronics. First, the sensing tasks and the potential sensor networks applications are explored, and a review of factors influencing the design of sensor networks is provided. Then, the communication architecture for sensor networks is outlined, and the algorithms and protocols developed for each layer in the literature are explored. Open research issues for the realization of sensor networks are also discussed.
---
paper_title: The Design and Simulation of a Mobile Radio Network with Distributed Control

paper_content:

A new architecture for mobile radio networks, called the linked cluster architecture, is described, and methods for implementing this architecture using distributed control techniques are presented. We illustrate how fully distributed control methods can be combined with hierarchical control to create a network that is robust with respect to both node loss and connectivity changes. Two distributed algorithms are presented that deal with the formation and linkage of clusters and the activation of the network links. To study the performance of our network structuring algorithms, a simulation model was developed. The use of Simula to construct, software simulation tools is illustrated. Simulation results are shown for the example of a high frequency (HF) intratask force (ITF) communication network.
---
paper_title: A clustering scheme for hierarchical control in multi-hop wireless networks

paper_content:

In this paper we present a clustering scheme to create a hierarchical control structure for multi-hop wireless networks. A cluster is defined as a subset of vertices, whose induced graph is connected. In addition, a cluster is required to obey certain constraints that are useful for management and scalability of the hierarchy. All these constraints cannot be met simultaneously for general graphs, but we show how such a clustering can be obtained for wireless network topologies. Finally, we present an efficient distributed implementation of our clustering algorithm for a set of wireless nodes to create the set of desired clusters.
---
paper_title: Improvement on LEACH by combining Adaptive Cluster Head Election and Two-hop transmission

paper_content:

LEACH is a popular hierarchical routing protocol which efficiently maintains the energy storage of nodes in Wireless Sensor Network (WSN). The nodes using LEACH are divided into clusters. The randomized rotation of cluster head in each cluster can save the energy consumption of nodes. However, the random election of cluster heads without considering nodes' residual energy may reduce and oscillate the lifespan of network. In this paper, we have proposed the Adaptive Cluster Head Election and Two-hop LEACH protocol (ACHTH-LEACH) to prolong the lifespan of network. It improves LEACH by using an adaptive algorithm of cluster head election and allowing multi-top transmission among cluster heads and Base Station (BS). Nodes are tagged as near nodes or far nodes according to the distances to the BS. The near nodes belong to one cluster while the far nodes are divided into different clusters by the Greedy K-means algorithm. The cluster head is shifted and the node with the maximal residual energy in each cluster is elected. During the data transmission phase, the far cluster heads may select the cluster head in the near area as the next hop or communicate directly to the BS. The simulation results have shown that ACHTH-LEACH outperforms several existing protocols in terms of network's lifespan. Especially, ACHTH-LEACH can achieve more than 2 times longer lifespan than LEACH and build a more stable routing environment.
---
paper_title: Distributed Energy-Efficient Hierarchical Clustering for Wireless Sensor Networks

paper_content:

Since nodes in a sensor network have limited energy, prolonging the network lifetime and improving scalability become important. In this paper, we propose a distributed weight-based energy-efficient hierarchical clustering protocol (DWEHC). Each node first locates its neighbors (in its enclosure region), then calculates its weight which is based on its residual energy and distance to its neighbors. The largest weight node in a neighborhood may become a clusterhead. Neighboring nodes will then join the clusterhead hierarchy. The clustering process terminates in O(1) iterations, and does not depend on network topology or size. Simulations show that DWEHC clusters have good performance characteristics.
---
paper_title: ANCAEE: A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks

paper_content:

One of the major constraints of wireless sensor networks is limited energy available to sensor nodes because of the small size of the batteries they use as source of power. Clustering is one of the routing techniques that have been using to minimize sensor nodes’ energy consumption during operation. In this paper, A Novel Clustering Algorithm for Energy Efficiency in Wireless Sensor Networks (ANCAEE) has been proposed. The algorithm achieves good performance in terms of minimizing energy consumption during data transmission and energy consumptions are distributed uniformly among all nodes. ANCAEE uses a new method of clusters formation and election of cluster heads. The algorithm ensures that a node transmits its data to the cluster head with a single hop transmission and cluster heads forward their data to the base station with multi-hop transmissions. Simulation results show that our approach consumes less energy and effectively extends network utilization.
---
paper_title: Sector based Multi-hop Clustering Protocol for Wireless Sensor Networks

paper_content:

Minimization of energy consumption is a critical design requirement for most wireless sensor networks (WSNs) applications. WSNs are composed of small, energy constrained sensor nodes. The random deployment of sensor nodes in many applications requires unattended operation. The primary goal of WSNs is how to collect sensed information in energy efficient way since the energy is limited. The network lifetime is extended by hierarchical network clustering. In these networks, the sensor field is partitioned into small regions called clusters. Some of the nodes in the network become cluster head (CH), which aggregates the data collected from their member nodes, and transmit it to the base station using multi-hop communication. Numerous clustering protocols have been proposed in the literature to minimize the energy consumption among the sensor nodes. In this paper, an energy efficient clustering protocol for WSNs with a primary goal of increasing the lifetime of the network is proposed. The protocol named as sector based multi-hop clustering (SBMC), which uses the concept of leveling, sectoring and multi-hop clustering. Dissemination of data from CH to base station is done in such a way that the energy loss in discovering a route is decreased to minimum. The additional computation for the leveling and sectoring are carried out in base station just at the beginning of the network setup. Therefore, the goal of energy efficiency without additional energy consumption of the distributed nodes after network setup process in proposed SBMC protocol is achieved.
---

Title: Evolution of Advanced Clustering Methods in WSN: A Review

Section 1: INTRODUCTION
Description 1: Introduce the topic of wireless sensor networks (WSNs), their applications, and the unique characteristics and challenges of WSNs. Explain the importance of clustering in WSNs and provide an overview of the paper's structure.

Section 2: Basic Clustering Protocols in WSN
Description 2: Review foundational clustering algorithms in WSN, such as Linked Cluster Algorithm (LCA), Hierarchical Control Clustering, LEACH, HEED, and Energy-efficient hierarchical clustering (EEHC).

Section 3: Improvements in Basic Clustering Protocols
Description 3: Examine enhancements and modifications made to basic clustering protocols, including ACTH-LEACH, TL-LEACH, HCTE, and Weight-Based Energy-Efficient Hierarchical Clustering (DWEHC).

Section 4: Architecture Based Clustering Protocols
Description 4: Discuss clustering protocols that leverage specific architectural designs and how these designs improve network performance.

Section 5: Sectoring Based Clustering Protocols
Description 5: Analyze clustering protocols that use partitioning and sectoring techniques, such as Partition based LEACH algorithm (p-LEACH), Power Aware Sectoring Based Clustering Algorithm (PASCAL), and Sector based Multi-hop Clustering Protocol for Wireless Sensor Networks (SBMC).

Section 6: COMPARISON OF THE STRATEGIES
Description 6: Compare the performance and characteristics of the various clustering algorithms discussed in the previous sections. Highlight advantages, disadvantages, and the impact on network lifetime.

Section 7: CONCLUSION
Description 7: Summarize the key points discussed throughout the paper. Emphasize the evolution of clustering algorithms, their benefits, drawbacks, and potential areas for future research in enhancing network lifetime.