An efficient scheduling algorithm for sensor-based IoT networks

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

Abstract

Internet of Things (IoT) based networks with sensors are energy and delay stringent. Efficient scheduling algorithms for IoT-based networks are the need of the hour. Nodes with selfish behavior degrade the performance of the network. Hence, a scheduling algorithm that schedules packets based on their emergencies and priorities yields better results. In this paper, M/M/1 and M/M/N scheduling scheme to schedule Emergency packets (E-packets) and Regular packets (R-packets) is proposed. The next-hop nodes are chosen based on the trust value of nodes. It is seen that the proposed scheme yields better results in terms of Packet Delivery Ratio (PDR), end-to-end delay, throughput and routing overhead.

Cite

CITATION STYLE

APA

Deva Priya, M., Suganya, T., Christy Jeba Malar, A., Dhivyaprabha, E., Prasad, P. K., & Vishnu Vardhan, L. R. (2020). An efficient scheduling algorithm for sensor-based IoT networks. In Lecture Notes in Networks and Systems (Vol. 89, pp. 1323–1331). Springer. https://doi.org/10.1007/978-981-15-0146-3_130

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