A real-time message scheduling scheme based on optimal earliest deadline first policy for dual channel wireless networks

This paper addresses the problem of scheduling time sensitive messages on dual channel wireless sensor networks. Besides the bandwidth expansion, partitioning evenly the transmission time makes it possible to inherit the optimality of EDF scheduling scheme on the dual channels based on fixed-size time slots synchronized across the two channels. Slot rearrangement also maximizes the number of switchable pairs, so the allocation can be switched dynamically between the channels according to the current channel status, enhancing the reliability of timely message delivery. Simulation results show that the rearrangement scheme can generate 70% of switchable, pairs even when the utilization reaches the saturation point, improving the ratio of successful transmission by up to 18% when the packet error rate exceeds 0.4, compared with global EDF or NCASP.