A novel scheduling for (m, k)-firm streams in wireless sensor networks
Ki‐Il Kim · Networked Computing and Advanced Information Management · 2010
Even though many time-sensitive applications have been emerged, it is not easy to guarantee real-time delivery within deadline in wireless sensor networks due to several constraints such as short ranged wireless communication and low computing capacity on a node. In addition, it is very hard to develop real-time communication scheme without any specific traffic model because one scheme cannot meet various requirements. In this paper, we propose a novel scheduling algorithm for (m, k)-firm real-time streams in wireless sensor networks because queuing delay on a node is the main source of end-to-end delay. The priority of each packet is dynamically adjusted by current DBP (Distance Based Priority) state, slack time, and current position relative to the sink. Simulation studies reveal that dynamic failure probability in (m, k)-firm stream is reduced rather than general priority scheme.