Publication Type:

Conference Paper


2015 IEEE Globecom Workshops, GC Wkshps 2015 - Proceedings, Institute of Electrical and Electronics Engineers Inc. (2015)





Average queue lengths, Bandwidth, Blocking probability, Chains, Delay sensitive traffic, Delay-sensitive applications, Dynamic Markov chains, Internet, Internet of things, Internet of Things (IOT), Markov processes, Non-real time traffics, Quality of service, Real-time application, Scheduling, Service differentiation, Telecommunication services


<p>Guaranteeing quality of service (QoS) to transmit real time applications which are delay sensitive is of utmost importance in Internet of Things (IoT) environment. This paper presents a dynamic Markov Chain based scheduling scheme for ensuring QoS for the delay sensitive traffic in IoT. The traffic is classified into prioritized and non- prioritized traffic. By estimating previous bandwidth allocated to prioritized traffic and the amount of decrease/increase in probability of average queue length of prioritized packets in consecutive cycles, the scheduler dynamically adjusts the percentage of link bandwidth allocated to it in each cycle. This helps in providing guaranteed services to real time traffic in IoT applications and simultaneously provide better throughput for non real time traffic as well. The proposed QoS- alert scheduling mechanism is able to optimize the desired performance in IoT network. For different experiments the simulation is performed which verifies and satisfies the blocking probability requirements of prioritized traffic for IoT data. © 2015 IEEE.</p>


cited By 0; Conference of IEEE Globecom Workshops, GC Wkshps 2015 ; Conference Date: 6 December 2015 Through 10 December 2015; Conference Code:119593

Cite this Research Publication

Ra Sharma and N. Kumar, “QoS-alert Markov chain based scheduling scheme in internet of things”, in 2015 IEEE Globecom Workshops, GC Wkshps 2015 - Proceedings, 2015.