D. Choi and I. Chung (Korea)
Sensor network, Cluster, Reactive Network, Thresholdvalue
In wireless sensor networks, a clustering protocol is an efficient method to prolong network lifetime. But, in general, it results in more energy consumption at the cluster-head node. Hence, such a protocol must changes the cluster formation and cluster-head node in each round to prolong the network lifetime. But, this method also causes large amount of energy consumption during setup process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new clustering algorithm. Our scheme excludes duplicated data of adjacent nodes. We define a group as the sensor nodes within close proximity of each other. In a group, a node senses and transmits data at a time on the round robin basis. In a view of whole network, group is treated as one node. During the setup phase of a round, clusters are formed first and then they are re-clustered (high level cluster) by choosing cluster-heads (group). In the group with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of group size. . As a result of analysis and comparison, our scheme reduces energy consumption of nodes. Also it can improve the efficiency of communications in sensor networks compared with current clustering methods.
Important Links:
Go Back
