3 papers
cs.LG2023
Learning from A Single Graph is All You Need for Near-Shortest Path Routing in Wireless Networks
Yung-Fu Chen, Sen Lin, Anish Arora
We propose a learning algorithm for local routing policies that needs only a few data samples obtained from a single graph while generalizing to all random graphs in a standard mod…
cs.NI2023
QF-Geo: Capacity Aware Geographic Routing using Bounded Regions of Wireless Meshes
Yung-Fu Chen, Kenneth W. Parker, Anish Arora
Routing in wireless meshes must detour around holes. Extant routing protocols often underperform in minimally connected networks where holes are larger and more frequent. Minimal d…
cs.NI2023
QF-MAC: Adaptive, Local Channel Hopping for Interference Avoidance in Wireless Meshes
Yung-Fu Chen, Anish Arora
The throughput efficiency of a wireless mesh network with potentially malicious external or internal interference can be significantly improved by equipping routers with multi-radi…