You Lei, Li Jianbo, Wei Changjiang, Dai Chenqu, Xu Jixing, Hu Lejuan
Information Engineering College, Qingdao University, Qingdao, Shandong 266071, China.
ScientificWorldJournal. 2014;2014:603547. doi: 10.1155/2014/603547. Epub 2014 Jun 23.
Routing in delay tolerant networks (DTNs) is a challenge since it must handle network partitioning, long delays, and dynamic topology. Meanwhile, routing protocols of the traditional mobile ad hoc networks (MANETs) cannot work well due to the failure of its assumption that most network connections are available. In this paper, we propose a hop count based heuristic routing protocol by utilizing the information carried by the peripatetic packets in the network. A heuristic function is defined to help in making the routing decision. We formally define a custom operation for square matrices so as to transform the heuristic value calculation into matrix manipulation. Finally, the performance of our proposed algorithm is evaluated by the simulation results, which show the advantage of such self-adaptive routing protocol in the diverse circumstance of DTNs.
在延迟容忍网络(DTN)中进行路由是一项挑战,因为它必须应对网络分区、长延迟和动态拓扑。同时,传统移动自组织网络(MANET)的路由协议由于其大多数网络连接可用这一假设的失效而无法很好地工作。在本文中,我们通过利用网络中流浪分组携带的信息,提出了一种基于跳数的启发式路由协议。定义了一个启发式函数来帮助做出路由决策。我们正式定义了一种针对方阵的自定义运算,以便将启发式值计算转换为矩阵运算。最后,通过仿真结果评估了我们提出的算法的性能,结果表明这种自适应路由协议在DTN的各种情况下都具有优势。