无线传感器网络中任务调度算法的研究  

Research of Task Assignment and Scheduling Algorithms in Wireless Sensor Networks

作　　者：徐维涛[1] 郝晓弘[1] 张萍[1] 

机构地区：[1]兰州理工大学电气工程与信息工程学院,兰州730050

出　　处：《科学技术与工程》2008年第1期106-112,共7页Science Technology and Engineering

基　　金：甘肃科技攻关项目(2GS-A52-001-24);甘肃省自然科学基金项目(3ZS042-B25-012)资助

摘　　要：近几年,无线传感器网络能够实时监测和传输环境数据信息变得日益重要,尤其在民用和军事领域得到很广泛的应用。无线传感器网络具有传统网络无可比拟的优势,每个传感器节点用来感知周围环境事件和采集数据,并将采集的数据通过一跳或者多跳路由传给簇头节点或者接收器节点,然后发送到基站或数据中心进行处理。假定每个节点对信息的处理看作是一个任务,考虑节点能量限制,节点采用唤醒/休眠机制,在唤醒期间确保节点任务完成,簇头节点能够调度处理多个传感器节点的任务。文中解决的问题:在满足多个传感器节点任务处理的截止期失效前,簇头节点如何合理的调度任务,提出了改进的RM(rate-monotonic)调度算法和动态的抢占式最早截止期优先任务调度算法(Preemptive Earliest Deadline First Algorithm,PEDFA)。通过具体任务实例说明算法的实现过程,结果表明该算法运行简单,能够很好减少节点任务的延迟时间,实现节点任务的合理调度。In recently several years, it is increasingly important that Wireless Sensor Networks （WSN） are able to achieve detecting and transiting data information of environment, in particular, which are widely applied to field of civil and military, which have more advantage than traditional networks. Sensor nodes play the role of sensing event and collected data of environment, and transit data information toward cluster head node or sink node by onehop or multi-hop router, then transit it to base station or data center. Supposing processing information as a task of node, power constraints of node is considered, and node uses way of awaking/sleeping, during awaking assureed that sensor node accomplishes task and cluster head node can schedule multi-task of sensor node. will resolve such problem： before satisfying multi-tasks deadline invaliding of sensor node, how to feasibly schedule schedule algo- rithm of improving Rate-Monotonic （RM） and dynamic Preemptive Earliest Deadline First Algorithm, via concrete example are presented, The process of algorithm achieving is explained . The result indicates that the algorithms are simple and can reduce lateness of task, moreover, making feasible schedule of node task.

关 键 词：无线传感器网络 调度算法 任务延迟 

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