Mobility Investigate

An Efficient Priority Packet Scheduling Algorithm for Wireless Sensor Network

Download now Free registration required

Executive Summary

Scheduling real-time and non-real time packets at the sensor nodes is significantly important to reduce processing overhead, energy consumptions, communications bandwidth, and end-to-end data transmission delay of Wireless Sensor Network (WSN). Most of the existing packet scheduling algorithms of WSN use assignments based on First-Come First-Served (FCFS), non-preemptive priority, and preemptive priority scheduling. However, these algorithms incur a large processing overhead and data transmission delay and are not dynamic to the data traffic changes. In this paper, the authors propose three class priority packet scheduling scheme. Emergency real-time packets are placed into the highest priority queue and can preempt the processing of packets at other queues.

  • Format: PDF
  • Size: 714.66 KB