Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (22): 110-112.DOI: 10.3778/j.issn.1002-8331.2010.22.033

• 网络、通信、安全 • Previous Articles     Next Articles

Real-time adaptive scheduling algorithm for sensor networks

DING Hai-xia   

  1. Department of Computer Applied Technology,Jiangsu Food Science College,Huai’an,Jiangsu 223003,China
  • Received:2009-08-19 Revised:2009-10-09 Online:2010-08-01 Published:2010-08-01
  • Contact: DING Hai-xia

传感器网络中一种实时的自适应时隙调度算法

丁海霞   

  1. 江苏食品职业技术学院 计算机应用技术系,江苏 淮安 223003
  • 通讯作者: 丁海霞

Abstract: Due to the drawbacks in energy efficient and low-latency of the most of wireless sensor MAC scheduling algorithm,an Adaptive Time-slot Scheduling Algorithm(ATSA) based on clustering is presented.ATSA divided the entire network into some clusters,the algorithm combines with the information of the routing,it can obviously reduce the energy consumption,the cluster head adjusts the time-slot of nodes according to their real-time traffic load in a proper order and frequency,thus the idle listening is reduced,and the energy consumption balancing among nodes is achieved with a low latency.Simulation results show that the algorithm can meet the system requirements in reliability,real-time response and energy efficiency.

摘要: 无线传感器网络节点数目众多,MAC协议为节点分配工作时隙面临能量利用不高、节点延时较长等方面的难题。目前基于时隙调度的MAC协议一般采用等长的时隙大小,不能适应数据流量变化大的网络且忽略与网络层的融合,没有利用路由层信息来减低时隙分配算法性能代价。提出一种基于路由转发树的时隙调度算法(ATSA),网络采用簇结构,在簇内构造一棵路由转发树,根据路由转发树形成的路径信息对节点实时获取节点每轮需要发送的数据量大小,根据节点的数据量大小来分配节点每轮需要的时隙,然后由簇头据此动态地为成员节点分配时隙,降低时隙划分的能量和时间代价,减少空闲侦听时间,避免串音。仿真表明,该算法有效地提高了网络能量利用效率,延长了网络生存周期,降低数据包的延时。

CLC Number: