  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.
