基于动态优先级的无线传感器网络实时分组调度机制  

Dynamic Priority Based Real-time Packet Scheduling for Wireless Sensor Networks

作　　者：张琪[1,2] 田立勤[1,2] 

机构地区：[1]青海师范大学计算机学院,西宁810000 [2]华北科技学院计算机学院,北京101601

出　　处：《小型微型计算机系统》2014年第10期2215-2219,共5页Journal of Chinese Computer Systems

基　　金：中央高校基本科研业务项目(3142013098;3142014125)资助;新世纪优秀人才支持计划项目(NCET-10-0101)资助;国家自然科学基金项目(61163050;61472137)资助;青海省农业科技成果转化与推广计划项目(2012-N-525)资助

摘　　要：在无线传感器网络中,延迟是影响实时服务质量的重要因素.为了减少分组在转发过程中的排队延迟,提出一种基于动态优先级的实时分组调度机制(Dynamic Priority Based Real-time Packet Scheduling简写DPRS).在DPRS中,节点的队列被分为三个优先级队列,分别存放紧急分组、延误分组以及普通分组,DPRS在三个队列之间采取优先级调度机制,且根据当前队列的拥塞程度在每个队列内部采取先到先服务(First Come First Service简写FCFS)或后到先服务(Last Come First Service简写LCFS)的调度机制.理论分析和实验对比验证结果表明DPRS能够提高无线传感器网络的实时性.Delay affects real-time Quality of network Service { QoS } of wireless sensor networks significantly. In order to decrease packet＇s queuing delay in forwarding progress ,this paper proposes a Dynamic Priority Based Real-time Packet Scheduling { short for DPRS） mechanism. In DPRS, sensor＇s queue is divided into three priority queues, which store urgent packet,delayed packet and com- mon packet respectively. DPRS takes a priority scheduling between three queues, and takes a First Come First Service （ FCFS ） or a Last Come First Service （ LCFS } scheduling in each queue according to congestion level of current node. From the result of theoretical analysis and experimental comparison, DPRS can improve the real-time and fairness of wireless sensor networks.

关 键 词：分组调度 动态优先级 实时性 DPRS 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]