A Routing Algorithm for DTN Based on Connected Sequence of Utility

To solve overestimate the communication path accessibility in select relay node ignore order of connection, an Routing Based on Connected Sequence of Utility (RBCSU) is proposed. This algorithm estimate the connection status by using the community between nodes connected sequence. Furthermore, using node of reachable rate, time-delay degree and similarity to calculate the utility value, and then the preferable relay peers could be chosen by compare to the utility value. The result of simulation, which is compared to other well-known algorithms, indicated that this algorithm is improves the message delivery rate and reduce the overhead ratio.