Context aware traffic scheduling algorithm for power distribution smart grid network

Abstract

T The emergence of smart grid poses technical challenges to the power distribution network because of the increasing data traffic resulting from diverse data applications. Traffic scheduling algorithms manage these heterogeneous applications by applying different priorities to each traffic type based on its quality of service (QoS). However, QoS alone cannot accurately capture complex situations wherein packets with low priority occasionally need to be served first based on their context, resulting in a suboptimal solution. This paper proposes a context aware traffic scheduling (CATSchA) algorithm to schedule the traffic such that it could adapt to varying power network conditions. The power distribution network traffic is characterized based on heterogeneous traffic demands, and then mapped into weighted quality classes. The CATSchA algorithm is implemented in a packet switched network using NS-3 simulator, and the traffic demand is fulfilled based on the algorithm's context awareness. Compared with traditional traffic scheduling algorithms, the proposed algorithm lowers the delay while maintaining the throughput and link efficiency.