Abstract-Given n randomly located source-destination (S-D) pairs on a fixed area network that want to communicate with each other, we study the age of information with a particular focus on its scaling as the network size n grows. We propose a threephase transmission scheme that utilizes hierarchical cooperation between users along with mega update packets and show that an average age scaling of O(n α(h) log n) per-user is achievable where h denotes the number of hierarchy levels and α(h) = 1 3·2 h +1 which tends to 0 as h increases such that asymptotically average age scaling of the proposed scheme is O(log n). To the best of our knowledge, this is the best average age scaling result in a status update system with multiple S-D pairs.
The scaling law of age with respect to the number of nodes in a large network with a hierarchical structure was studied in REF .
Age of Information Scaling in Large Networks with Hierarchical Cooperation
2019 IEEE Global Communications Conference (GLOBECOM)
2019 IEEE Global Communications Conference (GLOBECOM)
Computer Science Engineering Mathematics