Abstract:

Data exchanges do not require full paths in opportunity networks, and data transfer is based on the node opportunity moving and the probability of two nodes to interact with each other, thus reaching the green energy-saving purpose. But hopbyhop data transmission among nodes  in opportunity network incurs transmission delays and a large number of data copies, resulting in excessive energy consumption. In order to obtain a smaller transmission delay and fewer copies of data, we propose a minimum transmission delay algorithm based on historical transmission efficiency, called MDBHE (Minimum Delay based Historical Efficiency) algorithm, and build a locally high efficient and short transmission path according to historical transmission efficiency. Simulation results show that compared with the traditional opportunistic routing algorithms, the MDBHE algorithm reduces the transmission delay and enhances the success rate of transmission in opportunity networks.

Key words: transmission efficiency;transmission delay;opportunity network;topological structure