hh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Low Delay Inter-Packet Coding in Vehicular Networks
St.-Petersburg University of Information Technologies, Mechanics and Optics, St.-Petersburg, Russia & University of Tartu, Tartu, Estonia.ORCID iD: 0000-0002-6460-4626
St.-Petersburg University of Information Technologies, Mechanics and Optics, St.-Petersburg, Russia & University of Tartu, Tartu, Estonia.ORCID iD: 0000-0002-5865-5283
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).ORCID iD: 0000-0003-1460-2988
AstaZero Hällered, Sandhult, Sweden.
Show others and affiliations
2019 (English)In: Future Internet, ISSN 1999-5903, E-ISSN 1999-5903, Vol. 11, no 12, article id 212Article in journal (Refereed) Published
Abstract [en]

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–Solomon convolutional codes perform better than Wyner–Ash 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.

Place, publisher, year, edition, pages
Basel: MDPI, 2019. Vol. 11, no 12, article id 212
Keywords [en]
V2X, C-ITS, IEEE 802.11p, error-correcting codes, convolutional codes, fading channels
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:hh:diva-40702OAI: oai:DiVA.org:hh-40702DiVA, id: diva2:1360300
Funder
Knowledge FoundationSwedish Foundation for Strategic Research ELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Note

Funding: European Cooperation in Science and Technology & Eesti Teadusagentuur (PRG49)

Available from: 2019-10-11 Created: 2019-10-11 Last updated: 2019-10-11

Open Access in DiVA

No full text in DiVA

Other links

Full text

Authority records BETA

Lyamin, NikitaRabi, MabenVinel, Alexey

Search in DiVA

By author/editor
Bocharova, IrinaKudryashov, BorisLyamin, NikitaRabi, MabenVinel, Alexey
By organisation
Centre for Research on Embedded Systems (CERES)
In the same journal
Future Internet
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 14 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf