| 摘要: |
| 形式地给出了针对无线传感器网络中数据聚合的一种最优调度结构,并利用不同权值的二叉树评估了这个结构的分析过程.实例表明,当网络规模不是很大时,该策略的分析是准确的.在考虑到聚合的情况下,底部边界随着树的规模而成正比增长,当n取值为25时,分析结果与最优折线已经非常接近.但是当网络规模开始大幅度增长时,这种调度策略不再能够保持是最优的. |
| 关键词: 传感器网络 二叉树 调度策略 数据聚合 |
| DOI： |
| 分类号: |
| 基金项目:江苏省自然科学基金(BK2009393);南京林业大学物联网专项创新基金(163070057) |
|
| Scheduling Policy Based on Binary Tree for Data Aggregation in Wireless Sensor Networks |
|
LIU Xiao-Feng1, WANG Yi-Xiong1, ZHANG Zi-Qi2, YE Ning1
|
|
1.Department of Computer Science and Engineering, Nanjing Forestry University, Nanjing 210037, China;2.Department of Computer Science, University of Sheffiled, Sheffiled S1 4DP, UK
|
| Abstract: |
| An optimal scheduling structure for data aggregation in wireless sensor networks is proposed.The paper evaluates this scheduling policy with different-weight based binary tree networks.The analysis and experiments indicate that the total delay in whole network can be efficiently decreased by using this scheduling policy,especially when the number of binary nodes in the experiment equals to 25,the result approaches the most optimal line.Unfortunately,this scheduling cannot maintain stability when network scale improves rapidly. |
| Key words: sensor network binary tree scheduling policy data aggregation |
