← Back to VOLUME 3, ISSUE 3, MARCH 2014
This work is licensed under a Creative Commons Attribution 4.0 International License.
A Review of Packet Scheduling Schemes in Wireless Sensor Networks
ANJALY PAUL, ROBIN CYRIAC Student, Department of Computer Science & Engineering, Rajagiri School of Engineering & Technology, Kochi, India Assistant Professor, Department of Computer Science & Engineering, Rajagiri School of Engineering & Technology, Kochi, India
Downloads: Download PDF
đ 42 viewsđĨ 0 downloads
Abstract: Many wireless sensor network (WSN) applications heavily rely on information being transmitted in a timely manner. In such sensor networks, packet scheduling plays a vital role in reducing end-to-end data transmission delays. It also helps in reducing sensors energy consumptions, thus increasing the lifetime of the wireless sensor network. The simplest packet scheduling scheme is FCFS (First Come First Serve). Many more packet scheduling schemes have been proposed for wireless sensor networks such as EDF(Earliest Deadline First) and those based on priority with single and multiple queues. This paper discusses different packet scheduling techniques that have been proposed for wireless sensor networks and the various concepts related to them.
Keywords: Packet scheduling, wireless sensor networks, real-time data, pre-emptive, priority.
Keywords: Packet scheduling, wireless sensor networks, real-time data, pre-emptive, priority.
How to Cite:
[1] ANJALY PAUL, ROBIN CYRIAC Student, Department of Computer Science & Engineering, Rajagiri School of Engineering & Technology, Kochi, India Assistant Professor, Department of Computer Science & Engineering, Rajagiri School of Engineering & Technology, Kochi, India, âA Review of Packet Scheduling Schemes in Wireless Sensor Networks,â International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE)
