基于连通支配集的WSN自适应数据调度算法  

Adaptive Data Scheduling Algorithm in WSN Based on Connected Dominating Set

作　　者：孔凡凤 欧红玉 龙林德 陈曦[2] 

机构地区：[1]湖南邮电职业技术学院移动通信系,长沙410115 [2]长沙理工大学计算机与通信工程学院,长沙410114

出　　处：《计算机工程》2015年第10期94-98,104,共6页Computer Engineering

基　　金：国家自然科学基金青年基金资助项目(61303043)

摘　　要：在无线传感器网络中通过构建连通支配集来组成虚拟的骨干,使网络数据的收集变得层次化,更可以防止节点的死亡造成数据链的断裂,然而最小的连通支配集不能均衡各节点的能量消耗,导致部分节点过早死亡。为此,基于连通支配集的无线传感器网络,提出一种自适应的数据调度算法,通过选择能量和度比较大的节点组成支配集,支配集组成较高能量的网络骨干,数据经过自适应的调度沿着较小规模的网络骨干寻找路由直到发给基站。实验结果表明,该算法在较小的网络规模中具有容错性,可以减少能量消耗并延长网络生命周期。In Wireless Sensor Network（WSN）constructing connected dominating set based virtual backbone,help to optimize multi-level hierarchical networks,which prevents the node＇s death caused by the death of the data link.However,the minimum connected dominating set can not balance the energy consumptions to premature death.This paper presents an adaptive data gathering algorithm in WSN based on connected dominating set.Connected set by selecting the node has high energy and large degree from a dominating set which forms higher energy network backbone.Data through adaptive scheduling along the smaller network backbone seek route until the base station.Simulation results show that the proposed algorithm has a good performance with fault-tolerant in smaller network size,reduces the energy consumption and prolongs the network life cycle.

关 键 词：无线传感器网络 虚拟骨干 连通支配集 数据调度 能量消耗 生命周期 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]