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
Delay- and Diversity-Aware Buffer-Aided Relay Selection Policies in Cooperative Networks
Univ Aegean, Dept Informat & Commun Syst Engn, Samos 83200, Greece..
KTH, School of Electrical Engineering and Computer Science (EECS), Automatic Control.
Aalto Univ, Sch Elect Engn, Dept Elect Engn & Automat, Espoo 02150, Finland..
Univ Cyprus, Elect & Comp Engn Dept, CY-1678 Nicosia, Cyprus..
Show others and affiliations
2018 (English)In: IEEE Access, E-ISSN 2169-3536, Vol. 6, p. 73531-73547Article in journal (Refereed) Published
Abstract [en]

Buffer-Aided (BA) relaying has shown tremendous performance improvements in terms of throughput and outage probability, although it has been criticized of suffering from long delays that are restrictive for applications, such as video streaming, Web browsing, and file sharing. In this paper, we propose novel relay selection policies aiming at reducing the average delay by incorporating the buffer size of the relays into the decision making of the relay selection process. More specifically, we first propose two new delay-aware policies. One is based on the hybrid relay selection algorithm, where the relay selection takes into account the queue sizes so that the delay is reduced and the diversity is maintained. The other approach is based on the max - link relay selection algorithm. For the max - link algorithm, a delay-aware only approach starves the buffers and increases the outage probability of the system. Thus, for max - link, we propose a delay- and diversity-aware BA relay selection policy targeting the reduction of the average delay, while maintaining the diversity of the transmission. The proposed policies are analyzed by means of Markov Chains and expressions for the outage, throughput, and delay are derived. The asymptotic performance of the policies is also discussed. The improved performance in terms of delays and the use of the proposed algorithms are demonstrated via extensive simulations and comparisons, signifying, at the same time, the need for adaptive mechanisms to handle the interplay between delay and diversity.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2018. Vol. 6, p. 73531-73547
Keywords [en]
Cooperative relaying, relay selection, buffer-aided relaying, delays, diversity, Markov chains
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-241238DOI: 10.1109/ACCESS.2018.2883894ISI: 000454255300001Scopus ID: 2-s2.0-85057852749OAI: oai:DiVA.org:kth-241238DiVA, id: diva2:1279511
Note

QC 20190116

Available from: 2019-01-16 Created: 2019-01-16 Last updated: 2019-01-16Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Poulimeneas, Dimitrios

Search in DiVA

By author/editor
Poulimeneas, Dimitrios
By organisation
Automatic Control
In the same journal
IEEE Access
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

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