Routing Algorithm in Intermittently Connected Wireless Network Based on the Dynamic Programming

LI Yun;YOU Xiao-hu;ZHAO Xiao-na;LIU Qi-lie;

ACTA ELECTRONICA SINICA ›› 2010, Vol. 38 ›› Issue (10) : 2342-2349.

PDF(835 KB)
CIE Homepage  |  Join CIE  |  Login CIE  |  中文 
PDF(835 KB)
ACTA ELECTRONICA SINICA ›› 2010, Vol. 38 ›› Issue (10) : 2342-2349.
学术论文

Routing Algorithm in Intermittently Connected Wireless Network Based on the Dynamic Programming

  • LI Yun1,2, YOU Xiao-hu2, ZHAO Xiao-na1, LIU Qi-lie1,3
Author information +

Abstract

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.

Key words

intermittently connected wireless network / routing / dynamic programming

Cite this article

Download Citations
LI Yun;YOU Xiao-hu;ZHAO Xiao-na;LIU Qi-lie;. Routing Algorithm in Intermittently Connected Wireless Network Based on the Dynamic Programming[J]. Acta Electronica Sinica, 2010, 38(10): 2342-2349.
PDF(835 KB)

2338

Accesses

0

Citation

Detail

Sections
Recommended

/