Efficient opportunistic network routing algorithm based on bargaining game

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 avera