Heat-Diffusion: Pareto Optimal Dynamic Routing for Time-Varying Wireless Networks

• Published in: IEEE/ACM transactions on networking Vol. 28; no. 4; pp. 1520 - 1533
• Main Authors: Banirazi, Reza, Jonckheere, Edmond, Krishnamachari, Bhaskar
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.08.2020; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: back-pressure; Combinatorial analysis; Complexity theory; delay; Delays; heat diffusion; Heating systems; Interference; max-weight; Network topologies; Optimization; Pareto optimum; Policies; Queues; Routing; routing cost; Stochastic network optimization; Thermodynamics; throughput; Traffic congestion; Wireless communication; Wireless networks; Wireless sensor networks
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2020.2991745

A dynamic routing policy, referred to as Heat-Diffusion (HD), is developed for multihop uniclass wireless networks subject to random traffic, time-varying topology and inter-channel interference. The policy uses only current condition of queue occupancies and channel states, with requiring no knowledge of traffic and topology. Besides throughput optimality, HD minimizes an average quadratic routing cost defined by endowing each channel with a time-varying cost factor. Further, HD minimizes average network delay in the class of routing policies that base decisions only on current condition of traffic congestion and channel states. Further, in this class of routing policies, HD provides a Pareto optimal tradeoff between average routing cost and average network delay, meaning that no policy can improve either one without detriment to the other. Finally, HD fluid limit follows graph combinatorial heat equation, which can open a new way to study wireless networks using heat calculus, a very active area of pure mathematics.