文档下载 文档下载导航
设为首页 | 加入收藏
搜索 请输入内容:  
 导航当前位置: 文档下载 > 所有分类 > Self Organizing Sensors by Minimization of Cluster Heads Using Intelligent Clustering Abstr
侵权投诉

Self Organizing Sensors by Minimization of Cluster Heads Using Intelligent Clustering Abstr

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

2. The Clustering Problem

Clustering problem can be defined as following. Assume that nodes are randomly dispersed in a field. At the end of clustering process, each node belongs to only one cluster and be able to communicate with the cluster head directly via a single hop [3]. Each cluster consists of a single cluster head and a bunch of followers as illustrated in Figure 1. The purpose of the clustering algorithm is to form the smallest number of clusters that makes all nodes of network to belong to one cluster. Minimizing the number of cluster heads would not only provide an efficient cover of the whole network but also minimizes the cluster overlaps. This reduces the amount of channel contention between clusters, and also improves the efficiency of algorithms that executes at the level of the cluster-heads.

Self Organizing Sensors by Minimization of Cluster Heads Using Intelligent Clustering Abstr

Figure 1. Clustering in a sensor network

3. Self Organizing Sensor (SOS) Networks by Minimization of Cluster Heads Using Intelligent Clustering

This Section presents the proposed clustering algorithm in a global scale, and the following section describes the algorithm at a node level.

3.1 Global level of clustering algorithm

The following steps illustrate an overview of the suggested algorithm.

1. Find the node (No), which has the maximum number of followers, and make a cluster with it.

2. Include clustered nodes into a clustered node set G.

3. Selects the next head node (Nf), which can communicate with a node in G and has the maximum

number of followers, and make a cluster with it.

4. If there exist an unclustered node or nodes then go to step 2

5. Else terminate the algorithm.

At first, it makes a cluster with the center node which has the maximum number of followers. We assume that there is a coordinator which controls globally in the entire network (for easy understanding). So it does not matter to locate the center node during step 1. In step 2, it includes the selected cluster head node and its followers to the clustered node set G. And in step 3, it selects the node, which can communicate with a node in G and has the maximum number of followers, and makes a cluster with it as a cluster head and include it and its follower to set G. Figure 2 illustrates step 3. A node 'a' is No node and node 'b' is the node which can communicate with the next head node (that is, node 'c'), which has the maximum number of followers. Then it elects node 'c' as a next cluster head node and makes a cluster with it. The process is then repeated until all the nodes are clustered.

上一页第3页

你可能喜欢

热门文档

相关文档

站点地图 | 文档上传 | 侵权投诉 | 手机版
本站所有资源均来自互联网,本站只负责收集和整理,均不承担任何法律责任,如有侵权等其它行为请联系我们.
文档下载 Copyright 2013 doc.guandang.net All Rights Reserved.  -  email