{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T03:46:39Z","timestamp":1760240799931,"version":"build-2065373602"},"reference-count":30,"publisher":"MDPI AG","issue":"10","license":[{"start":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T00:00:00Z","timestamp":1570752000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Future Internet"],"abstract":"<jats:p>In Cooperative Intelligent Transportation Systems (C-ITSs), vehicles need to wirelessly connect with Roadside units (RSUs) over limited durations when such point-to-point connections are possible. One example of such communications is the downloading of maps to the C-ITS vehicles. Another example occurs in the testing of C-ITS vehicles, where the tested vehicles upload trajectory records to the roadside units. Because of real-time requirements, and limited bandwidths, data are sent as User Datagram Protocol (UDP) packets. We propose an inter-packet error control coding scheme that improves the recovery of data when some of these packets are lost; we argue that the coding scheme has to be one of convolutional coding. We measure performance through the session averaged probability of successfully delivering groups of packets. We analyze two classes of convolution codes and propose a low-complexity decoding procedure suitable for network applications. We conclude that Reed\u2013Solomon convolutional codes perform better than Wyner\u2013Ash codes at the cost of higher complexity. We show this by simulation on the memoryless binary erasure channel (BEC) and channels with memory, and through simulations of the IEEE 802.11p DSRC\/ITS-G5 network at the C-ITS test track AstaZero.<\/jats:p>","DOI":"10.3390\/fi11100212","type":"journal-article","created":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T10:53:03Z","timestamp":1570791183000},"page":"212","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Low Delay Inter-Packet Coding in Vehicular Networks"],"prefix":"10.3390","volume":"11","author":[{"given":"Irina","family":"Bocharova","sequence":"first","affiliation":[{"name":"Department of Information Systems, St.-Petersburg University of Information Technologies, Mechanics and Optics, 197101 St.-Petersburg, Russia"},{"name":"Institute of Computer Science, University of Tartu, 50409 Tartu, Estonia"}]},{"given":"Boris","family":"Kudryashov","sequence":"additional","affiliation":[{"name":"Department of Information Systems, St.-Petersburg University of Information Technologies, Mechanics and Optics, 197101 St.-Petersburg, Russia"},{"name":"Institute of Computer Science, University of Tartu, 50409 Tartu, Estonia"}]},{"given":"Nikita","family":"Lyamin","sequence":"additional","affiliation":[{"name":"School of Information Technology, Halmstad University, 30118 Halmstad, Sweden"}]},{"given":"Erik","family":"Frick","sequence":"additional","affiliation":[{"name":"AstaZero H\u00e4llered, 50491 Sandhult, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1155-5717","authenticated-orcid":false,"given":"Maben","family":"Rabi","sequence":"additional","affiliation":[{"name":"School of Information Technology, Halmstad University, 30118 Halmstad, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4894-4134","authenticated-orcid":false,"given":"Alexey","family":"Vinel","sequence":"additional","affiliation":[{"name":"School of Information Technology, Halmstad University, 30118 Halmstad, Sweden"},{"name":"Department of Electrical Engineering, Western Norway University of Applied Sciences, 5063 Bergen, Norway"}]}],"member":"1968","published-online":{"date-parts":[[2019,10,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"2377","DOI":"10.1109\/COMST.2015.2440103","article-title":"Heterogeneous Vehicular Networking: A Survey on Architecture, Challenges, and Solutions","volume":"17","author":"Zheng","year":"2015","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/MVT.2017.2670018","article-title":"Cooperative Intelligent Transport Systems in Europe: Current Deployment Status and Outlook","volume":"12","author":"Sjoberg","year":"2017","journal-title":"IEEE Veh. Technol. Mag."},{"key":"ref_3","unstructured":"(2019, October 10). AstaZero Test Site. Available online: http:\/\/www.astazero.com\/."},{"key":"ref_4","unstructured":"ETSI (2014). Intelligent Transport Systems (ITS); Vehicular Communications; Basic Set of Applications; Definitions, ETSI. ETSI TS 102 638 V1.1.1 (2009-06)."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Zhang, K., Mao, Y., Leng, S., Maharjan, S., Vinel, A., and Zhang, Y. (2018). Contract-theoretic Approach for Delay Constrained Offloading in Vehicular Edge Computing Networks. Mob. Netw. Appl., 1\u201312.","DOI":"10.1109\/ICC.2017.7997360"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"2649","DOI":"10.1109\/TVT.2015.2424372","article-title":"Maximum-Utility Scheduling for Multimedia Transmission in Drive-Thru Internet","volume":"65","author":"Xing","year":"2016","journal-title":"IEEE Trans. Veh. Technol."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"2673","DOI":"10.1109\/TITS.2015.2416257","article-title":"Spatial Coordinated Medium Sharing: Optimal Access Control Management in Drive-Thru Internet","volume":"16","author":"Zhou","year":"2015","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"3238","DOI":"10.1109\/TITS.2015.2440447","article-title":"Modeling and Performance Analysis of Medium Access Control Schemes for Drive-Thru Internet Access Provisioning Systems","volume":"16","author":"Atallah","year":"2015","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"2494","DOI":"10.1109\/TIT.2004.834844","article-title":"Burst erasure correction codes with low decoding delay","volume":"50","author":"Martinian","year":"2004","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1109\/TCOMM.2009.03.060468","article-title":"Burst erasure correcting LDPC codes","volume":"57","author":"Johnson","year":"2009","journal-title":"IEEE Trans. Commun."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Badr, A., Khisti, A., Tan, W.T., and Apostolopoulos, J. (2013, January 14\u201319). Streaming codes for channels with burst and isolated erasures. Proceedings of the 2013 IEEE INFOCOM, Turin, Italy.","DOI":"10.1109\/INFCOM.2013.6567095"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"59449","DOI":"10.1109\/ACCESS.2018.2874278","article-title":"V2X content distribution based on batched network coding with distributed scheduling","volume":"6","author":"Gao","year":"2018","journal-title":"IEEE Access"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"5322","DOI":"10.1109\/TIT.2014.2334315","article-title":"Batched sparse codes","volume":"60","author":"Yang","year":"2014","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1561\/0100000060","article-title":"Raptor codes","volume":"6","author":"Shokrollahi","year":"2011","journal-title":"Found. Trends Commun. Inf. Theory"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/ecjc.20155","article-title":"Method to recover lost Internet packets using (n, k, m) convolutional codes","volume":"88","author":"Arai","year":"2005","journal-title":"Electron. Commun. Jpn. Part III Fundam. Electron. Sci."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1109\/TIT.1963.1057831","article-title":"Analysis of recurrent codes","volume":"9","author":"Wyner","year":"1963","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1002\/j.1538-7305.1969.tb01135.x","article-title":"Convolutional Reed-Solomon Codes","volume":"48","author":"Ebert","year":"1969","journal-title":"Bell Labs Tech. J."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Johannesson, R., and Zigangirov, K.S. (2015). Fundamentals of Convolutional Coding, John Wiley & Sons.","DOI":"10.1002\/9781119098799"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Bocharova, I., Kudryashov, B., Rabi, M., Lyamin, N., Dankers, W., Frick, E., and Vinel, A. (2019, January 7\u201312). Modeling packet losses in communication networks. Proceedings of the IEEE International Symposium on Information Theory (ISIT), Paris, France.","DOI":"10.1109\/ISIT.2019.8849400"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Bocharova, I., Kudryashov, B., Rabi, M., Lyamin, N., Dankers, W., Frick, E., and Vinel, A. (2019). Characterizing Packet Losses in Vehicular Networks. IEEE Trans. Veh. Technol., in press.","DOI":"10.1109\/ISIT.2019.8849400"},{"key":"ref_21","first-page":"3","article-title":"Theory of codes with maximum rank distance","volume":"21","author":"Gabidulin","year":"1985","journal-title":"Probl. Peredachi Inform."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/18.75248","article-title":"Maximum-rank array codes and their application to crisscross error correction","volume":"37","author":"Roth","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"690","DOI":"10.1109\/TIT.1985.1057098","article-title":"Coding protection for magnetic tapes: A generalization of the Patel-Hong code","volume":"31","author":"Blaum","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_24","unstructured":"MacWilliams, F.J., and Sloane, N.J.A. (1977). The Theory of Error-Correcting Codes, Elsevier."},{"key":"ref_25","first-page":"58","article-title":"Development of Discrete Models for Fading Channels","volume":"29","author":"Bocharova","year":"1993","journal-title":"Probl. Peredachi Inform."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"3724","DOI":"10.1109\/TIT.2018.2873140","article-title":"Stopping redundancy hierarchy beyond the minimum distance","volume":"65","author":"Yakimenka","year":"2019","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1109\/TIT.2005.864441","article-title":"On the stopping distance and the stopping redundancy of codes","volume":"52","author":"Schwartz","year":"2006","journal-title":"IEEE Trans. Inform. Theory"},{"key":"ref_28","first-page":"86","article-title":"Weight enumerators of high-rate convolutional codes based on the Hamming code","volume":"27","author":"Bocharova","year":"1991","journal-title":"Probl. Peredachi Inform."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Bocharova, I.E., Kudryashov, B.D., Skachek, V., and Yakimenka, Y. (2017, January 28\u201331). Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance. Proceedings of the International Castle Meeting on Coding Theory and Applications, Vihula, Estonia.","DOI":"10.1007\/978-3-319-66278-7_5"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1109\/MSP.2008.926683","article-title":"Finite-state Markov modeling of fading channels\u2014A survey of principles and applications","volume":"25","author":"Sadeghi","year":"2008","journal-title":"IEEE Signal Process. Mag."}],"container-title":["Future Internet"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/10\/212\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T13:25:22Z","timestamp":1760189122000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-5903\/11\/10\/212"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,11]]},"references-count":30,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2019,10]]}},"alternative-id":["fi11100212"],"URL":"https:\/\/doi.org\/10.3390\/fi11100212","relation":{},"ISSN":["1999-5903"],"issn-type":[{"type":"electronic","value":"1999-5903"}],"subject":[],"published":{"date-parts":[[2019,10,11]]}}}