Random linear network coding (RLNC)

For more info about our services contact : help@bestpfe.com

Table of contents

1 Introduction 
2 Related work 
2.1 Network Coding and its benets
2.2 Linear Network Coding versus Non-linear Network Coding
2.3 Linear Network Coding – Deterministic versus Random
2.4 Network coding approaches in the thesis
2.5 Interow network coding (Opportunistic Network Coding)
2.5.1 Coding Opportunistically (COPE)
2.5.2 Distributed Coding-Aware Routing (DCAR)
2.5.3 MAC-layer proactive mixing for Network Coding (BEND)
2.6 Intraow network coding (Random linear network coding)
2.6.1 Source coding versus batch coding
2.6.2 Generation
2.6.3 Batch Coding
2.6.4 Pipeline Coding
2.6.5 Transmission Control Protocol with Network Coding (TCP/NC)
2.7 Applications of network coding into current network systems
2.7.1 Wireless networks
2.7.1.1 Multi-hop tracows in wireless networks
2.7.1.2 Broadcast in wireless networks
2.7.1.3 Coding-aware routing metric
2.7.1.4 Opportunistic routing
2.7.2 Ad-hoc sensor networks
2.7.3 Peer to peer (P2P) le distribution
2.7.4 Network security
2.8 Problem statement
2.9 Chapter conclusion
3 Interow network coding 
3.1 Distributed and Diused Encoding (DODE)
3.1.1 Coding chance improvement
3.1.2 Generalized coding condition of DODE
3.2 Distributed and Diused Encoding with Multiple Decoders (DODEX)
3.2.1 Coding chance improvement
3.2.2 Generalized coding condition of DODEX
3.3 Distributed and Diused Encoding with Multiple Encoders and Multiple
Decoders (DODEX+)
3.3.1 Coding chance improvement
3.3.2 Generalized coding condition of DODEX+
3.4 Design
3.4.1 Node architecture
3.4.1.1 Neighbor list and source routing list
3.4.1.2 Decoder list
3.4.1.3 Queuing system
3.4.2 Routing metric with coding chance discovery for DSDV protocol – SPENM
3.4.3 Modied DSDV packet format
3.4.4 Node behavior
3.4.4.1 COPE and BEND
3.4.4.2 DCAR and DODE
3.4.4.3 DODEX and DODEX+
3.5 Simulation and results
3.5.1 DODE
3.5.2 DODEX
3.5.3 DODEX+
3.6 Chapter conclusion
4 Intraow network coding 
4.1 Multi-batch Pipeline Coding with Adaptive Redundancy Control (ARC)
4.1.1 Design
4.1.2 DRTT estimation
4.1.3 Adaptive redundancy scheme
4.1.4 Node behavior
4.1.5 Simulation and results
4.2 Dynamic Coding (DynCod)
4.2.1 Packet denition
4.2.2 Design
4.2.3 Dynamic information vector
4.2.4 Adaptive redundancy control
4.2.5 Simplied encoding vectors to reduce overhead
4.2.6 Multipath DynCod (MP-DynCod)
4.2.6.1 Design
4.2.6.2 Forwarding belt assignment
4.2.6.3 Feedback of link quality
4.2.6.4 Adaptive redundancy control
4.2.6.5 Node behavior
4.2.7 Simulation and results
4.2.7.1 DynCod
4.2.7.2 MP-DynCod
4.3 Chapter conclusion
5 Conclusion and Future Work 
5.1 Conclusion
5.2 Future Work
List of Publications
Appendices
A Mathematical Background 
A.1 Linear Framework F2s
A.1.1 Encoding
A.1.2 Decoding
A.2 Matrix and Gaussian elimination
A.3 Finite eld operations
B Practical Considerations 
B.1 Decoding matrix
B.2 Decoding delay
C Ad-hoc routing protocols 
C.1 Destination-Sequenced Distance Vector (DSDV)
C.2 Ad-hoc On-demand Distance Vector (AODV)
References