Age of Information in Mobile Networks: Fundamental Limits and Tradeoffs

Age of information (AoI), defined for an information source as the time elapsed since the latest received update was generated, is a recently proposed metric that quantifies the timeliness of information delivery in a communication system. This paper studies a fundamental problem of how the achievable AoI scales in mobile networks. Specifically, we consider a network consisting of =/2 source-destination (S-D) pairs and employ the protocol model to characterize interference incurred by concurrent transmissions. We consider a general class of scheduling policies potentially with the multi-hop transmission and the duplication of packets to multiple nodes. The analysis of AoI faces significant challenges due to potential out-of-order packet delivery, the inherent tradeoffs between packet-centric metrics (throughput and delay), and their unexplored relation to AoI. We first show that the average per-node AoI in static settings scales as Ω (p= log(=)) . In the case of networks with i.i.d. mobility, where the node locations vary independently over time, we introduce an episodic technique that allows us to establish lower bounds and design and analyze scheduling policies as constructive upper bounds. Our analytical results reveal that the average per-node AoI scales as Θ̃(=^1/4) under i.i.d. mobility, which highlights that mobility can enhance timeliness. Finally, we show that, in a more general class of wireless network settings, one can design the age-minimal scheduling policy by balancing throughput and delay.