Abstract
Packet scheduling algorithms are developed in order to use shared transmission resources efficiently. Various application packets such as real and non-real time packets might have different QoS requirements and traditional scheduling algorithms might be insufficient to respond to the applications needs. In this paper, two packet scheduling algorithms are proposed to overcome this problem: Dynamic multi threshold priority packet scheduling (DMTPS) and dynamic multi threshold priority with urgency packet scheduling (DMTPUS). The proposed algorithms aim to provide a better QoS level with a decrease in delay time and loss ratio for the low priority packets while still maintaining acceptable fairness towards high priority packets. To evaluate the performance of DMTPS and DMTPUS algorithms, they are compared with the commonly used scheduling algorithms such as first come first served (FCFS) and fixed priority. Simulation results illustrate that the dynamic multi threshold priority packet scheduling algorithms can provide a better QoS for low priority packets without decreasing the QoS levels of high priority packets.
Highlights
A Wireless Sensor Network (WSN) consists of tiny sensor nodes which are low-cost and low-energy and with sensing, data processing and communicating components
The proposed Dynamic Multi Threshold Priority packet scheduling algorithms try to maximize the level of Quality of Service (QoS) provided to different priority packets by reducing the loss ratio and waiting times
We propose dynamic multi threshold priority packet scheduling algorithms for WSNs
Summary
A Wireless Sensor Network (WSN) consists of tiny sensor nodes which are low-cost and low-energy and with sensing, data processing and communicating components. The rapid deployment, self- organization, and fault tolerance characteristics of WSNs make them a very promising sensing technique for military command, control, communications, computing, intelligence, surveillance, reconnaissance, and targeting systems In health, they are used for monitoring patients and assisting disabled patients with deployment of sensor nodes. The proposed Dynamic Multi Threshold Priority packet scheduling algorithms try to maximize the level of QoS provided to different priority packets by reducing the loss ratio and waiting times. The proposed scheduling algorithms are non preemptive due to structure of reduced system load of WSNs. The rest of the paper is organized as follows: Section 2 describes some of the most commonly used Queue Scheduling Algorithms for WSNs, Section 3 introduces the proposed dynamic multi threshold priority packet scheduling algorithms. When a new packet arrives, the priority level change decision is made based on if the queue occupancy is higher than the threshold value
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
