Minimum-Hot-Spot Query Trees for Wireless Sensor Networks

Weproposeadistributedalgorithmtoconstructabalancedcommunication tree that serves in gathering data from the network nodes toasink. Ouralgorithmconstructsanear-optimallybalancedcommunication tree with minimum overhead. The balancing of the nodedegreesresultsintheminimizationofpacketcollisionsduring query execution, that would otherwise require numerous retransmissions and reduce the lifetime of the network. We compare our simple distributed algorithm against previous work and a centralizedsolutionandshowthatformostnetworklayoutsitoutperforms competition and achieves tree balance very close to the centralized algorithm. Italsohasthesmallestenergyoverheadpossibletoconstructthe tree, increasing the lifetime of the network even more

モバイルシンクを用いた無線センサネットワークにおける省電力データ収集に関する研究

Tohoku University加藤寧課