...
首页> 外文期刊>Wireless Communications, IEEE Transactions on >Dynamic Multilevel Priority Packet Scheduling Scheme for Wireless Sensor Network
【24h】

Dynamic Multilevel Priority Packet Scheduling Scheme for Wireless Sensor Network

机译:无线传感器网络的动态多级优先级分组调度方案

获取原文
获取原文并翻译 | 示例
           

摘要

Scheduling different types of packets, such as real-time and non-real-time data packets, at sensor nodes with resource constraints in Wireless Sensor Networks (WSN) is of vital importance to reduce sensors' energy consumptions and end-to-end data transmission delays. Most of the existing packet-scheduling mechanisms of WSN use First Come First Served (FCFS), non-preemptive priority and preemptive priority scheduling algorithms. These algorithms incur a high processing overhead and long end-to-end data transmission delay due to the FCFS concept, starvation of high priority real-time data packets due to the transmission of a large data packet in non-preemptive priority scheduling, starvation of non-real-time data packets due to the probable continuous arrival of real-time data in preemptive priority scheduling, and improper allocation of data packets to queues in multilevel queue scheduling algorithms. Moreover, these algorithms are not dynamic to the changing requirements of WSN applications since their scheduling policies are predetermined. In this paper, we propose a Dynamic Multilevel Priority (DMP) packet scheduling scheme. In the proposed scheme, each node, except those at the last level of the virtual hierarchy in the zone-based topology of WSN, has three levels of priority queues. Real-time packets are placed into the highest-priority queue and can preempt data packets in other queues. Non-real-time packets are placed into two other queues based on a certain threshold of their estimated processing time. Leaf nodes have two queues for real-time and non-real-time data packets since they do not receive data from other nodes and thus, reduce end-to-end delay. We evaluate the performance of the proposed DMP packet scheduling scheme through simulations for real-time and non-real-time data. Simulation results illustrate that the DMP packet scheduling scheme outperforms conventional schemes in terms of average data waiting time and end-to-end delay.
机译:在无线传感器网络(WSN)中受资源限制的传感器节点上调度不同类型的数据包(例如实时和非实时数据包)对于减少传感器的能耗和端到端数据至关重要传输延迟。 WSN的大多数现有数据包调度机制都使用先来先服务(FCFS),非抢先优先级和抢先优先级调度算法。这些算法由于FCFS概念而导致较高的处理开销和较长的端到端数据传输延迟,由于在非抢先优先级调度中传输了大数据包而导致高优先级实时数据包的匮乏,非实时数据包是由于抢先优先级调度中实时​​数据可能连续到达,以及在多级队列调度算法中不正确地将数据包分配给队列。而且,由于这些算法的调度策略是预先确定的,因此它们对于WSN应用程序的不断变化的需求不是动态的。在本文中,我们提出了一种动态多级优先级(DMP)数据包调度方案。在提出的方案中,每个节点,除了那些在WSN基于区域的拓扑中虚拟层次结构的最后一级的节点之外,都具有三级优先级队列。实时数据包被放入最高优先级队列中,并且可以抢占其他队列中的数据包。根据非实时数据包的估计处理时间的某个阈值,它们会将它们放入其他两个队列中。叶节点有两个用于实时和非实时数据包的队列,因为它们不从其他节点接收数据,因此减少了端到端延迟。我们通过模拟实时和非实时数据来评估提出的DMP数据包调度方案的性能。仿真结果表明,DMP数据包调度方案在平均数据等待时间和端到端延迟方面优于传统方案。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号