Bundling Messages to Reduce the Cost of Tree-Based Broadcast Algorithms

International audienceHierarchical broadcast strategies based on trees are scalable since they distribute the workload among processes and disseminate messages in parallel. In this work we propose an efficient best-effort broadcast algorithm that employs multiple spanning trees to propagate messages that are bundled on tree intersections. The algorithm is autonomic in the sense that it employs dynamic trees rooted at the source process and which rebuild themselves after processes crash. Experimental results obtained with simulation are presented showing the performance to the algorithm in terms of the latency and the number and sizes of messages employed

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

Tohoku University加藤寧課

Enhancing wireless sensor networks functionalities

 The main objective of this thesis is to develop solutions for the existing research problems in wireless sensor networks that negatively influence their performances. To achieve that four main research gaps from collecting, aggregating and transferring data with considering different deployment methods of sensor nodes were addressed