Utilizing priority-based packet scheduling based on preemptive priority scheduling in wireless sensor networks

Lethabo Mathebula*

School Mathematics, Statistics and Computer Science, University of KwaZulu-Natal, Durban, South Africa


In this paper, each node has three levels of priority queues. Real-time packets are placed into the highest-priority queue and can preempt data packets in other queues. Non-real-time packets are placed into two other queues based on a certain threshold of their estimated processing time. Leaf nodes have two queues for real-time and non-real-time data packets since they do not receive data from other nodes and thus, reduce end-to-end delay. The priority packet scheduling scheme outperforms conventional schemes in terms of average data waiting time and end-to-end delay and also it reduces sensor energy consumption.


Wireless sensor networks, FCFS, Priority packet scheduling, Pre-emptive, Non-preemptive, Real-time packets, Non-real-time packets

Digital Object Identifier (DOI)


Article history

Received 17 September 2019, Received in revised form 10 January 2020, Accepted 20 January 2020

Full text

DownloadAvailable in PDF
Portable Document Format

How to cite

Lethabo Mathebula (2020). Utilizing priority-based packet scheduling based on preemptive priority scheduling in wireless sensor networks. Annals of Electrical and Electronic Engineering, 3(4): 1-6

References (13)

  1. Nasser N, Karim L, and Taleb T (2013). Dynamic multilevel priority packet scheduling scheme for wireless sensor network. IEEE Transactions on Wireless Communications, 12(4): 1448-1459. https://doi.org/10.1109/TWC.2013.021213.111410   [Google Scholar]
  2. Anastasi G, Conti M, and Di Francesco M (2009). Extending the lifetime of wireless sensor networks through adaptive sleep. IEEE Transactions on Industrial Informatics, 5(3): 351-365. https://doi.org/10.1109/TII.2009.2025863   [Google Scholar]
  3. Bergmann G, Molnár M, Gönczy L, and Cousin B (2010). Optimal period length for the CGS sensor network scheduling algorithm. In 2010 6th International Conference on Networking and Services, IEEE, Cancun, Mexico: 192-199. https://doi.org/10.1109/ICNS.2010.33   [Google Scholar]
  4. Bulut E and Korpeoglu I (2007). DSSP: A dynamic sleep scheduling protocol for prolonging the lifetime of wireless sensor networks. In 21st International Conference on Advanced Information Networking and Applications Workshops, IEEE, Niagara Falls, Canada, 2: 725-730. https://doi.org/10.1109/AINAW.2007.157   [Google Scholar] 
  5. Chachra S and Marefat M (2006). Distributed algorithms for sleep scheduling in wireless sensor networks. In Proceedings 2006 IEEE International Conference on Robotics and Automation, IEEE, Orlando, USA: 3101-3107. https://doi.org/10.1109/ROBOT.2006.1642173   [Google Scholar] 
  6. Liu F, Tsui CY, and Zhang YJ (2010). Joint routing and sleep scheduling for lifetime maximization of wireless sensor networks. IEEE Transactions on Wireless Communications, 9(7): 2258-2267. https://doi.org/10.1109/TWC.2010.07.090629   [Google Scholar] 
  7. Liu J, Gu N, and He S (2008). An energy-aware coverage based node scheduling scheme for wireless sensor networks. In the 9th International Conference for Young Computer Scientists, IEEE, Hunan, China: 462-468. https://doi.org/10.1109/ICYCS.2008.334   [Google Scholar] 
  8. Mizanian K, Hajisheykhi R, Baharloo M, and Jahangir AH (2009). RACE: A real-time scheduling policy and communication architecture for large-scale wireless sensor networks. In 2009 7th Annual Communication Networks and Services Research Conference, IEEE, Moncton, Canada: 458-460. https://doi.org/10.1109/CNSR.2009.84   [Google Scholar] 
  9. Yu M, Xiahou S, and Li X (2008). A survey of studying on task scheduling mechanism for TinyOS. In 2008 4th International Conference on Wireless Communications, Networking and Mobile Computing, IEEE, Dalian, China: 1-4. https://doi.org/10.1109/WiCom.2008.960   [Google Scholar] 
  10. Levis PA (2006). Tinyos: An open operating system for wireless sensor networks (invited seminar). In 7th International Conference on Mobile Data Management, IEEE, Nara, Japan: 63-63. https://doi.org/10.1109/MDM.2006.151   [Google Scholar] 
  11. Lin K, Zhao H, Yin ZY, and Bi YG (2007). An adaptive double ring scheduling strategy based on tinyos. Journal-Northeastern University Natural Science, 28(7): 985.-988.   [Google Scholar]
  12. Jaspher WK and Raj A (2012). Packet scheduling algorithms in different wireless networks a survey. International Journal of Engineering Research and Technology, 1(8): 1-6.   [Google Scholar]
  13. Zhao Y, Wang Q, Wang W, Jiang D, and Liu Y (2009). Research on the priority-based soft real-time task scheduling in TinyOS. In 2009 International Conference on Information Technology and Computer Science, IEEE, Kiev, Ukraine: 1: 562-565. https://doi.org/10.1109/ITCS.2009.122   [Google Scholar]