Age of information in multihop multicast networks

We consider the age of information in a multihop multicast network where there is a single source node sending time-sensitive updates to nL end nodes, and L denotes the number of hops. In the first hop, the source node sends updates to n first-hop receiver nodes, and in the second hop each first-hop receiver node relays the update packets that it has received to n further users that are connected to it. This network architecture continues in further hops such that each receiver node in hop I is connected to n further receiver nodes in hop ℓ +1. We study the age of information experienced by the end nodes, and in particular, its scaling as a function of n. We show that, using an earliest k transmission scheme in each hop, the age of information at the end nodes can be made a constant independent of n. In particular, the source node transmits each update packet to the earliest k1 of the n first-hop nodes, and each first-hop node that receives the update relays it to the earliest k2 out of n second-hop nodes that are connected to it and so on. We determine the optimum kℓ stopping value for each hop ℓ for arbitrary shifted exponential link delays.

[1]  Sennur Ulukus,et al.  Age minimization in energy harvesting communications: Energy-controlled delays , 2017, 2017 51st Asilomar Conference on Signals, Systems, and Computers.

[2]  Eytan Modiano,et al.  Minimizing age-of-information in multi-hop wireless networks , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[3]  Sennur Ulukus,et al.  Age of Information in G/G/1/1 Systems: Age Expressions, Bounds, Special Cases, and Optimization , 2019, IEEE Transactions on Information Theory.

[4]  John Anderson,et al.  Wireless sensor networks for habitat monitoring , 2002, WSNA '02.

[5]  Eytan Modiano,et al.  Age of Information for Discrete Time Queues , 2019, ArXiv.

[6]  Roy D. Yates,et al.  Update or wait: How to keep your data fresh , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

[7]  Elif Uysal-Biyikoglu,et al.  Age of information under energy replenishment constraints , 2015, 2015 Information Theory and Applications Workshop (ITA).

[8]  Jing Yang,et al.  Age-Minimal Online Policies for Energy Harvesting Sensors with Random Battery Recharges , 2018, 2018 IEEE International Conference on Communications (ICC).

[9]  Sennur Ulukus,et al.  Age of Information in Two-Hop Multicast Networks , 2018, 2018 52nd Asilomar Conference on Signals, Systems, and Computers.

[10]  Sennur Ulukus,et al.  Coded status updates in an energy harvesting erasure channel , 2018, 2018 52nd Annual Conference on Information Sciences and Systems (CISS).

[11]  Roy D. Yates,et al.  Status updates through multicast networks , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[12]  Sennur Ulukus,et al.  Age-Minimal Transmission in Energy Harvesting Two-Hop Networks , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[13]  Stratis Ioannidis,et al.  Optimal and scalable distribution of content updates over a mobile social network , 2009, IEEE INFOCOM 2009.

[14]  Yu-Pin Hsu,et al.  Age of Information: Whittle Index for Scheduling Stochastic Arrivals , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[15]  Samuel Karlin,et al.  Polya Type Distributions of Convolutions , 1960 .

[16]  Roy D. Yates,et al.  Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.

[17]  Ingram Olkin,et al.  Life Distributions: Structure of Nonparametric, Semiparametric, and Parametric Families , 2007 .

[18]  Tetsuya Takine,et al.  A General Formula for the Stationary Distribution of the Age of Information and Its Application to Single-Server Queues , 2018, IEEE Transactions on Information Theory.

[19]  Yoshiaki Inoue,et al.  Analysis of the Age of Information with Packet Deadline and Infinite Buffer Capacity , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[20]  H. Vincent Poor,et al.  Age-Minimal Online Policies for Energy Harvesting Sensors with Incremental Battery Recharges , 2018, 2018 Information Theory and Applications Workshop (ITA).

[21]  B. Dhillon.  Life Distributions , 1981, IEEE Transactions on Reliability.

[22]  Jingxian Wu,et al.  Optimal Status Update for Age of Information Minimization With an Energy Harvesting Source , 2017, IEEE Transactions on Green Communications and Networking.

[23]  Moshe Shaked,et al.  Stochastic orders and their applications , 1994 .

[24]  Suresh Subramaniam,et al.  Waiting Before Serving: A Companion to Packet Management in Status Update Systems , 2019, IEEE Transactions on Information Theory.

[25]  Roy D. Yates,et al.  Lazy is timely: Status updates by an energy harvesting source , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[26]  Eytan Modiano,et al.  Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals , 2017, IEEE Transactions on Mobile Computing.

[27]  Panagiotis Papadimitratos,et al.  Vehicular communication systems: Enabling technologies, applications, and future outlook on intelligent transportation , 2009, IEEE Communications Magazine.

[28]  Roy D. Yates,et al.  Status updates through M/G/1/1 queues with HARQ , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[29]  Ness B. Shroff,et al.  The Age of Information in Multihop Networks , 2017, IEEE/ACM Transactions on Networking.

[30]  Roy D. Yates,et al.  Real-time status updating: Multiple sources , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

[31]  H. Vincent Poor,et al.  Online Timely Status Updates with Erasures for Energy Harvesting Sensors , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[32]  Roy D. Yates,et al.  The Age of Information in Networks: Moments, Distributions, and Sampling , 2018, IEEE Transactions on Information Theory.

[33]  Marian Codreanu,et al.  On the Age of Information in Status Update Systems With Packet Management , 2015, IEEE Transactions on Information Theory.

[34]  Ness B. Shroff,et al.  Age-optimal information updates in multihop networks , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[35]  Jing Yang,et al.  Sening Information Through Status Updates , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).