作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (3): 97-99. doi: 10.3969/j.issn.1000-3428.2012.03.033

• 网络与通信 • 上一篇    下一篇

无线传感器网络邻近节点数据融合调度算法

许新琳,郑 瑾,王国军   

  1. (中南大学信息科学与工程学院,长沙 410083)
  • 收稿日期:2011-07-24 出版日期:2012-02-05 发布日期:2012-02-05
  • 作者简介:许新琳(1986-),男,硕士研究生,主研方向:无线传感器网络;郑 瑾,副教授、博士;王国军,教授、博士生导师
  • 基金资助:
    国家自然科学基金资助项目(61073037);湖南省杰出青年科学基金资助项目(07JJ1010)

Contiguous Node Data Aggregation Scheduling Algorithm in Wireless Sensor Network

XU Xin-lin, ZHENG Jin, WANG Guo-jun   

  1. (School of Information Science and Engineering, Central South University, Changsha 410083, China)
  • Received:2011-07-24 Online:2012-02-05 Published:2012-02-05

摘要: 现有的调度算法存在节点能耗大、数据收集时延长等问题。为此,提出一种能量高效的邻近节点数据融合调度(CNDAS)算法。该算法通过计算竞争集,产生无冲突的调度序列,并为兄弟节点分配连续的传输时隙,从而降低节点状态转换的频率,节省节点能耗。模拟结果表明,当网络规模较大时,CNDAS算法的能量有效性明显优于SCHDL算法。

关键词: 无线传感器网络, 数据融合, 邻近节点数据融合调度, 状态转换, 时隙, 竞争集

Abstract: Existing scheduling algorithms have the problems of large energy consumption and high latency for data collection. So this paper proposes an energy-efficient algorithm called Contiguous Node Data Aggregation Scheduling(CNDAS), which generates a collision-free schedule by computing nodes’ competitor sets. It assigns sibling nodes consecutive time slots to reduce the frequency of state transitions and to reduce the energy consumption of sensor nodes. Simulation results show that CNDAS outperforms SCHDL algorithm when the network scale is large.

Key words: Wireless Sensor Network(WSN), data aggregation, Contiguous Node Data Aggregation Scheduling(CNDAS), state transition, time slot, competitor set

中图分类号: