Heat diffusion algorithm for resource allocation and routing in multihop wireless networks

We propose a new scheduling and routing approach, the Heat Diffusion (HD) protocol, using combinatorial analogue of the heat equation in mathematical physics. The algorithm holds for systems subject to time-varying network conditions with general packet arrivals and random topology states, including ad-hoc networks with mobility. Compared to the well-known backpressure policy, the HD protocol is generalized in form and optimized in performance, which considers link penalties and node capacities in the routing. It mitigates the packet looping behavior of backpressure and attempts to communicate less over links of higher costs and with the nodes of lower capacities. While HD policy shows benefits over backpressure, it is developed using the same underlying control laws. Therefore, it can easily leverage all the theoretical works that have been done in improving the original backpressure. For the same reason, it provides a relatively easy path-way to modify existing applications of backpressure to the optimized versions using HD protocol.