mdh.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Low Complexity Algorithm for Efficient Relay Assignment in Unicast/Broadcast Wireless Networks
Halmstad University, Halmstad, Sweden.
Mälardalens högskola, Akademin för innovation, design och teknik, Inbyggda system. Halmstad University, Halmstad, Sweden.ORCID-id: 0000-0001-6497-4099
Halmstad University, Halmstad, Sweden.
2017 (Engelska)Ingår i: IEEE Vehicular Technology Conference (VTC) Proceedings, ISSN 1550-2252, Vol. June, artikel-id 8108261Artikel i tidskrift (Refereegranskat) Published
Abstract [en]

Using relayers in wireless networks enables higher throughput, increased reliability or reduced delay. However, when building networks using commercially available hardware, concurrent transmissions by multiple relayers are generally not possible. Instead one specific relayer needs to be assigned for each transmission instant. If the decision regarding which relayer to assign, i.e., which relayer that has the best opportunity to successfully deliver the packet, can be taken online, just before the transmission is to take place, much can be gained. This is particularly the case in mobile networks, as a frequently changing network topology considerably affects the choice of a suitable relayer. To this end, this paper addresses the problem of online relay assignment by developing a low-complexity algorithm highly likely to find the optimal combination of relaying nodes that minimizes the resulting error probability at the targeted receiver(s) using a mix of simulated annealing and ant colony algorithms, such that relay assignments can be made online also in large networks. The algorithm differs from existing works in that it considers both unicast as well as broadcast and assumes that all nodes can overhear each other, as opposed to separating source nodes, relay nodes and destination nodes into three disjoint sets, which is generally not the case in most wireless networks. 

Ort, förlag, år, upplaga, sidor
Institute of Electrical and Electronics Engineers Inc. , 2017. Vol. June, artikel-id 8108261
Nationell ämneskategori
Datorsystem
Identifikatorer
URN: urn:nbn:se:mdh:diva-38579DOI: 10.1109/VTCSpring.2017.8108261ISI: 000426875800081Scopus ID: 2-s2.0-85040601258OAI: oai:DiVA.org:mdh-38579DiVA, id: diva2:1181355
Projekt
SafeCOP - Safe Cooperating Cyber-Physical Systems using Wireless Communication
Forskningsfinansiär
EU, Horisont 2020, 692529 VinnovaTillgänglig från: 2018-02-08 Skapad: 2018-02-08 Senast uppdaterad: 2019-04-17Bibliografiskt granskad

Open Access i DiVA

fulltext(502 kB)58 nedladdningar
Filinformation
Filnamn FULLTEXT01.pdfFilstorlek 502 kBChecksumma SHA-512
0c5deda745a87e9b4dafafde3a407b40b078c2f9d920bb308be6082c7e13f57452cee8745b647dd95aed589c686dc307ecd9c255e8611f1987aece0ac183f970
Typ fulltextMimetyp application/pdf

Övriga länkar

Förlagets fulltextScopus

Personposter BETA

Uhlemann, Elisabeth

Sök vidare i DiVA

Av författaren/redaktören
Uhlemann, Elisabeth
Av organisationen
Inbyggda system
I samma tidskrift
IEEE Vehicular Technology Conference (VTC) Proceedings
Datorsystem

Sök vidare utanför DiVA

GoogleGoogle Scholar
Totalt: 58 nedladdningar
Antalet nedladdningar är summan av nedladdningar för alla fulltexter. Det kan inkludera t.ex tidigare versioner som nu inte längre är tillgängliga.

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 56 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf