Change search
ReferencesLink to record
Permanent link

Direct link
Delay and Throughput Analysis for Opportunistic Decode-and-Forward Relay Networks
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
Blekinge Institute of Technology, School of Computing.
2013 (English)Conference paper (Refereed) Published
Abstract [en]

In this paper, we develop a queueing analysis for opportunistic decode-and-forward (DF) relay networks. It is assumed that the networks undergo Nakagami-m fading and that the external arrival process follows a Poisson distribution. By selecting the best relay according to the opportunistic relaying scheme, the source first transmits its signal to the best relay which then attempts to decode the reception and forwards the output to the destination. It is assumed that each relay operates in full-duplex mode, i.e., it can receive and transmit signals simultaneously. The communication process throughout the network can be modeled as a queueing network which is structured from sub-systems of M/G/1 and G/G/1 queueing stations. We invoke the approximate analysis, so-called method of decomposition, to analyze the performance behavior of the considered relay network. The whole queueing network is broken into separate queues which are then investigated individually. Based on this approach, the end-to-end packet transmission time and throughput of the considered relay network are quantified in comparison with the networks with partial relay selection (PRS).

Place, publisher, year, edition, pages
Ho Chi Minh City: IEEE , 2013.
National Category
URN: urn:nbn:se:bth-6956ISI: 000318220400051Local ID: 978-1-4673-2088-7OAI: diva2:834512
International Conference on IEEE Computing, Management and Telecommunications (IEEE ComManTel)
Available from: 2013-06-27 Created: 2013-06-24 Last updated: 2015-06-30Bibliographically approved

Open Access in DiVA

fulltext(188 kB)23 downloads
File information
File name FULLTEXT01.pdfFile size 188 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Chu, Thi My ChinhZepernick, Hans-JürgenArlos, Patrik
By organisation
School of Computing

Search outside of DiVA

GoogleGoogle Scholar
Total: 23 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 24 hits
ReferencesLink to record
Permanent link

Direct link