基于社会关系的低时延机会网络路由算法

A low delay routing algorithm for opportunistic networks based on social relations

针对现有的基于历史信息预测的机会网络路由算法(history based prediction for routing in infrastructure-less opportunistic networks,HBPR)在归属位置单元表更新阶段存在的开销冗余和消息转发阶段存在中继节点选择不合理等问题,提出了1种基于社会关系的低时延机会网络路由算法(a low delay routing algorithm for opportunistic networks based on social relations,LDSR),利用节点社会关系和地理位置信息来选择路由,简化了控制信息;在整个网络区域内设定多个归属位置单元,并在选取中继节点时,以选择与目的节点所在归属位置单元社会关系密切的节点,以及以选择能够缩短携带消息节点与目的节点归属位置单元之间距离的节点为辅。仿真结果表明,与HBPR算法相比,LDSR算法的平均端到端时延缩短了20%。

Tackling the problems in history based prediction for routing in frastructure-less opportunistic networks（ HBPR） that the exchange of control information has redundant overhead and forwarding nodes？ selection is unsuitable, this paper proposed a low delay routing algorithm for opportunistic networks based on social relations （LDSR）. The LDSR algorithm was a multi-copies opportunistic network algorithm which utilizes the nodes？ geographical position information and the social relations. The im-proved algorithm simplifies some control information, and sets some home location cell, in which selecting some nodes closely re-lated to destination node as relay nodes is main routing strategy, and selecting some nodes shortening distance between node car-rying message and destination nodes？ home location cell as relay nodes is assistant routing strategy. Simulation results show that compared with HBPR, LDSR algorithm has decreased 20% in average end to end time delay.