Research on Efficient Routing Algorithm Based on Dynamic Segmentation Network Coding

In order to solve the problem of existing routing algorithms, an efficient routing algorithm based on dynamic segmentation network coding (ERBNC) is proposed. By compressing the header of the encoded packet, deleting the redundant ACK packet and setting the priority of sending the encoded packet, th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2018 International Conference on Intelligent Transportation, Big Data & Smart City (ICITBS) S. 202 - 205
Hauptverfasser: Li, Cong, Wu, Yonghao
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.01.2018
Schlagworte:
Big Data
Conferences
Decoding Predictions
Delay Tolerant Networks
Network Coding
Redundant Control
Routing Algorithms
Smart cities
Transportation
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In order to solve the problem of existing routing algorithms, an efficient routing algorithm based on dynamic segmentation network coding (ERBNC) is proposed. By compressing the header of the encoded packet, deleting the redundant ACK packet and setting the priority of sending the encoded packet, the proposed algorithm reduces the network overhead and packet average end-to-end delay. The simulation experiments of ERBNC algorithm, dynamic segmented network coding (DSNC) algorithm and segmented network coding (SNC) algorithm were completed by using OPNET simulation software. The performance of various algorithms is compared and analyzed. The simulation results show that the ERBNC algorithm can effectively reduce the network overhead and reduce the average end-to-end delay of data packets.
DOI:10.1109/ICITBS.2018.00059