Resource Tuned Optimal Random Network Coding for Single Hop Multicast future 5G Networks

Optimal random network coding is reduced complexity in computation of coding coefficients, computation of encoded packets and coefficients are such that minimal transmission bandwidth is enough to transmit coding coefficient to the destinations and decoding process can be carried out as soon as enco...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:International Journal of Electronics and Telecommunications Ročník 65; číslo 3; s. 463 - 469
Hlavní autoři: Dong, Dhawa Sang, Pokhrel, Yagnya Murti, Gachhadar, Anand, Maharjan, Ram Krishna, Qamar, Faizan, Amiri, Iraj Sadegh
Médium: Journal Article
Jazyk:angličtina
Vydáno: Warsaw Polish Academy of Sciences 01.01.2019
Témata:
Algorithms
Coding
coding coefficients
Coefficients
Complexity
Computation
computational complexity
Computer engineering
Decoding
Internet of Things
Literature reviews
lower triangular matrix
Multiplication
random network coding
Receiving
sparse coding coefficients
Wireless networks
ISSN:2081-8491, 2300-1933
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Optimal random network coding is reduced complexity in computation of coding coefficients, computation of encoded packets and coefficients are such that minimal transmission bandwidth is enough to transmit coding coefficient to the destinations and decoding process can be carried out as soon as encoded packets are started being received at the destination and decoding process has lower computational complexity. But in traditional random network coding, decoding process is possible only after receiving all encoded packets at receiving nodes. Optimal random network coding also reduces the cost of computation. In this research work, coding coefficient matrix size is determined by the size of layers which defines the number of symbols or packets being involved in coding process. Coding coefficient matrix elements are defined such that it has minimal operations of addition and multiplication during coding and decoding process reducing computational complexity by introducing sparseness in coding coefficients and partial decoding is also possible with the given coding coefficient matrix with systematic sparseness in coding coefficients resulting lower triangular coding coefficients matrix. For the optimal utility of computational resources, depending upon the computational resources unoccupied such as memory available resources budget tuned windowing size is used to define the size of the coefficient matrix.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2081-8491
2300-1933
DOI:10.24425/ijet.2019.129800