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 Complexity Algorithm for Efficient Relay Assignment in Unicast/Broadcast Wireless Networks
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
2017 (English)In: 2017 IEEE 85th Vehicular Technology Conference (VTC Spring), [S.l.]: IEEE, 2017Conference paper, Published paper (Refereed)
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
[S.l.]: IEEE, 2017.
Keywords [en]
Relay Networks, Error Probability, Latency, Simulated Annealing, Ant Colony Optimization
National Category
Communication Systems
Identifiers
URN: urn:nbn:se:hh:diva-35051DOI: 10.1109/VTCSpring.2017.8108261ISBN: 978-1-5090-5932-4 (electronic)ISBN: 978-1-5090-5933-1 (print)OAI: oai:DiVA.org:hh-35051DiVA, id: diva2:1143263
Conference
Vehicular Technology Conference, Sydney, Australia, 4-7 June, 2017
Projects
ACDCREADYSafeCOP
Funder
Knowledge FoundationELLIIT - The Linköping‐Lund Initiative on IT and Mobile Communications
Note

Additional funding: the ECSEL Joint Undertaking under grant agreements no 692529, and National funding

Available from: 2017-09-21 Created: 2017-09-21 Last updated: 2018-01-19Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Hoang, Le-NamUhlemann, ElisabethJonsson, Magnus

Search in DiVA

By author/editor
Hoang, Le-NamUhlemann, ElisabethJonsson, Magnus
By organisation
Centre for Research on Embedded Systems (CERES)
Communication Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 97 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