Routing Algorithm in Intermittently Connected Wireless Network Based on the Dynamic Programming
Qilie Liu · Dianzi xuebao · 2010
Because of the natural interference or the requirement of network planning,wireless links are intermittently connected in wireless networks,which are called intermittently connected wireless networks(ICN).The routing optimization in ICNs is a new challenge because it requires to consider the links′characteristics of both time-relevant and space-relevant.This paper proposed a novel routing algorithm,Dynamic Programming Routing Algorithm(DPRA),for ICNs.DPRA is based on statistical characteristics of wireless links,and uses the dynamic programming method to choose the shortest delay path.Simulation results indicate that the proposed routing algorithm is effective.