We consider the problem of minimizing age of information in general single-hop and multihop wireless networks. First, we formulate a way to convert AoI optimization problems into equivalent network stability problems. Then, we propose a heuristic low complexity approach for achieving stability that can handle general network topologies; unicast, multicast and broadcast flows; interference constraints; link reliabilities; and AoI cost functions. We provide numerical results to show that our proposed algorithms behave as well as the best known scheduling and routing schemes available in the literature for a wide variety of network settings.

翻译：我们考虑在一般的单机和多机无线网络中将信息年龄降低到最低程度的问题。 首先,我们将AoI优化问题转化为同等的网络稳定性问题。 然后,我们提出一种低精度的低复杂度实现稳定的方法,可以处理一般网络地形;单播、多播和广播流;干扰限制;连通性;以及AoI成本功能。我们提供了数字结果,以显示我们提议的算法行为以及文献中为各种网络设置提供的最知名的时间安排和路线计划。