机会网络中基于定向数据传输的地理路由算法

Geographic routing algorithm based on directional data transmission for opportunistic networks

机会网络基于方向的地理路由(DIG)算法存在数据分组传输时延偏大以及成功率偏低的问题,这是由于DIG算法使数据在缓存中的等待时间过长且不能有效保证携带数据的节点向目的节点方向移动,针对该问题,提出了基于定向数据传输的地理路由(GRDDT)算法。该算法采用了一种新的数据转发机制并且更加有效地利用邻居表信息,有效避免了以上情形的出现,从而达到降低数据分组传输时延并提高成功率的目的。OPNET仿真实验结表明,与DIG算法相比,GRDDT算法在传输时延和数据传输成功率等方面的性能均得到提高。

Opportunistic network routing algorithm based on geographic location information in Direction based Geographic routing scheme （DIG） has the problems of large delay and low success rate, which is due to that DIG algorithm makes the waiting time of the data in the cache too long and cannot guarantee the data-carrying node move to the destination node. To solve these problems, Geographic Routing algorithm based on Directional Data Transmission （GRDDT） was proposed. The algorithm used a new data forwarding mechanism and a more effective use of the neighbor list information, effectively avoiding the appearance of the above circumstances, so as to reduce data packet transmission delay and to improve the success rate. OPNET simulation results show that, the performance of transmission delay and success rate of GRDDDT algorithm are improved compared with DIG.