Minimization of the number of cluster heads in a wireless sensor network is a very important problem to reduce channel contention and to improve the efficiency of the algorithm when executed at the level of cluster-heads. This paper proposes a Self Organiz
Self Organizing Sensors by Minimization of Cluster Heads
Using Intelligent Clustering
Kwangcheol Shin, Ajith Abraham*1 and Sang Yong Han*
Department of Computer Science & Engineering
University of Minnesota, Minneapolis, MN 55455, USA
*School of Computer Science and Engineering, Chung-Ang University
221, Heukseok-dong, Dongjak-gu, Seoul 156-756, Korea
Abstract
Minimization of the number of cluster heads in a wireless sensor network is a very important problem to reduce channel contention and to improve the efficiency of the algorithm when executed at the level of cluster-heads. This paper proposes a Self Organizing Sensor (SOS) network based on an intelligent clustering algorithm which does not require many user defined parameters and random selection to form clusters like in Algorithm for Cluster Establishment (ACE) [2]. The proposed SOS algorithm is compared with ACE and the empirical results clearly illustrate that the SOS algorithm can reduce the number of cluster heads.
1. Introduction and Related Research
Research in wireless sensor networks has been growing rapidly along with the development of low-cost micro devices and wireless communication technologies [1]. Some of the research related to scientific, medical, military and commercial usage has gone to the background [4].
Sensor networks are composed of hundreds to myriads of sensor nodes, which appear to be sprinkled randomly by a car or airplane. Each node has strict limitation in the usage of electric power, computation and memory resources. They typically utilize intermittent wireless communication. Therefore, sensor networks should be well-formed to achieve its purposes. Clustering is a fundamental mechanism to design scalable sensor network protocols. The purpose of clustering is to divide the network by some disjoint clusters. Through clustering, we can reduce routing table sizes, redundancy of exchanged messages, energy consumption and extend a network’s lifetime. By introducing the conventional clustering approach to the sensor networks provides a unique challenge due to the fact that cluster-heads, which are communication centers by default, tend to be heavily utilized and thus drained of their battery power rapidly. Algorithm for Cluster Establishment (ACE) [2] clusters the sensor network within a constant number of iterations using the node degree as the main parameter. Some of the weaknesses of ACE are: First, ACE randomly selects candidate node in each iteration, which creates different results each time on the same sensor network. Second, spawning threshold function is used in ACE to control the formation of new cluster by using two manually adjusted parameters. ACE performance relies on these parameters which are usually manually adjusted according to the size and shape of a sensor network.
In the literature, besides ACE, there are some related works on forming and managing clusters for sensor networks. For examples, LEACH [5] rotates the role of a cluster head randomly and periodically over all the nodes to prevent early dying of cluster heads. Guru et al. [6] consider energy minimization of the 1Corresponding author email: ajith.abraham@ieee.org
built using piezoelectric quartz crystal sensors. ...feed-forward network theory and self-organizing ... v i ) (6) The minimization of the c-means...
built using piezoelectric quartz crystal sensors. ...feed-forward network theory and self-organizing ... v i ) (6) The minimization of the c-means...
热门文档