Age of Information in Uncoordinated Unslotted Updating

Sensor sources submit updates to a monitor through an unslotted, uncoordinated, unreliable multiple access collision channel. The channel is unreliable; a collision-free transmission is received successfully at the monitor with some transmission success probability. For an infinite-user model in which the sensors collectively generate updates as a Poisson process and each update has an independent exponential transmission time, a stochastic hybrid system (SHS) approach is used to derive the average age of information (AoI) as a function of the offered load and the transmission success probability. The analysis is then extended to evaluate the individual age of a selected source. When the number of sources and update transmission rate grow large in fixed proportion, the limiting asymptotic individual age is shown to provide an accurate individual age approximation, even for a small number of sources.

[1]  Chunming Qiao,et al.  Improve Efficiency and Reliability in Single-Hop WSNs with Transmit-Only Nodes , 2013, IEEE Transactions on Parallel and Distributed Systems.

[2]  James Gross,et al.  Statistical guarantee optimization for age of information for the D/G/1 queue , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[3]  Shahab Farazi,et al.  Fundamental bounds on the age of information in multi-hop global status update networks , 2019, Journal of Communications and Networks.

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

[5]  Anthony Ephremides,et al.  Minimizing The Age of Information in a CSMA Environment , 2019, 2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT).

[6]  Anthony Ephremides,et al.  On the Optimality of the Whittle’s Index Policy for Minimizing the Age of Information , 2020, IEEE Transactions on Wireless Communications.

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

[8]  Jing Yang,et al.  Optimal status updating for an energy harvesting sensor with a noisy channel , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[9]  Mark H. A. Davis.  Piecewise‐Deterministic Markov Processes: A General Class of Non‐Diffusion Stochastic Models , 1984 .

[10]  Anthony Ephremides,et al.  Age of information with a packet deadline , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

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

[13]  Robert G. Gallager,et al.  A perspective on multiaccess channels , 1984, IEEE Trans. Inf. Theory.

[14]  Andrea Munari,et al.  Average Age of Information of Irregular Repetition Slotted ALOHA , 2020, GLOBECOM 2020 - 2020 IEEE Global Communications Conference.

[15]  Bartlomiej Blaszczyszyn,et al.  Using Transmit-Only Sensors to Reduce Deployment Cost of Wireless Sensor Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[16]  Yifan Gu,et al.  Age-of-Information Dependent Random Access for Massive IoT Networks , 2020, IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[17]  Marian Codreanu,et al.  Age of information with packet management , 2014, 2014 IEEE International Symposium on Information Theory.

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

[19]  Eytan Modiano,et al.  Optimizing age-of-information in a multi-class queueing system , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[20]  Eytan Modiano,et al.  Minimizing the Age of Information in broadcast wireless networks , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[21]  Vangelis Angelakis,et al.  Age of information of multiple sources with queue management , 2015, 2015 IEEE International Conference on Communications (ICC).

[22]  Roy D. Yates,et al.  Age of Information: Updates with Priority , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[23]  Emre Telatar,et al.  Status updates in a multi-stream M/G/1/1 preemptive queue , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[24]  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.

[25]  Zhisheng Niu,et al.  Decentralized Status Update for Age-of-Information Optimization in Wireless Multiaccess Channels , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[26]  Roy D. Yates,et al.  Status updates over unreliable multiaccess channels , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[28]  Anthony Ephremides,et al.  Age of information under random updates , 2013, 2013 IEEE International Symposium on Information Theory.

[29]  Sairaj V. Dhople,et al.  Moment Closure and Finite-Time Blowup for Piecewise Deterministic Markov Processes , 2016, SIAM J. Appl. Dyn. Syst..

[30]  D. Vermes,et al.  Optimal Dynamic Control of a Useful Class of Randomly Jumping Processes , 1980 .

[31]  Zhisheng Niu,et al.  Closed-Form Whittle’s Index-Enabled Random Access for Timely Status Update , 2019, IEEE Transactions on Communications.

[32]  Lawrence G. Roberts,et al.  ALOHA packet system with and without slots and capture , 1975, CCRV.

[33]  Richard P. Martin,et al.  Transmit Only: An Ultra Low Overhead MAC Protocol for Dense Wireless Systems , 2017, 2017 IEEE International Conference on Smart Computing (SMARTCOMP).

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

[35]  Zhisheng Niu,et al.  Timely Status Update in Massive IoT Systems: Decentralized Scheduling for Wireless Uplinks , 2018, ArXiv.

[36]  Zhisheng Niu,et al.  Can Decentralized Status Update Achieve Universally Near-Optimal Age-of-Information in Wireless Multiaccess Channels? , 2018, 2018 30th International Teletraffic Congress (ITC 30).

[37]  Konstantinos Gatsis,et al.  Age of Information in Random Access Channels , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[38]  Anthony Ephremides,et al.  Age of information performance of multiaccess strategies with packet management , 2018, Journal of Communications and Networks.

[39]  Anthony Ephremides,et al.  Age of Information With Prioritized Streams: When to Buffer Preempted Packets? , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[40]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[41]  J. Hespanha.  Modelling and analysis of stochastic hybrid systems , 2006 .

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