A Novel Routing Scheme for Resource-Constraint Opportunistic Networks: A Cooperative Multiplayer Bargaining Game Approach
Li Li, Yang Qin, Xiaoxiong Zhong · IEEE Transactions on Vehicular Technology · 2015
Routing is a challenging issue in opportunistic networks (OPPNETs). Existing routing schemes in OPPNETs can be classified into two categories: single-copy schemes and multicopy schemes. Single-copy schemes can save network resources but cannot guarantee transmission delay and packet delivery ratio. Multicopy schemes can increase network robustness and reduce average delay and, at the same time, consume a large amount of network resources and induce large overhead. Therefore, it is critical to design an efficient routing scheme that can make a better tradeoff between the performance of multicopy and single-copy schemes in resource-constraint OPPNETs. Inspired by this, in this paper, we propose a novel routing scheme based on a Nash bargaining solution in resource-constraint OPPNETs called GameR. In GameR, we map the distributed message dissemination to a multiplayer bargaining model by constructing a proper utility function based on estimated resource utilization ratio and history delivery predictability. GameR can efficiently utilize the network resources, achieving higher delivery ratio and lower overhead in resource-constraint OPPNETs. Extensive simulation results show that GameR performs better compared with existing classical routing schemes in terms of message delivery ratio, average delay, overhead, goodput, and overall performance.