Novel compressed linear network coding vectors for multihop communication networks

Random Linear Network Coding (RLNC) is well-known to provide high throughput and low latency for vast communication networks. However, RLNC often suffers from high coefficients overhead, specifically, when it’s applied to limited resource or short-packet networks. Herein, the problem of RLNC coeffic...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Telecommunication systems Ročník 86; číslo 1; s. 83 - 101
Hlavní autori:	Abudaqa, Anas A., Mahmoud, Ashraf S. H., ALsaggaf, Alawi A., Sheltami, Tarek R.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2024 Springer Nature B.V
Predmet:	Artificial Intelligence Business and Management Coding Coefficients Communication networks Communications networks Computer Communication Networks Ethernet Internet of Things IT in Business Network latency Prime numbers Probability Theory and Stochastic Processes Telecommunications systems Wireless networks Network coding Compressed coding vector Coefficients vector overhead Chinese remainder theorem Random linear network coding
ISSN:	1018-4864, 1572-9451
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!