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

by Reza Banirazi, Edmond Jonckheere, Bhaskar Krishnamachari

Released as a article .

2019  

Abstract

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.
In text/plain format

Archived Files and Locations

application/pdf  1.2 MB
file_wxpipvbop5exvnpkmk3ffdfw44
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-02-15
Version   v1
Language   en ?
arXiv  1902.05649v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 2615e435-5b29-412c-93cb-8b6e15a20990
API URL: JSON