Incentive Cooperation Enforcement Based on Overlapping Coalition Formation Game Framework for Ad Hoc Networks

  • Bo WangEmail author
  • Lihong Wang
  • Weiling Chang
  • Jie Xu
  • Jia Cui
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 905)


Cooperation enhancement in ad hoc networks becomes a research hotspot to encourage cooperative forwarding among selfish nodes. In this paper, we model an overlapping coalition formation game to solve the problem. In this game, each node can freely make its decision to join multiple coalitions simultaneously, in order to maximize its utility for its cooperation. Then, we propose a distributed algorithm (called OCF) using three move rules for the different choices for each node to find a stable coalition structure. At last, we verify the performance of OCF algorithm through extensive simulation. The analysis results demonstrate that the OCF algorithm has a better performance than the classical algorithms for coalition games with disjoint coalition formation (called DCF) and the AODV algorithm with non-cooperative scheme.


Coalition game Game theory Coalition formation Incentive cooperation Ad hoc networks 



The work is supported by National key Research and Development Program of China (Project No. 2016QY03D0504, 2016YFB0801304) and the National Natural Science Foundation of China (Project No. 61300206). The authors wish to thank many referees for their suggestions on this paper.


  1. 1.
    Murthy, C.S.R., Manoj, B.: Ad Hoc Wireless Networks: Architectures and Protocols. Prentice Hall, Upper Saddle River (2004)Google Scholar
  2. 2.
    Zhang, C., Zhou, M.C., Yu, M.: Ad hoc network security: a review. Int. J. Commun. Syst. 20(8), 909–925 (2007)CrossRefGoogle Scholar
  3. 3.
    Ray, D.: A Game-Theoretic Perspective on Coalition Formation. Oxford University Press, New York (2007)CrossRefGoogle Scholar
  4. 4.
    Saad, W., Zhu, H., Debbah, M., Hjorungnes, A., Basar, T.: Coalitional game theory for communication networks. IEEE Signal Process. Mag. 26(5), 7797 (2009)CrossRefGoogle Scholar
  5. 5.
    Chalkiadakis, G., Elkind, E., Markakis, E., Polukarov, M., Jennings, N.R.: Cooperative games with overlapping coalitions. J. Artif. Intell. Res. 39(1), 179–216 (2010)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Wang, T., Song, L., Han, Z., Saad, W.: Overlapping coalitional games for collaborative sensing in cognitive radio networks. In: Proceedings of IEEE Wireless Communication and Networking Conference, Shanghai, China, pp. 4118–4123 (2013)Google Scholar
  7. 7.
    Pu, J.W., Li, C.P., Yu, C.S., Wang, T.Y., Li, H.J.: A coalitional game analysis for selfish packet-forwarding networks. In: Proceedings of WCNC 2012, Shanghai, China (2012)Google Scholar
  8. 8.
    Akkarajitsakul, K., Hossain, E., Niyato, D.: Coalition-based cooperative packet delivery under uncertainty: a dynamic Bayesian coalitional game. IEEE Trans. Mob. Comput. 12(2), 371–385 (2013)CrossRefGoogle Scholar
  9. 9.
    Akkarajitsakul, K., Hossain, E., Niyato, D.: Cooperative packet delivery in hybrid wireless mobile networks: a coalitional game approach. IEEE Trans. Mob. Comput. 12(5), 840–854 (2013)CrossRefGoogle Scholar
  10. 10.
    Saad, W., Han, Z., Debbah, M., Hjorungnes, A.: A distributed coalition formation framework for fair user cooperation in wireless networks. IEEE Trans. Mob. Comput. 8(9), 4580–4593 (2009)Google Scholar
  11. 11.
    The network simulator-ns-2 (2017).
  12. 12.
    Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, LA, USA, pp. 90–100 (1999) Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Bo Wang
    • 1
    Email author
  • Lihong Wang
    • 1
  • Weiling Chang
    • 1
  • Jie Xu
    • 1
  • Jia Cui
    • 1
  1. 1.CNCERT/CCBeijingChina

Personalised recommendations