[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1109/WCNC51071.2022.9771945guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
research-article

Reducing Age of Extra Data by Free Riding on Coded Transmission in Multiaccess Networks

Published: 10 April 2022 Publication History

Abstract

This paper focuses on the real-time status update in a multiaccess vehicular network, in which multiple vehicles transmit not only the payload data (e.g., monitoring data) but also the extra data (e.g., driving intention) to a road side unit for scheduling vehicles to improve traffic efficiency and safety. A free-ride code is implemented, where the extra data is encoded by a random but fixed generator matrix and is delivered by superposition on the low-density parity-check (LDPC) coded payload data, consuming neither extra bandwidth nor extra transmit power. Considering the time slotted ALOHA random access protocol, we derive the closed-form expression for average age of information (AoI), and evaluate the AoI for both payload data and extra data. Numerical simulations demonstrate that free-ride codes can not only transmit extra data without extra transmit power, but also reduce the average AoI of extra data without affecting the average AoI of payload data.

References

[1]
M. A. Abd-Elmagid, N. Pappas, and H. S. Dhillon, “On the role of age of information in the Internet of Things,” IEEE Communications Magazine, vol. 57, no. 12, pp. 72–77, 2019.
[2]
S. Kaul, R. Yates, and M. Gruteser, “Real-time status: How often should one update?,” in 2012 Proceedings IEEE INFOCOM, pp. 2731–2735, 2012.
[3]
X. Fu, C. Guo, Y. Qu, and X.-H. Lin, “Resource allocation and blocklength selection for low-latency vehicular communications,” IEEE Wireless Communications Letters, vol. 10, no. 5, pp. 914–918, 2021.
[4]
R. D. Yates, E. Najm, E. Soljanin, and J. Zhong, “Timely updates over an erasure channel,” in 2017 IEEE International Symposium on Information Theory (ISIT), pp. 316–320, 2017.
[5]
P. Parag, A. Taghavi, and J.-F. Chamberland, “On real-time status updates over symbol erasure channels,” in 2017 IEEE Wireless Communications and Networking Conference (WCNC), pp. 1–6, 2017.
[6]
A. Arafa, J. Yang, S. Ulukus, and H. V. Poor, “Online timely status updates with erasures for energy harvesting sensors,” in 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 966–972, 2018.
[7]
M. Xie, J. Gong, and X. Ma, “Is the packetized transmission efficient? an age-energy perspective,” in 2020 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 329–333, 2020.
[8]
M. Xie, J. Gong, S. Cai, and X. Ma, “Age-energy tradeoff for two-hop status update systems with heterogeneous truncated ARQ,” IEEE Wireless Communications Letters, vol. 10, no. 7, pp. 1488–1492, 2021.
[9]
M. Xie, J. Gong, X. Jia, and X. Ma, “Age and energy tradeoff for multicast networks with short packet transmissions,” IEEE Transactions on Communications, vol. 69, no. 9, pp. 6106–6119, 2021.
[10]
R. Gallager, “Low-density parity-check codes,” IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21–28, 1962.
[11]
M. Xie, Q. Wang, J. Gong, and X. Ma, “Age and energy analysis for LDPC coded status update with and without ARQ,” IEEE Internet of Things Journal, vol. 7, no. 10, pp. 10388–10400, 2020.
[12]
H. Pan, S. C. Liew, J. Liang, V. C. M. Leung, and J. Li, “Coding of multi-source information streams with age of information requirements,” IEEE Journal on Selected Areas in Communications, vol. 39, no. 5, pp. 1427–1440, 2021.
[13]
J. You, S. Wu, Y. Deng, J. Jiao, and Q. Zhang, “An age optimized hybrid ARQ scheme for polar codes via gaussian approximation,” IEEE Wireless Communications Letters, vol. 10, no. 10, pp. 2235–2239, 2021.
[14]
S. Cai, S. Zhao, and X. Ma, “Packing additional bits into LDPC coded data,” Electronics Letters, vol. 55, no. 18, pp. 997–998, 2019.
[15]
R. G. Gallager, Stochastic processes: theory for applications.Cambridge University Press, 2013.
[16]
S. Cai, S. Zhao, and X. Ma, “Free ride on LDPC coded transmission,” IEEE Transactions on Infromation Theory, vol. 68, no. 1, pp. 80–92, 2022.

Cited By

View all
  • (2024)Simultaneous update of sensing and control data using free-ride codes in vehicular networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2024.110667252:COnline publication date: 1-Oct-2024

Index Terms

  1. Reducing Age of Extra Data by Free Riding on Coded Transmission in Multiaccess Networks
            Index terms have been assigned to the content through auto-classification.

            Recommendations

            Comments

            Please enable JavaScript to view thecomments powered by Disqus.

            Information & Contributors

            Information

            Published In

            cover image Guide Proceedings
            2022 IEEE Wireless Communications and Networking Conference (WCNC)
            Apr 2022
            2737 pages

            Publisher

            IEEE Press

            Publication History

            Published: 10 April 2022

            Qualifiers

            • Research-article

            Contributors

            Other Metrics

            Bibliometrics & Citations

            Bibliometrics

            Article Metrics

            • Downloads (Last 12 months)0
            • Downloads (Last 6 weeks)0
            Reflects downloads up to 30 Dec 2024

            Other Metrics

            Citations

            Cited By

            View all
            • (2024)Simultaneous update of sensing and control data using free-ride codes in vehicular networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2024.110667252:COnline publication date: 1-Oct-2024

            View Options

            View options

            Media

            Figures

            Other

            Tables

            Share

            Share

            Share this Publication link

            Share on social media