센서 네트워크에서의 거리기반 에너지 효율적인 라우팅 알고리즘 연구

Abstract

Clustering Scheme enabling the efficient utilization of the limited energy resources of the deployed sensor nodes can effectively prolong the lifetime of wireless sensor networks. The most common technique in famous clustering algorithm is a probabilistic clustering scheme based on a randomized cluster-head rotation for distributing the energy consumption among nodes in each cluster. Because most of these algorithms mainly utilize residual energy of each node as the criterion of clusterhead election, these schemes have demerit that the unbalanced energy consumption among cluster-heads is occurred. To overcome this demerit, this thesis considers a distance from the base station to cluster-heads as well as the residual energy as the criterion of cluster-head election for balanced energy consumption among cluster-heads. Through simulation experiments, this thesis shows that the proposed algorithm is more effective than LEACH and DAUCH in prolonging the lifetime of wireless sensor networks.