Distance-Balanced Clustering Algorithm for Wireless Sensor Networks
碩士 === 朝陽科技大學 === 資訊工程系碩士班 === 102 === The cluster-based framework can effectively reduce energy consumption and lower data transmission collision. Currently typical algorithms focus on how to select the best cluster head (CH), neglecting the position and distance of the CH. As a result, a lot of en...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/08944600012133426277 |
id |
ndltd-TW-102CYUT5392006 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-102CYUT53920062016-05-22T04:33:55Z http://ndltd.ncl.edu.tw/handle/08944600012133426277 Distance-Balanced Clustering Algorithm for Wireless Sensor Networks 距離平衡之無線感測網路叢集演算法 Yu-Jun Cai 蔡禹鈞 碩士 朝陽科技大學 資訊工程系碩士班 102 The cluster-based framework can effectively reduce energy consumption and lower data transmission collision. Currently typical algorithms focus on how to select the best cluster head (CH), neglecting the position and distance of the CH. As a result, a lot of energy is consumed when the CH transmits data. For this reason, an algorithm called the DBCA (Distance-Balanced Clustering Algorithm) that can effectively reduce each node’s energy consumption is put forward in this paper. In this algorithm, a sensor node will calculate its distance from the base station (BS), and use this distance as a factor for selecting the CH to ensure an even distance between the BS and the CHs and between each CHs. The even transmission distance was used to avoid unequal energy consumption caused by different transmission distances between CHs. The simulation results showed the algorithm can effectively reduce the whole network’s energy consumption and extend the network’s lifetime. Tzay-Farn Shih 施再繁 2014 學位論文 ; thesis 59 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 朝陽科技大學 === 資訊工程系碩士班 === 102 === The cluster-based framework can effectively reduce energy consumption and lower data transmission collision. Currently typical algorithms focus on how to select the best cluster head (CH), neglecting the position and distance of the CH. As a result, a lot of energy is consumed when the CH transmits data. For this reason, an algorithm called the DBCA (Distance-Balanced Clustering Algorithm) that can effectively reduce each node’s energy consumption is put forward in this paper. In this algorithm, a sensor node will calculate its distance from the base station (BS), and use this distance as a factor for selecting the CH to ensure an even distance between the BS and the CHs and between each CHs. The even transmission distance was used to avoid unequal energy consumption caused by different transmission distances between CHs. The simulation results showed the algorithm can effectively reduce the whole network’s energy consumption and extend the network’s lifetime.
|
author2 |
Tzay-Farn Shih |
author_facet |
Tzay-Farn Shih Yu-Jun Cai 蔡禹鈞 |
author |
Yu-Jun Cai 蔡禹鈞 |
spellingShingle |
Yu-Jun Cai 蔡禹鈞 Distance-Balanced Clustering Algorithm for Wireless Sensor Networks |
author_sort |
Yu-Jun Cai |
title |
Distance-Balanced Clustering Algorithm for Wireless Sensor Networks |
title_short |
Distance-Balanced Clustering Algorithm for Wireless Sensor Networks |
title_full |
Distance-Balanced Clustering Algorithm for Wireless Sensor Networks |
title_fullStr |
Distance-Balanced Clustering Algorithm for Wireless Sensor Networks |
title_full_unstemmed |
Distance-Balanced Clustering Algorithm for Wireless Sensor Networks |
title_sort |
distance-balanced clustering algorithm for wireless sensor networks |
publishDate |
2014 |
url |
http://ndltd.ncl.edu.tw/handle/08944600012133426277 |
work_keys_str_mv |
AT yujuncai distancebalancedclusteringalgorithmforwirelesssensornetworks AT càiyǔjūn distancebalancedclusteringalgorithmforwirelesssensornetworks AT yujuncai jùlípínghéngzhīwúxiàngǎncèwǎnglùcóngjíyǎnsuànfǎ AT càiyǔjūn jùlípínghéngzhīwúxiàngǎncèwǎnglùcóngjíyǎnsuànfǎ |
_version_ |
1718274937992511488 |