An Opportunity Networks Routing Algorithm Based On Social Model
Zhuo Tian, Li Baicheng · Advances in intelligent systems research/Advances in Intelligent Systems Research · 2015
In this paper, an opportunity networks routing algorithm, which is suitable a certain social model, is proposed based on social.In this algorithm, the relationship degree between nodes is computed based on the social nature; and the central of nodes is computed based on the level of activity in opportunity networks.An opportunity networks routing algorithm ComOR, which achieves selective forwarding data packets by using the central and relationship degree of nodes,is proposed.Simulation results show that the routing algorithm significantly reduce the consumption of buffer space of equipments and effectively reduce the count of forwarding data packets compared with the present algorithms.In a word,ComOR improves the packets delivery rate and performances stably.