DTN中基于转发概率的散发和等待路由

针对DTN中散发和等待路由中继节点的选择存在盲目性的问题,提出了一种基于转发概率的散发和等待路由协议R-SW.该协议采用"基于转发概率散发+控制拷贝数量"的原则,选择中继节点时进行转发概率的比较,只将报文转发给转发概率较大的中继节点;其次,转发报文数目根据转发概率动态确定,即转发概率高的节点获得较多的转发;另外,加入拥塞控制机制.使用NS2网络模拟软件对算法进行测试,结果表明:所提出的算法可以减少开销和时延,提高报文的投递率,适合在DTN中应用.

Spray and Wait Routing Based on Relay-Probability in DTN

Due to the blindness in choices of relay nodes, a DTN routing algorithm named R-SW (spray and wait routing based on relay-probability) was proposed. In the stage of relay node selection, the probability of packet forwarding and the number of packet copies were under control. If the forwarding probability of a relay node was greater than the current node, packet forwarding would be permitted. Therefore, nodes with larger forwarding probability could carry more packets to avoid causing poor performance in transmission delay and packet delivery ratio. Furthermore, with congestion control, NS2 network simulation software was used to analyze the validity and reliability of the proposed DTN routing algorithm. Simulation results showed that the proposed algorithm could decrease routing overhead and transmission delay, and it could also improve packet delivery ratio, which is suitable for DTN.