Research on Improved Floyd Routing Algorithm in Opportunistic Networks

According to the traditional shortest path algorithm is not suitable for the routing choice in community model of Opportunistic Networks, we propose an improved Floyd shortest path algorithm. This improved algorithm not only considers the space factor between the nodes in opportunistic networks, but also takes into account the time factor of the wireless links.The simulation results show that, compared with the existing FC(First Contact), DD(Direct Delivery) routing algorithm, this improved algorithm can more effectively get the shortest delay paths in opportunistic networks.