An Opportunity Network Routing Algorithm Based on Social Utility Vector
Ji Li · Journal of Henan University · 2016
As the traditional opportunity network routing protocol does not consider the node social problems,a social utility vector was constructed by using the node accumulated history information to predict the change of network topology based on the periodic stability and regularity of the node in the opportunity social network.The opportunity network routing algorithm was therefore proposed based upon the social utility vector,in which each node carries respective social utility vector.According to whether the node and destination node belong to the same community and the forwarding number of messages controlled by the node social delay,the connectivity duration and social validity could be simultaneously used for the forwarding of decision-making messages to avoid their fragmentation.The simulation experiment was performed in the PMTR real data sets.By considering the below three aspects such as the forwarding number of messages,averaged delay of packets and success rate of deliver,the present algorithm would be compared with two classical Epidemic and Prophet algorithms.Additionally,the influences of the message survival time and the node cache space on the routing performance would be also discussed.Simulation results show that compared to Epidemic and Prophet,the proposed algorithm reduce the delay rate and bit error rate,and improve the success rate of delivery.At the same time,it is slightly better in the forwarding number of messages than the above two classical algorithms.