Delay constraint encoding algorithm in MANETs

摘要

Based on the information of the received packets of neighbors, a node transmits encoding packets of some native data packets by using network coding to reduce the number of transmissions. Therefore, network coding can improve network throughput and decrease energy consumption. This paper studies the delay constraint encoding problem in a router. The problem is proved as a NP-Completed problem. A heuristic minimum delay-constraint first encoding algorithm (MDCFEA) is proposed. The main idea of MDCFEA is sorting the packets to be a queue based their delay constraint in increasing order and then choose the maximum number of packets to be an encode packet from the head of the queue. The experimental results show that MDCFEA can dramatically increase the delay ratio of packets which is received by all the required clients within the delay threshold (up to 149.2%) compared with the representative of the delay aware encoding scheme greedy algorithm (GA).