Markov Chain-Based Routing Algorithm in Delay-Tolerant Networks
Applications and the Internet（2012）
摘要
Delay-tolerant networking (DTN) is a type of wireless network architecture that works to determine an approach to address the technical issues in rugged environments, in which routing paths are unstable, and continuous network connectivity may not be available. This paper proposes MCR, a routing algorithm based on the Markov chain and uses the node's past interactions with others to determine the potential routing. The process consists of a finite number of states with the order 1 or 2 and O(n) space complexity instead of O(n2) for Maxprop. The experimental results show that MCR outperforms Maxprop and Prophet, especially in resource-limited scenarios.
更多查看译文
关键词
resource-limited scenario,markov chain based routing algorithm,prophet,continuous network connectivity,space complexity,routing algorithm,maxprop,finite number,radio networks,delay tolerant networks,delay-tolerant networks,delay-tolerant network,past interaction,potential routing,markov chain,wireless network architecture,markov chain-based routing algorithm,telecommunication network routing,routing paths,markov processes,dtn,protocols,routing,prediction algorithms,mathematical model,mobile computing
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要