基于联盟形成博弈的异构机会网络路由算法

Routing algorithm based on the coalition formation games in heterogeneous opportunistic networks

异构机会网络中节点组之间存在自私性,节点只会帮助组内的节点转发消息,而不转发组间的节点消息。如何实现节点组间消息的转发成为亟待解决的问题。针对该问题,提出了一种基于联盟形成博弈的机会网络路由(base on coalitional game routing,BCGR)算法。BCGR算法充分考虑了节点间的接触特性、联盟形成博弈的优超特性以及联盟的合成与切分操作,算法由轮询阶段和稳定阶段组成。通过仿真实验验证了BCGR算法的合理性与有效性,仿真结果表明,BCGR算法不但实现了异构机会网络中节点组间消息的转发,而且从整体上提高了网络性能,有效地降低了网络开销,提高了交付率。

As a result of the selfishness of heterogeneous network group in opportunistic networks, the node only can help group node forwarding message rather than forward messages between groups . To solve this problem, the paper puts for- ward a routing algorithm based on coalition formation game-BCGR and verifies the rationality and effectiveness of BCGR al- gorithm through simulation experiments. BCGR algorithm consists of the polling phase and stable phases, which gives full consideration to the contact characteristics between nodes, the dominance characteristics of coalition formation games, and the synthesis and separation operation of coalition. The simulation results show BCGR algorithm not only can forward group messages between nodes in heterogeneous network, but also can improve overall network performance, reduce the network overhead efficiently and increase the delivery rate.