pith. sign in

arxiv: 1811.05961 · v1 · pith:UHG3ED3Rnew · submitted 2018-11-14 · 💻 cs.IT · cs.NI· eess.SP· math.IT

Age of Information Scaling in Large Networks

classification 💻 cs.IT cs.NIeess.SPmath.IT
keywords multiplescalingbestdestinationinformationlargenetworksnodes
0
0 comments X
read the original abstract

We study age of information in a multiple source-multiple destination setting with a focus on its scaling in large wireless networks. There are $n$ nodes that are randomly paired with each other on a fixed area to form $n$ source-destination (S-D) pairs. We propose a three-phase transmission scheme which utilizes local cooperation between the nodes by forming what we call mega update packets to serve multiple S-D pairs at once. We show that under the proposed scheme average age of an S-D pair scales as $O(n^{\frac{1}{4}})$ as the number of users, $n$, in the network grows. To the best of our knowledge, this is the best age scaling result for a multiple source-multiple destination setting.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.