Learning from A Single Graph is All You Need for Near-Shortest Path Routing in Wireless Networks
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 …
samples obtained from a single graph while generalizing to all random graphs in a standard …
Throughput-Efficient Design and Machine Learning for Wireless Mesh Network Optimization
YF Chen - 2024 - rave.ohiolink.edu
Wireless meshes offer a resilient and cost-effective framework where multi-hop
communication occurs among mesh clients, routers, and gateways. In this framework …
communication occurs among mesh clients, routers, and gateways. In this framework …