Scheduling schemes in dynamic multilevel packet scheduling in WSN

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

As focusing on the scheduling schemes, there are many scheduling schemes for multilevel. So the paper is concentrating to compare the scheduling schemes and producing the average waiting time and turnaround time. If it is minimized then the overall performance may shoot up. In this paper comparison is done between three scheduling schemes Enhanced Dynamic Multilevel Packet scheduling (EDMP), Circular Wait Dynamic Multilevel Packet scheduling (CW-DMP) and Starvation-Free Dynamic Multilevel Packet scheduling (SF-DMP). In all the above schemes there are three priority levels say priority level 1(Pr1), priority level 2(Pr2) and priority level 3(Pr3). Pr1 will comprise the real time tasks, Pr2 containing the non real time remote tasks and non real time local tasks are there in Pr3. In each and every scheme, each and every priority level will be using the individual scheduling technique to schedule the tasks. Also the comparison is done based on waiting time and the turnaround time of the task thereby the average waiting time and the average turnaround time are calculated.

Author supplied keywords

Cite

CITATION STYLE

APA

Priscilla Joy, R., & Dheeba, J. (2019). Scheduling schemes in dynamic multilevel packet scheduling in WSN. International Journal of Recent Technology and Engineering, 8(2), 3800–3804. https://doi.org/10.35940/ijrte.B1714.078219

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free