Benefits of Coding on Age of Information in Broadcast Networks

Age of Information (AoI) is studied in two-user broad-cast networks with feedback, and lower and upper bounds are derived on the expected weighted sum AoI of the users. In particular, a class of simple coding actions is considered and within this class, randomized and deterministic policies are devised. Explicit conditions are found for symmetric dependent channels under which coded randomized policies strictly outperform the corresponding uncoded policies. Similar behaviour is shown numerically for deterministic policies.

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

[2]  Roy D. Yates,et al.  Timely updates over an erasure channel , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[3]  Chih-Chun Wang,et al.  On the Capacity of 1-to- $K$ Broadcast Packet Erasure Channels With Channel Output Feedback , 2010, IEEE Transactions on Information Theory.

[4]  Yalin E. Sagduyu,et al.  Age of Information with network coding , 2019, Ad Hoc Networks.

[5]  Parimal Parag,et al.  On Real-Time Status Updates over Symbol Erasure Channels , 2017, 2017 IEEE Wireless Communications and Networking Conference (WCNC).

[6]  Eytan Modiano,et al.  Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks , 2018, 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[7]  Prathamesh Mayekar,et al.  Optimal Lossless Source Codes for Timely Updates , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[8]  Anthony Ephremides,et al.  Information freshness and popularity in mobile caching , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[9]  Anthony Ephremides,et al.  Effect of Message Transmission Path Diversity on Status Age , 2016, IEEE Transactions on Information Theory.

[10]  Eytan Modiano,et al.  Optimizing Age of Information in Wireless Networks with Throughput Constraints , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

[11]  Eytan Modiano,et al.  Optimizing age of information in wireless networks with perfect channel state information , 2018, 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[12]  Roy D. Yates,et al.  The Age of Information: Real-Time Status Updating by Multiple Sources , 2016, IEEE Transactions on Information Theory.

[13]  Yin Sun,et al.  Sampling for Remote Estimation through Queues: Age of Information and Beyond , 2019, 2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT).

[14]  Anthony Ephremides,et al.  Effect of message transmission diversity on status age , 2014, 2014 IEEE International Symposium on Information Theory.

[15]  Atilla Eryilmaz,et al.  Optimal Real-Time Monitoring of an Information Source Under Communication Costs , 2018, 2018 IEEE Conference on Decision and Control (CDC).

[16]  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).

[17]  Songtao Feng,et al.  Minimizing Age of Information for an Energy Harvesting Source with Updating Failures , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[18]  Roy D. Yates,et al.  Age-optimal constrained cache updating , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[19]  Elif Uysal-Biyikoglu,et al.  Age-Optimal Channel Coding Blocklength for an M/G/1 Queue with HARQ , 2018, 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[20]  Atilla Eryilmaz,et al.  Wireless scheduling for information freshness and synchrony: Drift-based design and heavy-traffic analysis , 2017, 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[21]  Eytan Modiano,et al.  Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks , 2018, IEEE/ACM Transactions on Networking.

[22]  Christina Fragouli,et al.  Feedback-based coding algorithms for broadcast erasure channels with degraded message sets , 2012, 2012 International Symposium on Network Coding (NetCod).

[23]  Rajai Nasser,et al.  Optimal Age over Erasure Channels , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[24]  Leandros Tassiulas,et al.  Multiuser Broadcast Erasure Channel With Feedback—Capacity and Algorithms , 2010, IEEE Transactions on Information Theory.

[25]  Eytan Modiano,et al.  Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

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

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

[28]  Kun Chen,et al.  Age-of-information in the presence of error , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[29]  Anthony Ephremides,et al.  Optimal Link Scheduling for Age Minimization in Wireless Systems , 2018, IEEE Transactions on Information Theory.

[30]  Jacqueline Grennon.  , 2nd Ed. , 2002, The Journal of nervous and mental disease.

[31]  Stephen Saxby.  The Age of Information , 1990 .

[32]  Atilla Eryilmaz,et al.  Throughput-Optimal Scheduling Design With Regular Service Guarantees in Wireless Networks , 2015, IEEE/ACM Transactions on Networking.

[33]  Roy D. Yates,et al.  Timely Lossless Source Coding for Randomly Arriving Symbols , 2018, 2018 IEEE Information Theory Workshop (ITW).

[34]  Sanjit Krishnan Kaul,et al.  Minimizing age of information in vehicular networks , 2011, 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[35]  Jie Gao,et al.  Towards Fresh and Low-Latency Content Delivery in Vehicular Networks: An Edge Caching Aspect , 2018, 2018 10th International Conference on Wireless Communications and Signal Processing (WCSP).

[36]  Roy D. Yates,et al.  On Piggybacking in Vehicular Networks , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[37]  Roy D. Yates,et al.  Status updates through queues , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[38]  Elif Uysal-Biyikoglu,et al.  Delay and Peak-Age Violation Probability in Short-Packet Transmissions , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[39]  Leandros Tassiulas,et al.  Broadcast erasure channel with feedback - Capacity and algorithms , 2009, 2009 Workshop on Network Coding, Theory, and Applications.

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

[41]  Atilla Eryilmaz,et al.  Wireless Scheduling Design for Optimizing Both Service Regularity and Mean Delay in Heavy-Traffic Regimes , 2016, IEEE/ACM Transactions on Networking.

[42]  Michael Heindlmaier,et al.  Capacity Regions of Two-Receiver Broadcast Erasure Channels With Feedback and Memory , 2014, IEEE Transactions on Information Theory.