Towards minimising the coefficient vector overhead in random linear Network Coding

Network Coding is a promising approach to increase network throughput and robustness to facilitate high volume traffic. Performing network coding in dynamic network structures requires transmitting coding coefficients for information sinks to decode network coded packets. Compared to the packet size...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the ... IEEE International Conference on Acoustics, Speech and Signal Processing (1998) s. 5127 - 5131
Hlavní autori: de Alwis, Chamitha, Arachchi, H. Kodikara, Fernando, Anil, Kondoz, Ahmet
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.05.2013
Predmet:
Algorithm design and analysis
Coefficient Compression
Compression algorithms
Encoding
Galois fields
Network coding
Network topology
Random Linear Network Coding
Vectors
ISSN:1520-6149
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Network Coding is a promising approach to increase network throughput and robustness to facilitate high volume traffic. Performing network coding in dynamic network structures requires transmitting coding coefficients for information sinks to decode network coded packets. Compared to the packet sizes used in practical networks, the size of coefficient vectors can be significant. This paper exploits the properties of small and medium sized networks and proposes a novel approach to minimise the coefficient vector size of network coded packets. Simulation results exhibit better compression of coefficient vectors over existing algorithms for small and medium sized networks.
ISSN:1520-6149
DOI:10.1109/ICASSP.2013.6638639