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
An Efficient Message Dissemination Technique in Platooning Applications
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES). Mälardalen University, Västerås, Sweden.ORCID iD: 0000-0001-6497-4099
Halmstad University, School of Information Technology, Halmstad Embedded and Intelligent Systems Research (EIS), Centre for Research on Embedded Systems (CERES).ORCID iD: 0000-0002-6526-3931
2015 (English)In: IEEE Communications Letters, ISSN 1089-7798, Vol. 19, no 6, 1017-1020 p.Article in journal (Refereed) Published
Abstract [en]

Autonomous driving in road trains, a.k.a. platooning, may reduce fuel consumption considerably if the intervehicle distances are kept short. However, to do this, the intraplatoon communication must not only be reliable but also able to meet strict deadlines. While time-triggered messages are the foundation of most distributed control applications, platooning is likely to also require dissemination of event-driven messages. While much research work has focused on minimizing the age of periodic messages, state-of-the-art for disseminating eventdriven messages is to let all nodes repeat all messages and focus on mitigating broadcast storms. We derive an efficient message dissemination scheme based on relay selection which minimizes the probability of error at the intended receiver(s) for both unicast and broadcast, without degrading the performance of co-existing time-triggered messages. We present a full analysis of the resulting error probability and delay, when relayers, selected by our algorithm, are used to disseminate messages within a platoon. Numerical results indicate that the proposed relaying policy significantly enhances the reliability for a given delay.

Place, publisher, year, edition, pages
Piscataway, NJ: IEEE Press, 2015. Vol. 19, no 6, 1017-1020 p.
National Category
Communication Systems Telecommunications
Identifiers
URN: urn:nbn:se:hh:diva-28228DOI: 10.1109/LCOMM.2015.2416174ISI: 000356164000032Scopus ID: 2-s2.0-84933507762OAI: oai:DiVA.org:hh-28228DiVA: diva2:810680
Projects
ACDC
Funder
Knowledge Foundation
Available from: 2015-05-08 Created: 2015-05-08 Last updated: 2015-08-17Bibliographically approved
In thesis
1. Relaying for Timely and Reliable Message Dissemination in Wireless Distributed Control Systems
Open this publication in new window or tab >>Relaying for Timely and Reliable Message Dissemination in Wireless Distributed Control Systems
2015 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Distributed control applications enabled by wireless networks are becoming more and more frequent. The advantages of wireless access are many, as control systems become mobile, autonomous and connected. Examples include platooning and automated factories. However, distributed control systems have stringent requirement on both reliability and timeliness, the latter in terms of deadlines. If the deadline is missed, the packet is considered useless, similarly to a lost or erroneous packet in a system without deadlines. In addition, wireless channels are, by nature, more exposed to noise and interference than their wired counterparts. Consequently, it implies a considerable challenge to fulfill the deadline requirements with sufficient reliability for proper functionality of distributed control applications. However, by taking advantage of cooperative communications, increased reliability can be achieved with little or no additional delay.

Reducing the delay until a message is successfully received is a two-fold problem: providing channel access with a predictable maximum delay and maximizing the reliability of each transmission, once granted by the medium access method. To this end, this thesis proposes a framework that provides a bounded channel access delay and handles the co-existence of both time-triggered and event-driven messages encountered in distributed control applications. In addition, the thesis proposes and evaluates an efficient message dissemination technique based on relaying that maximizes the reliability given a certain deadline, or alternatively determines the delay required to achieve a certain reliability threshold for both unicast and broadcast scenarios. Numerical results, which are verified by Monte-Carlo simulations, show significant improvements with the proposed relaying scheme as compared to a conventional scheme without cooperation, providing more reliable message delivery given a fixed number of available time-slots. It also becomes clear in which situations relaying is preferable and in which situations pure retransmissions are preferable, as the relay selection algorithm will always pick the best option. The relay selection algorithm has a reasonable complexity and can be used by both routing algorithms and relaying scenarios in any time-critical application as long as it is used together with a framework that enables predictable channel access. In addition, it can be implemented on top of commercially available transceivers.

Place, publisher, year, edition, pages
Halmstad: Halmstad University Press, 2015. 58 p.
Series
Halmstad University Dissertations, 14
National Category
Communication Systems Telecommunications
Identifiers
urn:nbn:se:hh:diva-28245 (URN)978-91-87045-31-8 (ISBN)978-91-87045-30-1 (ISBN)
Presentation
2015-06-01, Haldasalen, Visionen, Högskolan i Halmstad, Kristian IV:s väg 3, Halmstad, 13:15 (English)
Opponent
Supervisors
Projects
ACDC
Funder
Knowledge FoundationeLLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Available from: 2015-05-12 Created: 2015-05-11 Last updated: 2015-09-10Bibliographically approved

Open Access in DiVA

fulltext(673 kB)92 downloads
File information
File name FULLTEXT01.pdfFile size 673 kBChecksum SHA-512
e9618d6e9b3de070fd5a3a071a1d9c053653a7e4fe46b9dfd4579afcfb1d4fa2f777b6e114e0efacd5dd6f51190baad8d0ca6b4ce61b2d56c8a68d8b760c25a2
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Hoang, Le-NamUhlemann, ElisabethJonsson, Magnus
By organisation
Centre for Research on Embedded Systems (CERES)
In the same journal
IEEE Communications Letters
Communication SystemsTelecommunications

Search outside of DiVA

GoogleGoogle Scholar
Total: 92 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 134 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