基于节点位置偏好地点DTN路由算法研究

发布时间：2018-02-04 00:03

本文关键词： DTN 路由算法节点位置 PLBR　出处：《广西大学》2015年硕士论文　论文类型：学位论文

【摘要】：DTN (Delay Tolerant Network)即延迟容忍网络,是人们提出的一种新型网络。主要是适用于消息传输延迟大、消息传输率低、传输过程中链路频繁中断、设备自身能力不强的网络,比如战场上组建的动态网络,移动传感器网络,汽车上自动组建网络等。在对DTN网络的研究工作中,路由算法研究一直是热点。目前DTN路由算法研究取得了一些成果,目前主要有两大类路由算法：基于多副本控制的路由算法和单消息副本的路由策略。其中直接链接和两跳机制,流行性路由算法,最早传递算法等算法都存在着一些不足,有的是网络负载太大,有的是选择路由时没有能根据实际情况灵活的改变路线。本文根据节点设备具有偏向于访问某些地点,而且这种特征是普遍存在和稳定的,本文提出基于节点位置的DTN路由算法协议PLBR。通过收集60位学生和员工的移动设备访问地点的数量,访问的频繁度,访问地点停留时间长度等信息,最后使用MIT Reality项目所提供的节点真实移动轨迹和节点间相遇记录来进行实验,实验数据与冒泡和Label两种路由算法协议进行了比较,在改变各种参数的条件下通过对比数据传输成功率,数据重传次数,和消息传输延迟三个方面的传输情况,最终实验结果证明了PLBR比冒泡和Label两种算法协议更加有效。
[Abstract]:DTN delay Tolerant Network (Delay-tolerant Network) is a new type of network proposed by people, which is mainly suitable for large delay of message transmission and low transmission rate of message. In the research work of DTN network, such as dynamic network on battlefield, mobile sensor network, auto forming network, etc. The research of routing algorithm has been a hot spot. At present, some achievements have been made in the research of DTN routing algorithm. At present, there are two main types of routing algorithms: multi-replication-based routing algorithm and single-message replica routing strategy, including direct link and two-hop mechanism, epidemic routing algorithm. The earliest transfer algorithm and other algorithms have some shortcomings, some of which are too heavy network load. Some of the routing can not be flexibly changed according to the actual situation. According to the node equipment has a bias to visit some locations, and this feature is universal and stable. This paper proposes DTN routing algorithm protocol based on node location. It collects the number of mobile device access sites of 60 students and employees and the frequency of access. Finally, using the MIT Reality project provided by the real movement path of the node and the record of the encounter between the nodes to carry out the experiment. The experimental data are compared with bubbling and Label routing protocols. Under the condition of changing various parameters, the data transmission success rate and data retransmission times are compared. Finally, the experimental results show that PLBR is more effective than bubbling and Label algorithms.
【学位授予单位】：广西大学
【学位级别】：硕士
【学位授予年份】：2015
【分类号】：TN929.5

【参考文献】