计算机工程Issue(1)：93-97,5.DOI:10.3969/j.issn.1000-3428.2014.01.019
无线传感器网络中的改进数据聚集调度算法
Improved Data Aggregation Scheduling Algorithm in Wireless Sensor Networks
摘要
Abstract
An improved approximation data aggregation scheduling algorithm for Minimum Data Aggregation Latency(MDAL) is presented due to the existing algorithms have a high time latency bound. A Breadth First Search(BFS) tree rooted at the center node is constructed in this algorithm. And then, a Maximal Independent Set(MIS) is found layer by layer and the adjacent dominators have only 2-hop away from each other. A data aggregation scheduling tree rooted at the center node is formed by using some nodes to connect the nodes in MIS. Thus, the node’s data can be scheduled layer by layer according to the data aggregation scheduling tree. For every dominator, it always connects its 2-hop neighboring dominators using minimal connectors. For the common neighboring dominators of two adjacent dominators, they select a dominator which is close to the center node to join the data aggregation scheduling tree so as to send their data to it. Using this method, the latency for the sink collecting all sensors’ data is reduced greatly. Simulation results show that compared with SAS algorithm, Guo’s algorithm and IAS algorithm, this algorithm has lower average latency than previous works and it has a latency bound of 14R+△-10.关键词
数据聚集/最小延时/无陑传感器网络/数据调度算法/圆盘图/传输冲突Key words
data aggregation/minimum latency/Wireless Sensor Networks(WSNs)/data scheduling algorithm/disk graph/transmitting collision分类
信息技术与安全科学引用本文复制引用
刘文彬,李香宝,付沙,刘红冰,文志强..无线传感器网络中的改进数据聚集调度算法[J].计算机工程,2014,(1):93-97,5.基金项目
国家自然科学基金资助项目(61170102)；湖南省自然科学基金资助项目(11JJ3070)；湖南省教育厅高等学校科学研究基金资助项目(11C0215,12C0558)；湖南省重点学科建设项目 （61170102）
