An Efficient Routing Algorithm for DTN Based on Dynamic Segmented Network Coding

To solve the redundant overhead during the transmission of ACK packets and coding packet header, and the end to end affected by the node disorder forwards the coded packets, an Efficient Routing Algorithm for DTN based on Dynamic Segmented Network Coding (ERBNC) is proposed. By discarding the redundant ACK and coding packets in ACK transfer stage, and reducing the coding packet header fields, sets different priorities for coding packets to be forwarded, ERBNC had reduced the network overhead as well as the end-to-end delay of data packets. Simulation results show that, the performance of network overhead and the end-to-end delay of ERBNC algorithm are improved compared with DSNC.