mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct 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
Low Complexity Algorithm for Efficient Relay Assignment in Unicast/Broadcast Wireless Networks
Halmstad University, Halmstad, Sweden.
Mälardalen University, School of Innovation, Design and Engineering, Embedded Systems. Halmstad University, Halmstad, Sweden.ORCID iD: 0000-0001-6497-4099
Halmstad University, Halmstad, Sweden.
2017 (English)In: IEEE Vehicular Technology Conference (VTC) Proceedings, ISSN 1550-2252, Vol. June, article id 8108261Article in journal (Refereed) 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. 

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc. , 2017. Vol. June, article id 8108261
National Category
Computer Systems
Identifiers
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
Available from: 2018-02-08 Created: 2018-02-08 Last updated: 2018-04-18Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Uhlemann, Elisabeth

Search in DiVA

By author/editor
Uhlemann, Elisabeth
By organisation
Embedded Systems
In the same journal
IEEE Vehicular Technology Conference (VTC) Proceedings
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 5 hits
CiteExportLink to record
Permanent link

Direct 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