A novel epidemic routing based on mobility and occurrence probability in buffer-limited opportunistic networks

摘要

Under the opportunistic network environments, normal network protocols can hardly transfer data successfully and efficiently. In order to overcome this problem, many new routing algorithms have been raised pertinently. Thereinto, the Epidemic routing algorithm is a typical approach, which maintains least delay with a highest delivery ratio. However, it is a defective method for routing data as it requires an infinite node cache and results in infinite circulate even one of the data duplicates arrived at the destination, which is proved to be an extremely limitation on its routing performance. Confronted with this drawback, this paper puts forward a novel Epidemic Routing based on Mobility and Probability of Occurrence (MPOER), which endows message with a "Hop Life" dynamically. And, we formulates with a simulation platform called "The ONE", and the experiment shows that the approach proposed can increase the routing performance in several aspects just sacrifice some delay performance.