https://www.mdu.se/

mdu.sePublications
Change search
Refine search result
1 - 3 of 3
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Grezet, Matthias
    et al.
    Aalto Univ, Finland..
    Westerback, Thomas
    Mälardalen University, School of Education, Culture and Communication, Educational Sciences and Mathematics.
    Freij-Hollanti, Ragnar
    Aalto Univ, Finland..
    Hollanti, Camilla
    Aalto Univ, Finland..
    Uniform Minors in Maximally Recoverable Codes2019In: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 23, no 8, p. 1297-1300Article in journal (Refereed)
    Abstract [en]

    In this letter, locally recoverable codes with maximal recoverability are studied with a focus on identifying the MDS codes resulting from puncturing and shortening. By using matroid theory and the relation between MDS codes and uniform minors, the list of all the possible uniform minors is derived. This list is used to improve the known non-asymptotic lower bound on the required field size of a maximally recoverable code.

  • 2.
    Hoang, L. -N
    et al.
    Halmstad University, Halmstad, Sweden.
    Uhlemann, Elisabeth
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. Halmstad University, Halmstad, Sweden.
    Jonsson, M.
    Halmstad University, Halmstad, Sweden.
    An efficient message dissemination technique in platooning applications2015In: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 19, no 6, p. 1017-1020, article id 7066951Article in journal (Refereed)
    Abstract [en]

    Autonomous driving in road trains, a.k.a. platooning, may reduce fuel consumption considerably if the inter-vehicle distances are kept short. However, to do this, the intra-platoon 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 event-driven 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.

  • 3.
    Hoang, Le-Nam
    et al.
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
    Uhlemann, Elisabeth
    Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems.
    Jonsson, M.
    School of Information Technology, Halmstad University, Halmstad, Sweden.
    Relay Grouping to Guarantee Timeliness and Reliability in Wireless Networks2019In: IEEE Communications Letters, ISSN 1089-7798, E-ISSN 1558-2558, Vol. 23, no 9, p. 1661-1664, article id 8737952Article in journal (Refereed)
    Abstract [en]

    Relaying can increase reliability, range, or throughput. In many cyber-physical systems (CPS), relaying is used to maximize reliability before a given deadline. Since concurrent transmissions are not supported by most CPS, time-division multiple access (TDMA) is typically used. However, a major drawback of relaying in TDMA is that pre-allocated time-slots are wasted if their respective transmitters do not have any correctly received packet to relay. Therefore, in this letter, we propose a novel relay grouping scheme to overcome this drawback. Numerical results show that the proposed scheme significantly enhances the reliability while guaranteeing the deadline for each message. 

1 - 3 of 3
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • 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