Load-balanced trees for data collection in wireless sensor networks

Chung Kuo Huang, Guey Yun Chang, Jang Ping Sheu

研究成果: 書貢獻/報告類型會議論文篇章同行評審

7 引文 斯高帕斯(Scopus)

摘要

In static wireless sensor networks, it is an important research issue to achieve effectively periodic data collection and prolong the network lifetime. In this paper, a distributed k-load-balanced tree scheme is proposed to prolong the network lifetime for periodic data collection. A k-load-balanced tree is a tree that the difference of the number of children of each two non-leaf nodes in a network is less than k. Each node chooses the node with the least current number of children and number of neighbor as parent for avoiding that the difference of the number of children of each two non-leaf nodes in a network is more than k. The simulation results show that our scheme can prolong the network lifetime and the network delay time is close to the result of centralized method.

原文???core.languages.en_GB???
主出版物標題Proceedings - 41st International Conference on Parallel Processing Workshops, ICPPW 2012
頁面474-479
頁數6
DOIs
出版狀態已出版 - 2012
事件41st International Conference on Parallel Processing Workshops, ICPPW 2012 - Pittsburgh, PA, United States
持續時間: 10 9月 201213 9月 2012

出版系列

名字Proceedings of the International Conference on Parallel Processing Workshops
ISSN(列印)1530-2016

???event.eventtypes.event.conference???

???event.eventtypes.event.conference???41st International Conference on Parallel Processing Workshops, ICPPW 2012
國家/地區United States
城市Pittsburgh, PA
期間10/09/1213/09/12

指紋

深入研究「Load-balanced trees for data collection in wireless sensor networks」主題。共同形成了獨特的指紋。

引用此