一种基于旁听的机会网络路由算法

Routing algorithm for opportunistic networks based on overhearing

针对基于议价博弈的概率路由算法存在消息传送成功率提升偏慢、开销大、节点无序情况下竞争信道引起碰撞以及节点在多邻居状态下存在冗余交互的问题,提出一种基于旁听的机会网络路由算法—ORON。ORON算法通过旁听邻居节点信息,设计博弈策略使激励相容,节点对邻居与自身的交易状态进行分析,选择最佳策略,使得网络性能得到提升。仿真验证了ORON算法设计的有效性,结果表明,与基于议价博弈的现有路由算法GSCP相比,ORON算法的吞吐量和消息传送成功率至少提高了6.72%,而控制开销和平均端到端消息时延则分别降低了20%和3.55%以上。

To address the issues existing in the bargaining-game-based probabilistic routing algorithms, including that message forwarding success ratio increase slowly, large overhead, collision caused by competitive channel in the case of node disorder and node with many neighbors causing redundant overhead during interactive procedure, this paper proposed a routing algo- rithm based on overhearing for opportunistic networks, called ORON. Through overhearing its neighbors, designing game strat- egy to make incentive compatibility, node analyzed its condition comparing with its neighbors, then chose the best strategy, which will improve the performance of the network. Simulation verifies the effectiveness of ORON. Results show that ORON could improve the network throughput and success ratio at least 6.72%, and reduce the control overhead and average end-to- end delay by more than 20% and 3.55%, respectively, comparing with GSCP algorithms.