Learn More
Minimum cost routing is considered on multiclass multihop wireless networks influenced by stochastic arrivals, inter-channel interference, and time-varying topology. Endowing each air link with a cost factor, possibly time-varying and different for different classes, we define the Dirichlet routing cost as the square of the link packet transmissions(More)
—A new routing policy, named Heat-Diffusion (HD), is developed for multihop wireless networks subject to stochastic arrivals, time-varying topology, and inter-channel interference, using only current queue congestion and current channel states, without requiring the knowledge of topology and arrivals. Besides throughput optimality, HD minimizes a quadratic(More)
—Negative curvature in the relatively new Ollivier-Ricci sense of a wireless network graph is shown to be the culprit behind large queue occupancy, large routing energy, and restricted capacity region under any throughput optimal protocol. This is the wireless counterpart of the congestion phenomenon occurring in a Gromov negatively curved wired network(More)
—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(More)
—This paper considers the problem of average network delay minimization on multiclass, multihop, stochastic wireless networks subject to inter-channel interference and time-varying topology. We present a network control policy that solves this problem in the class of all policies whose control decision is a function only of current queue congestion and(More)
Heat-Diffusion (HD) routing is our recently-developed queue-aware routing policy for multi-hop wireless networks inspired by Thermodynamics. In the prior theoretical studies, we have shown that HD routing guarantees throughput op-timality, minimizes a quadratic routing cost, minimizes queue congestion on the network, and provides a trade-off between routing(More)
  • 1