A QoS Efficient Scheduling Algorithm for Wireless Sensor Networks
Sezer Uzungenc1, Tamer Dag2
1Sezer Uzungenç, Department of Computer Engineering, Kadir Has University, Istanbul Turkey.
2Tamer Dag, Department of Computer Engineering, Kadir Has University, Istanbul Turkey.
Manuscript received on 9 May 2015 | Revised Manuscript received on 25 May 2015 | Manuscript Published on 30 May 2015 | PP: 48-50 | Volume-4 Issue-12, May 2015 | Retrieval Number: K20350441115/15©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: In Wireless Sensor Networks, it is needed to schedule different types of packets such as real time and non-real time packets. It is important to reduce sensors’ energy consumptions. In this paper, we propose new packet scheduling algorithm and integrate with Wireless Sensor Networks to improve energy consumptions. Our proposed Dynamic Multi Threshold Priority packet scheduling algorithm ensures a decrease in loss ratio for the lower priority level data with acceptable fairness towards higher priority level data. Threshold algorithm is compared with the commonly used scheduling algorithms such as First-Come-First-Serve (FCFS) and fixed priority non-preemptive. Simulation results illustrate that the Dynamic Multi Threshold Priority packet scheduling algorithm can provide a better QoS for low priority packets while keeping the QoS levels for high priority packets at similar levels.
Keywords: Dynamic Multi Threshold Priority Packet Scheduling, First-Come-First-Serve (FCFS), Non-Preemptive Priority Scheduling, QoS.
Scope of the Article: Wireless Sensor Networks