Papers
Topics
Authors
Recent
Search
2000 character limit reached

Update Rate, Accuracy, and Age of Information in a Wireless Sensor Network

Published 6 May 2024 in cs.IT and math.IT | (2405.03798v1)

Abstract: Age of Information (AoI), namely the time that has elapsed since the most recently delivered packet was generated, is receiving increasing attention with the emergence of many real-time applications that rely on the exchange of time-sensitive information. AoI captures the freshness of the information from the perspective of the destination. The term "accuracy of information" is used to assess how close the estimate at the destination is to the parameter value measured by the sensor. In this paper, the mean square error (MSE) is used to evaluate the accuracy of information. We focus on a single sensor that monitors a time-sensitive physical process, which is modelled as a random walk. Whenever the state of the random walk changes by more than a specified threshold, the sensor generates a status update packet and transmits it to the destination. When no update packet is received, the destination assumes that the state of the process has not changed. We study the problem of finding the minimum update rate under AoI and accuracy of information constraints. More specifically, we derive analytical expressions for the update rate, the AoI, and the MSE.

Authors (2)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (19)
  1. S. Kaul, M. Gruteser, V. Rai, and J. Kenney, “Minimizing age of information in vehicular networks,” in 2011 8th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2011, pp. 350–358.
  2. M. Costa, M. Codreanu, and A. Ephremides, “Age of information with packet management,” in 2014 IEEE International Symposium on Information Theory, 2014, pp. 1583–1587.
  3. I. Kadota and E. Modiano, “Minimizing the age of information in wireless networks with stochastic arrivals,” IEEE Transactions on Mobile Computing, vol. 20, no. 3, pp. 1173–1185, 2021.
  4. Y. Sun, E. Uysal-Biyikoglu, R. D. Yates, C. E. Koksal, and N. B. Shroff, “Update or wait: How to keep your data fresh,” IEEE Transactions on Information Theory, vol. 63, no. 11, pp. 7492–7508, 2017.
  5. R. D. Yates, “Lazy is timely: Status updates by an energy harvesting source,” in 2015 IEEE International Symposium on Information Theory (ISIT), 2015, pp. 3008–3012.
  6. I. Kadota, A. Sinha, E. Uysal-Biyikoglu, R. Singh, and E. Modiano, “Scheduling policies for minimizing age of information in broadcast wireless networks,” IEEE/ACM Transactions on Networking, vol. 26, no. 6, pp. 2637–2650, 2018.
  7. I. Kadota, A. Sinha, and E. Modiano, “Scheduling algorithms for optimizing age of information in wireless networks with throughput constraints,” IEEE/ACM Transactions on Networking, vol. 27, no. 4, pp. 1359–1372, 2019.
  8. X. Chen, K. Gatsis, H. Hassani, and S. S. Bidokhti, “Age of information in random access channels,” in 2020 IEEE International Symposium on Information Theory (ISIT), 2020, pp. 1770–1775.
  9. R. V. Bhat, R. Vaze, and M. Motani, “Throughput maximization with an average age of information constraint in fading channels,” IEEE Transactions on Wireless Communications, vol. 20, no. 1, pp. 481–494, 2021.
  10. P. D. Mankar, Z. Chen, M. A. Abd-Elmagid, N. Pappas, and H. S. Dhillon, “Throughput and age of information in a cellular-based IoT network,” IEEE Transactions on Wireless Communications, vol. 20, no. 12, pp. 8248–8263, 2021.
  11. A. Kosta, N. Pappas, A. Ephremides, and V. Angelakis, “Age of information and throughput in a shared access network with heterogeneous traffic,” in 2018 IEEE Global Communications Conference (GLOBECOM), 2018, pp. 1–6.
  12. B. T. Bacinoglu, E. T. Ceran, and E. Uysal-Biyikoglu, “Age of information under energy replenishment constraints,” in 2015 Information Theory and Applications Workshop (ITA), 2015, pp. 25–31.
  13. X. Wu, J. Yang, and J. Wu, “Optimal status update for age of information minimization with an energy harvesting source,” IEEE Transactions on Green Communications and Networking, vol. 2, no. 1, pp. 193–204, 2018.
  14. B. T. Bacinoglu and E. Uysal-Biyikoglu, “Scheduling status updates to minimize age of information with an energy harvesting sensor,” in 2017 IEEE International Symposium on Information Theory (ISIT), 2017, pp. 1122–1126.
  15. E. Codling, M. Plank, and S. Benhamou, “Random walks in biology,” Journal of the Royal Society, Interface / the Royal Society, vol. 5, pp. 813–34, 09 2008.
  16. J. H. Cochrane, “How big is the random walk in GNP?” Journal of Political Economy, vol. 96, no. 5, pp. 893–920, 1988. [Online]. Available: https://doi.org/10.1086/261569
  17. J. Masoliver, M. Montero, and G. H. Weiss, “Continuous-time random-walk model for financial distributions,” Phys. Rev. E, vol. 67, p. 021112, Feb 2003. [Online]. Available: https://link.aps.org/doi/10.1103/PhysRevE.67.021112
  18. X. Dai, “Update rate, accuracy, and age of information in a wireless sensor network,” Master’s thesis, University of British Columbia, 2022. [Online]. Available: https://open.library.ubc.ca/collections/ubctheses/24/items/1.0421320
  19. I. Kadota, E. Uysal-Biyikoglu, R. Singh, and E. Modiano, “Minimizing the age of information in broadcast wireless networks,” in 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2016, pp. 844–851.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 3 tweets with 0 likes about this paper.