A virtual queue-based back-pressure scheduling algorithm for wireless sensor networks

Abstract

Abstract In this paper, we design a new virtual queue-based back-pressure scheduling algorithm (VBR) for achieving significant delay reduction in wireless sensor networks (WSN). Our algorithm design comes from an observation that classical back-pressure scheduling algorithm usually needs a long period of time to form a queue backlog-based gradient in a network, which decreases towards the sink in the network, before achieving stable packet delivery performance. To address this issue, VBR is designed to pre-build proper virtual queue-based gradient at nodes in a WSN, which is chosen to be a function of traffic arrival rate, link rate, and distance to sink, in order to be adaptive to different network and application environments while achieving high network performance. Moreover, the queue backlog differential between each pair of neighbor nodes is decided by their actual queue lengths and also their virtual queue lengths (gradient values). We prove that VBR can maintain back-pressure scheduling’s throughput optimality. Simulation result shows that VBR can obtain significant performance improvement in terms of packet delivery ratio, average end-to-end delay, and average queue length as compared with existing work.