Congestion Control Based on Multi-priority Data for Opportunistic Routing

In order to effectively satisfy the latency requirements of the multi-priority data transmission in wireless sensor network, this paper proposes a congestion control algorithm based on multi-priority data for opportunistic routing. By means of introducing the node queue model of multi-priority data and studying the next-hop node selection strategy based on the traditional opportunistic routing, the new algorithm CEDOP working on the multi-priority data is developed, which pays attention to the shortest path, residual energy of nodes and congestion control. The simulation results demonstrate that the scheme can effectively solve the latency issue of the high-priority data transmission in wireless sensor network under the situation of low latency and network load balance.