The week's pick
Random Articles
Reseach Article
A Dynamic Packet Scheduling Scheme with Multilevel Priority for Wireless Sensor Network
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 110 - Number 10 |
| Year of Publication: 2015 |
| Authors: Ankita A. Chipde, Veeresh G. Kasabegoudar |
10.5120/19355-1084
|
Ankita A. Chipde, Veeresh G. Kasabegoudar . A Dynamic Packet Scheduling Scheme with Multilevel Priority for Wireless Sensor Network. International Journal of Computer Applications. 110, 10 ( January 2015), 32-38. DOI=10.5120/19355-1084
Abstract
Packet scheduling is one of the critical issues in wireless sensor networks. In WSNs most existing scheduling mechanisms use FCFS, non-preemptive or preemptive priority algorithms. However, most of these algorithms incur high processing overhead and high end-to-end transmission delay due to the FCFS concept and starvation of real time and non-real time data packets in non-preemptive and preemptive priority scheduling algorithms. Also, these packet scheduling algorithms are predetermined and hence cannot change in application requirements of WSNs. Therefore, in this paper, we propose a dynamic multilevel priority (DMP) packet scheduling algorithm to overcome the short comes like starvation of real time data, end-to-end or data transmission delay, and to make the packet scheduling dynamic. It is well known that in DMP scheduling scheme, nodes are organized in hierarchical structure and each node (except those nodes which are located at last level of hierarchical structure) has three level of priority queues in which real time data packets go to highest priority queue and non-real time data packets go to other two queues based on certain threshold levels of their estimated processing time. The DMP scheme proposed in this work was implemented with network simulator (NS2) v. 2. 32. The results obtained (end-to-end delay, average waiting time, network lifetime, and energy consumption) indicate the proposed DMP scheme is superior to existing first come first serve (FCFS) packet scheduling scheme.
References
- Akyildiz, W. Su, Y. Sankarsubramaniam, E Cayirci, "A survey on sensor network," IEEE Common Mag. , vol. 40, no. 4, pp. 102-114, 2002.
- W. Stalling, Operating System, 2nd edition, Prentice Hall, 1995.
- N. Nasser, L. Karim, and T. Taleb, "Dynamic multilevel priority packet scheduling scheme for wireless sensor network," IEEE Transactions On Wireless Communications, vol. 12, no. 4, pp. 1448-1459, 2013.
- Y. Zhao, Q. Wang, W. Wang, D. Jiang, and Y. Liu, "Research on the priority based soft real-time task scheduling in TinyOS," International Conf. Inf. Technol. Comput. Sci. , vol. 1, pp. 562–565, 2009.
- TinyOS. Available: http://webs. cs. berkeley. edu/tos, accessed June 2010.
- Available: http://webs. cs. berkeley. edu/tos, accessed June 2010.
- S. Chachra and M. Marefat, "Distributed algorithms for sleep scheduling in wireless sensor networks," IEEE International Conf. Robot. Autom. , pp. 3101–3107, 2006.
- O. Khader, A. Willig, and A. Wolisz, "Distributed wakeup scheduling scheme for supporting periodic traffic in wsns," European Wireless Conf. , pp. 287–292, 2009.
- L. Karim, N. Nasser, and T. El Salti, "Efficient zone-based routing protocol of sensor network in agriculture monitoring systems," International Conf. Commun. Inf. Technol. , pp. 167–170, 2011.
- C. Lu, B. M. Blum, T. F. Abdelzaher, J. A. Stankovic, and T. He, "RAP: a real-time communication architecture for large-scale wireless sensor networks," IEEE Real-Time Embedded Technol. Appl. Symp. , pp. 55–66, 2002.
- K. Mizanian, R. Hajisheykhi, M. Baharloo, and A. H. Jahangir, "RACE: a real-time scheduling policy and communication architecture for large scale wireless sensor networks," Commun. Netw. Services Research Conf. , pp. 458–460, 2009.
- M. Yu, S. J. Xiahou, and X. Y. Li, "A survey of studying on task scheduling mechanism for TinyOS," International Conf. Wireless Commun. , Netw. Mobile Comput. , pp. 1–4, 2008.
- P. A. Levis, "TinyOS: an open operating system for wireless sensor networks (invited seminar)," International Conf. Mobile Data Manag. , p. 63, 2006.
- K. Lin, H. Zhao, Z. Y. Yin, and Y. G. Bi, "An adaptive double ring scheduling strategy based on tinyos," J. Northeastern University Natural Sci. , vol. 28, no. 7, pp. 985–988, 2007.
- Y. Zhao, Q. Wang, W. Wang, D. Jiang, and Y. Liu, "Research on the priority-based soft real-time task scheduling in TinyOS," International Conf. Inf. Technol. Comput. Sci. , vol. 1, pp. 562–565, 2009.
- E. M. Lee, A. Kashif, D. H. Lee, I. T. Kim, and M. S. Park, "Location based multi-queue scheduler in wireless sensor network," International Conf. Advanced Commun. Technol. , vol. 1, pp. 551–555, 2010.
- E. Karimi and B. Akbari, "Improving video delivery over wireless multimedia sensor networks based on queue priority scheduling," International Conf. Wireless Commun. , Netw. Mobile Comput. , pp. 1–4, 2011.
Index Terms
Keywords