원문정보
초록
영어
Wireless sensor networks are normally utilized for monitoring and controlling of specific environments. They are made out of a large number of low-cost sensor nodes which are densely separated in distributed environments. The information collected by sensors should be transmitted to a base station. Recent developments indicate that the interest in applications of wireless sensor networks has increased and expanded on a large scale. One of the most important issues in this type of networks is limited energy. Clustering is a suitable method for increasing network lifetime that protects the limited sensor resources by energy saving. Meta-heuristic algorithms have been widely used for clustering of wireless sensor networks. In most complicated problems, it is required to evaluate a multitude of possible modes, to determine an accurate answer. Meta-heuristic algorithms can provide an answer in acceptable time constraints. They play an effective role in solving such problems by optimizing the energy consumption of the networks that has a significant impact on the network lifetime. In this paper, the application of clustering algorithms in wireless sensor networks has been investigated. The selected clustering methods are based on the meta-heuristic algorithms.
목차
1. Introduction
2. Comparison Criteria of Clustering Algorithms
3. Clustering Algorithms in Wireless Sensor Networks
4. Analysis and Discussion
5. Conclusion
References