Transmission Failure Tolerance and Node Punishment Mechanism in Opportunistic Network Based on Repeated-Game

Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 768)


During the data forwarding in opportunistic network, the selfishness of rational nodes leads to a serious decline in network performance. To solve this problem, this paper proposes a mechanism referred as TFT-NP (transmission failure tolerance and node punishment). TFT-NP takes transmission failure into account, and judges whether the node is selfish or not. It introduces repeated-game theory and sets the penalty cycle of selfish node reasonably. It forces rational nodes to cooperate for a greater profit. Experimental results show that, in opportunistic network with selfish nodes, TFT-NP can improve message delivery rate and reduce message delay significantly.


Opportunistic network Repeated-game Transmission failure 



This work is supported by Major Program of National Natural Science Foundation of China (71633006); The National Natural Science Foundation of China (61672540, 61379057); China Postdoctoral Science Foundation funded project (2017M612586); The Postdoctoral Science Foundation of Central South University (185684).


  1. 1.
    Soelistijanto, B., Howarth, M.P.: Transfer reliability and congestion control strategies in opportunistic networks: a survey. IEEE Commun. Surv. Tutorials 16(1), 538–555 (2014)CrossRefGoogle Scholar
  2. 2.
    Liu, Q.L., Liu, M.S., Li, Y.: Novel game-based incentive strategy for opportunistic networks. Appl. Res. Comput. 25(7), 65–71 (2015)Google Scholar
  3. 3.
    Pan, D.R., Zhang, H., Chen, W.J., et al.: Transmission of multimedia contents in opportunistic networks with social selfish nodes. Multimedia Syst. 21(3), 277–288 (2015)CrossRefGoogle Scholar
  4. 4.
    Wu, J., Chen, Z.G.: Sensor communication area and node extend routing algorithm in opportunistic networks. Peer-to-Peer Network. Appl. 1–12 (2016).
  5. 5.
    Kumar, M., Mishra, R.: An overview of MANET: history, challenges and applications. Indian J. Comput. Sci. Eng. 3(1), 121–125 (2012)Google Scholar
  6. 6.
    Placzek, B.: Selective data collection in vehicular networks for traffic control applications. Transport. Res. Part C Emerg. Technol. 23(7), 14–28 (2011)Google Scholar
  7. 7.
    Wang, D., Chen, Z.G., Wu, J.: Forwarding mechanism in opportunistic networks based on social relations. Appl. Res. Comput. 32(5), 1461–1463 (2015)Google Scholar
  8. 8.
    Li, H., Chen, Z.G., Wu, J.: Opportunistic network routing algorithm based on community and sociality. Comput. Eng. 41(12), 64–68+74 (2015)Google Scholar
  9. 9.
    Chen, Z.G., Wu, J.: Applying a sensor energy supply communication scheme to big data opportunistic networks. KSII Trans. Internet Inf. Syst. 10(5), 2029–2046 (2016)Google Scholar
  10. 10.
    Pereira, P.R., Casaca, A., Rodrigues, J.J.P.C., et al.: From delay-tolerant networks to vehicular delay-tolerant networks. IEEE Commun. Surv. Tutorials 14(4), 1166–1182 (2012)CrossRefGoogle Scholar
  11. 11.
    Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Mag. 44(11), 134–141 (2006)CrossRefGoogle Scholar
  12. 12.
    Zhao, G.S., Chen, M.: Research of incentive-aware data dissemination in selfish opportunistic networks. J. Commun. 34(2), 73–84 (2013)Google Scholar
  13. 13.
    Lu, Y., Shi, J., Xie, L.: Repeated-Game modeling of cooperation enforcement in wireless ad hoc network. J. Softw. 19(3), 755–768 (2008)CrossRefGoogle Scholar
  14. 14.
    Marti, S., Giuli, T., Lai, K.: Mitigating routing misbehavior in mobile ad hoc networks. In: Proceedings of the ACM MobiCom, vol. 6(11), pp. 255–265. ACM Press (2000)Google Scholar
  15. 15.
    Buttyan, L., Hubaux, J.P.: Stimulating cooperation in self-organizing mobile ad hoc networks. Mobile Netw. Appl. 8(5), 579–592 (2003)CrossRefGoogle Scholar
  16. 16.
    Srinivasan, V., Nuggehalli, P., Chiasserini, C.F., et al.: Cooperation in wireless ad hoc networks. Proc. IEEE INFOCOM 2(7), 808–817 (2003)Google Scholar
  17. 17.
    Zhang, C., Liu, H.J., Chen, Z.Y., et al.: Credit-based repeated game model applied in transfer decision of opportunistic network. J. PLA Univ. Sci. Technol. 13(2), 152–158 (2012)Google Scholar
  18. 18.
    Ye, H., Chen, Z.G., Zhao, M.: ON-CRP: cache replacement policy for opportunistic networks. J. Commun. 31(5), 98–107 (2010)Google Scholar
  19. 19.
    Fudenberg, D., Maskin, E.: The folk theorem in repeated games with discounting or with incomplete information. Econometrica 54(3), 533–554 (2015)MathSciNetCrossRefMATHGoogle Scholar
  20. 20.
    Wang, Z., Wang, X.H., Sui, J.Q.: Extending research for ONE simulator of opportunistic network. Appl. Res. Comput. 29(1), 272–277 (2012)Google Scholar

Copyright information

© Springer Nature Singapore Pte Ltd. 2017

Authors and Affiliations

  1. 1.School of SoftwareCentral South UniversityChangshaChina
  2. 2.“Mobile Health” Ministry of EducationChina Mobile Joint LaboratoryChangshaChina

Personalised recommendations