Abstract:

To aim at the problem that the existing epidemic based routing algorithm has some redundant overhead in exchanging summary vector (SV) and request vector (RV), and storing SV. An efficient low delay epidemic routing algorithm, called epidemic routing based on adaptive compression of vector (ERACV) is proposed. ERACV adaptively compresses the length of SVs and RVs, improves the mechanism of exchanging SVs, and sends the packets to the encounter nodes which are destined to firstly after receiving SV packets. As a result, ERACV decreases the control overhead, memory overhead, and the end to end delay of data packets. Theoretical analysis verifies the effectiveness of ERACV and simulation results show that ERACV reduces the control overhead, the memory overhead of SV, and the average end to end data delay by 39%, 96.4%, and 2.5%, respectively, while keeping the success rate of transmitting data at 100%.