Scheduling Policy Based on Binary Tree for Data Aggregation in Wireless Sensor Networks
DOI:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    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.

    Reference
    Related
    Cited by
Get Citation

刘晓峰,王一雄,张子奇,业宁.一种基于二叉树的无线传感器网络数据聚合调度策略.软件学报,2011,22(zk1):142-148

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:May 02,2011
  • Revised:July 29,2011
  • Adopted:
  • Online: January 02,2012
  • Published:
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063