Routing algorithm in opportunistic network based on historical utility
Yang Jun · Journal of Computer Applications · 2013
In view of the low delivery ratio of conventional probabilistic routing in opportunistic networks,an improved routing algorithm based on History Meeting Predictability Routing(HMPR) was put forward.The algorithm was primarily based on the contact duration and the meeting frequency of history information of nodes,and predicted the utility of packets successfully delivered to the destination.Through comparing the utility value,nodes could determine packets whether to be forwarded from them to next hop nodes.The simulation results show that,compared with traditional epidemic routing and probabilistic routing,the proposed routing scheme has better performance in the delivery ratio of packets,the average delay time and the average buffer time.