On the Study of Distributed Clustering Method Using Minimum Spanning Tree

碩士 === 國立臺中科技大學 === 資訊管理系碩士班 === 105 === Wireless sensor network (WSNs) is limited by many power sensors, and are often deployed in a sparsely populated place, so how to effectively save energy and prolong the sensor network lifetime has become an important issue. One of the most common and efficien...

Full description

Bibliographic Details
Main Authors: Ming-Yang Hsu, 許明陽
Other Authors: 陳大仁
Format: Others
Language:zh-TW
Published: 2017
Online Access:http://ndltd.ncl.edu.tw/handle/8wf2w7
Description
Summary:碩士 === 國立臺中科技大學 === 資訊管理系碩士班 === 105 === Wireless sensor network (WSNs) is limited by many power sensors, and are often deployed in a sparsely populated place, so how to effectively save energy and prolong the sensor network lifetime has become an important issue. One of the most common and efficient energy saving method for cluster method, the wireless sensor network is divided into clusters, each cluster to elect a cluster head collects sensor data, and finally sent to the base station. This method can effectively reduce the energy loss of the whole network, but will lead to rapid death of the cluster head, so we propose CEMST algorithm, the cluster head selection considering node overlap degrees(overlapping degrees), density and residual energy, and transmission path using Dijkstra shortest path algorithm and the minimum spanning tree (MST) in the Borůvka algorithm, reduce power loss and balance the cluster, and extend the network lifetime.