Some Adaptive Clustering Algorithms

1993 ◽  
pp. 27-31
Author(s):  
Hans-Joachim Mucha
Author(s):  
Wilson Wong

Feature-based semantic measurements have played a dominant role in conventional data clustering algorithms for many existing applications. However, the applicability of existing data clustering approaches to a wider range of applications is limited due to issues such as complexity involved in semantic computation, long pre-processing time required for feature preparation, and poor extensibility of semantic measurement due to non-incremental feature source. This chapter first summarises the many commonly used clustering algorithms and feature-based semantic measurements, and then highlights the shortcomings to make way for the proposal of an adaptive clustering approach based on featureless semantic measurements. The chapter concludes with experiments demonstrating the performance and wide applicability of the proposed clustering approach.


2016 ◽  
Vol 5 (1) ◽  
pp. 63-72 ◽  
Author(s):  
Derssie D. Mebratu ◽  
Charles Kim

Abstract. Increasing the lifespan of a group of distributed wireless sensors is one of the major challenges in research. This is especially important for distributed wireless sensor nodes used in harsh environments since it is not feasible to replace or recharge their batteries. Thus, the popular low-energy adaptive clustering hierarchy (LEACH) algorithm uses the “computation and communication energy model” to increase the lifespan of distributed wireless sensor nodes. As an improved method, we present here that a combination of three clustering algorithms performs better than the LEACH algorithm. The clustering algorithms included in the combination are the k-means+ + , k-means, and gap statistics algorithms. These three algorithms are used selectively in the following manner: the k-means+ +  algorithm initializes the center for the k-means algorithm, the k-means algorithm computes the optimal center of the clusters, and the gap statistics algorithm selects the optimal number of clusters in a distributed wireless sensor network. Our simulation shows that the approach of using a combination of clustering algorithms increases the lifespan of the wireless sensor nodes by 15 % compared with the LEACH algorithm. This paper reports the details of the clustering algorithms selected for use in the combination approach and, based on the simulation results, compares the performance of the combination approach with that of the LEACH algorithm.


Author(s):  
Hamid Barkouk ◽  
El Mokhtar En-Naimi ◽  
Aziz Mahboub

The longevity of the network and the lack of resources are the main problems within the WSN. Minimizing energy dissipation and optimizing the lifespan of the WSN network are real challenges in the design of WSN routing protocols. Load balanced clustering increases the reliability of the system and enhances coordination between different nodes within the network. WSN is one of the main technologies dedicated to the detection, sensing, and monitoring of physical phenomena of the environment. For illustration, detection, and measurement of vibration, pressure, temperature, and sound. The WSN can be integrated into many domains, like street parking systems, smart roads, and industrial. This paper examines the efficiency of our two proposed clustering algorithms: Fuzzy C-means based hierarchical routing approach for homogeneous WSN (F-LEACH) and fuzzy distributed energy efficient clustering algorithm (F-DEEC) through a detailed comparison of WSN performance parameters such as the instability and stability duration, lifetime of the network, number of cluster heads per round and the number of alive nodes. The fuzzy C-means based on hierarchical routing approach is based on fuzzy C-means and low-energy adaptive clustering hierarchy (LEACH) protocol. The fuzzy distributed energy efficient clustering algorithm is based on fuzzy C-means and design of a distributed energy efficient clustering (DEEC) protocol. The technical capability of each protocol is measured according to the studied parameters.


Author(s):  
Sama Hussam Sabah ◽  
Muayad Sadik Croock

Energy-efficiency ofwireless sensor networks (WSN) becomes an essential issue in the research area. This is because of the energy constraints in WSN that depend on a battery, which is difficult to replace or recharge; therefore, multiple clustering algorithms were proposed to achieve efficiency in using the available energy as much as possible. This paper proposed energy-efficient and fault-tolerance algorithms that enhance thelow energy adaptive clustering hierarchy (LEACH) protocol by three algorithms. The first focuses on selecting the best cluster head and the second focuses on minimizing the required nodes within the same cluster. Simultaneously, the third fault tolerance algorithm uses software engineering techniques like sleep schedules to increase network lifetime as much as possible. The testing results of the proposed algorithms prove the claim of enhancing the lifetime of WSN. In order to check improvement of lifetime of WSN we have compered the results of the proposed algorithms with standered algorthim. The results show prove the claim of enhancing the life-time of WSN, where the total lifetime of WSN rise from about 550 rounds to reach 4100 when utilized self-checking process and rised up to 5200 after enhance minimum distans.


Sign in / Sign up

Export Citation Format

Share Document