基于议价博弈的高效机会网络路由算法

Efficient opportunistic network routing algorithm based on bargaining game

现有基于议价博弈的机会网络路由算法存在着因节点交互过程偏多所引起的控制开销过大、对无用消息提出请求时带来了额外开销和博弈双方达成交易概率不高所引起的时延以及SV列表中消息剩余跳数降为1时带来了额外开销等问题,对此提出了一种高效的机会网络路由算法——EORB。该算法通过采用自适应精简数据包摘要、自适应合并SV-DP消息和求购消息、综合考虑买卖双方收益的博弈策略等机制减少了冗余开销,加速了消息的转发速率并提高了消息的到达率。仿真结果表明,该算法有效提高了数据传送到达的成功率,降低了系统开销以及消息的平均端到端时延。

The existing opportunistic network routing algorithms based on bargaining game has excessive control overhead caused by the excessive interaction process of nodes,the additional overhead caused by requesting for useless messages,the additional cost and the delay caused by the low probability of the transaction between the two parties.Besides,when the number of remaining messages in the SV list drops to 1,this condition will result in overhead as well.In response to the above problems,this paper proposes an efficient opportunity network routing algorithm--EORB.The algorithm reduces redundant overhead by adopting adaptive streamlined packet digest,adaptively merging SVDP messages and purchase messages,and comprehensively considering the game strategy of buyers′and sellers′benefits.It accelerates the message forwarding rate and improves the arrival rate of messages.The simulation results show that the algorithm effectively improves the rate of message delivery,reduces system overhead and reduces average end-to-end delay of messages.