On the Buffer Size of Perfect RLNC in Full-Duplex Relay Networks

In the next-generation wireless networks, full-duplex, relaying, and random linear network coding (RLNC) are popular techniques to enhance the network performance such as efficiency and reliability. For full-duplex relay networks, a perfect RLNC scheme known as FBPF (Fewest Broadcast Packet First) w...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on vehicular technology Jg. 72; H. 2; S. 1 - 6
Hauptverfasser: Su, Rina, Sun, Qifu Tyler, Li, Xie, Zhang, Zhongshan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York IEEE 01.02.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Automatic repeat request
Buffers
completion delay
Delay
Delays
Full-duplex
Full-duplex system
Graphs
Markov chains
Markov processes
Network reliability
Numerical models
random linear network coding (RLNC)
Receivers
Relay networks
Relay networks (telecommunication)
Relaying
Throughput
Wireless networks
ISSN:0018-9545, 1939-9359
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In the next-generation wireless networks, full-duplex, relaying, and random linear network coding (RLNC) are popular techniques to enhance the network performance such as efficiency and reliability. For full-duplex relay networks, a perfect RLNC scheme known as FBPF (Fewest Broadcast Packet First) was recently proposed and demonstrated a better throughput, or equivalently, expected completion delay performance than the Automatic Repeat Request scheme. However, the original FBPF scheme assumes unlimited buffer and does not take the buffer size into consideration. In this paper, we generalize the FBPF scheme to consider the buffer size as a new parameter. Based on a novel Markov chain model, explicit formulae to characterize the expected completion delay are deduced. Moreover, we present a criterion on the optimal selection of the buffer size under a quality of service constraint, so that the selected buffer size is significantly reduced while the completion delay performance is comparable to the original FBPF scheme with unlimited buffer.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2022.3211880