dtn中具有概率选择的散发等待路由的分析word格式论文.docx

destination node immediately, the message will get the high delay and reduce the message delivery probability. In this paper, we put the Probability choose in Spray and Wait routing, every node has a probabilistic vector, when the two nodes meet, they compare their vector firstly, and when the vector is bigger than the other’s, they will spray packet, therefore, the node has high probability will carry much packets.The improvement of delivery message. When spray packet in the original Spray and Wait routing, the number of spray packet has two ways. The one method is source spray, which spray only one packet to relay node. The other method is Binary Spray and Wait, which spray half number packet to the relay node. In this paper, the number of spray packet is has something to do with the probabilistic vector, which is the product of probability and the number of packets in one node. Therefore, the node has high probability will get much packets.The introduction of the Delivery Utility index. In the simulations, weintroduce a new performance index, which is Delivery Utility, which can better assess the performance of the algorithm. We use the ONE simulator to build the human network. Then we simulate the routing algorithm, and compare the results with other routing algorithms.Keywords: DTN, Delay Tolerant Network，Spray and Wait routing, Delivery UtilityIV附图表图 1.1：DTN 网络体系结构 - 2 -图 1.2：DTN 网络中数据束的存储转发 - 3 -图 1.3：OSI 和 TCP/IP 参考模型 - 4 -图 1.4：DTN 网络体系参考模型 - 5 -图 1.5：DTN 网络中的聚束层 - 6 -图 1.6：一种简单的 DTN 网络示意图- 7 -图 1.7：Kiosk 网络结构 - 9 -图 2.1：摆渡节点在普通节点间进行数据的传递- 15 -图 2.2：单路由算法和多路由算法结构- 17 -图 2.3：节点中继算法和摆渡中继算法- 17 -图 2.4：蔓延路由算法中节点报文的交换- 20 -图 2.5：概率路由中节点间报文的转发- 23 -表 2.1：几种常见算法的比较- 24 -图 3.1：SUVnet 图形结构 - 26 -图 3.2：概率散发等待中报文的转发- 29 -图 3.3：概率散发等待中报文的转发策略- 31 -图 3.4：节点间概率的传递- 33 -图 3.5：算法流程图- 35 -图 3.6：算法原理图- 36 -表 4.1：常见的模拟仿真工具的比较- 38 -图 4.1：The ONE 仿真器的图形用户界面 - 39 -图 4.2：The ONE 仿真器的原理示意图 - 40 -图 4.3：The ONE 中赫尔辛基仿真区域 - 42 -图 4.4：The ONE 仿真器批处理窗口 - 43 -图 4.5：The ONE