Skip to main content
SpringerLink
Log in

Selfish Controlled Scheme in Opportunistic Mobile Communication Network

  • Conference paper
  • First Online:
Recent Developments in Machine Learning and Data Analytics

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 740))

  • 1029 Accesses

Abstract

The opportunistic mobile communication network is a social communication network, where every node depends on the other in transferring data. Thus, every node makes a potential router. However, due to the lack of resource, nodes tend to become selfish by dropping the messages relayed through them. In this paper, an algorithm is proposed to control such selfish nodes from overtaking the network. The proposed algorithm is designed for an uncertain stochastic network environment, where the popular strategy like Tit for Tat (TFT) fails. It is further compared with Generous popular approaches such as Generous Tit for Tat (GTFT) and Generous Zero-determinant (GenZD). Furthermore, the simulation study has shown that it outperforms the GTFT and GenZD while controlling the free rider selfish nodes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Keränen, A., Ott, J., Kärkkäinen, T.: The ONE simulator for DTN protocol evaluation. In: SIMUTools ’09: Proceedings of the 2nd International Conference on Simulation Tools and Techniques, ICST, New York, NY, USA (2009)

    Google Scholar 

  2. Misra, S., Pal, S., Saha, B.K.: Distributed information-based cooperative strategy adaptationin opportunistic mobile networks. IEEE Trans. Parallel Distrib. Syst. 26(3), 724–737 (2015). https://doi.org/10.1109/TPDS.2014.2314687

    Article  Google Scholar 

  3. Nowak, M.A., Sigmund, K.: The alternating prisoner’s dilemma. J. Theoret. Biol. 168(2), 219–226 (1994). https://doi.org/10.1006/jtbi.1994.1101. http://www.sciencedirect.com/science/article/pii/S0022519384711015

  4. Pelusi, L., Passarella, A., Conti, M.: Opportunistic networking: data forwarding in disconnected mobile ad hoc networks. IEEE Commun. Mag. 44(11), 134–141 (2006). https://doi.org/10.1109/mcom.2006.248176

    Article  Google Scholar 

  5. Press, W.H., Dyson, F.J.: Iterated prisoners dilemma contains strategies that dominate any evolutionary opponent. Proc. Natl. Acad. Sci. 109(26), 10,409–10,413 (2012). https://doi.org/10.1073/pnas.1206569109

  6. Sekiguchi, T.: Efficiency in repeated prisoner’s dilemma with private monitoring. J. Econ. Theory 76(2), 345–361 (1997). https://doi.org/10.1006/jeth.1997.2313. http://www.sciencedirect.com/science/article/pii/S0022053197923139

  7. Shevade, U., Song, H.H., Qiu, L., Zhang, Y.: Incentive-aware routing in DTNs. In: 2008 IEEE International Conference on Network Protocols, pp. 238–247 (2008), https://doi.org/10.1109/ICNP.2008.4697042

  8. Socievole, A., Rango, F.D., Caputo, A., Marano, S.: Simulating node selfishness in opportunistic networks. In: 2016 International Symposium on Performance Evaluation of Computer and Telecommunication Systems (SPECTS), pp. 1–6 (2016). https://doi.org/10.1109/SPECTS.2016.7570516

  9. Stewart, A.J., Plotkin, J.B.: Extortion and cooperation in the prisoners dilemma. Proc. Natl. Acad. Sci. 109(26), 10,134–10,135 (2012). https://doi.org/10.1073/pnas.1208087109

  10. Tang, C., Li, X., Wang, Z., Han, J.: Cooperation and distributed optimization for the unreliable wireless game with indirect reciprocity. Sci. China Inf. Sci. 60(11), 110,205 (2017). https://doi.org/10.1007/s11432-017-9165-7

  11. Yin, L., Lu, H., Cao, Y., Gao, J.: Cooperation in delay tolerant networks. In: 2010 2nd International Conference on Signal Processing Systems, vol. 1, pp. V1-202–V1-205 (2010). https://doi.org/10.1109/ICSPS.2010.5555572

  12. Zhang, X., Wang, X., Liu, A., Zhang, Q., Tang, C.: Reputation-based scheme for delay tolerant networks. In: Proceedings of 2011 International Conference on Computer Science and Network Technology (2011). https://doi.org/10.1109/iccsnt.2011.6182124

  13. Zhu, H., Lin, X., Lu, R., Fan, Y., Shen, X.: Smart: a secure multilayer credit-based incentive scheme for delay-tolerant networks. IEEE Trans. Veh. Technol. 58(8), 4628–4639 (2009). https://doi.org/10.1109/TVT.2009.2020105

    Article  Google Scholar 

Download references

Acknowledgements

This work is supported by UKIERI Grant 184-15/2017(IC). The authors express their acknowledgment to the anonymous reviewers for their encouraging comments.

Author information

Authors and Affiliations

  1. School of Science and Engineering, Dibrugarh University, Dibrugarh, Assam, India

    Moirangthem Tiken Singh

  2. Department of Mathematics, Dibrugarh University, Dibrugarh, Assam, 786004, India

    Surajit Borkotokey

Authors
  1. Moirangthem Tiken Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Surajit Borkotokey
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Moirangthem Tiken Singh .

Editor information

Editors and Affiliations

  1. College of Engineering and Applied Science, University of Colorado Colorado Springs, Colorado Springs, CO, USA

    Jugal Kalita

  2. Automation and Applied Informatics, Aurel Vlaicu University of Arad, Arad, Romania

    Valentina Emilia Balas

  3. Department of Computer Applications, Sikkim Manipal University, Sikkim, India

    Samarjeet Borah

  4. Department of Computer Applications, Sikkim Manipal University, Sikkim, India

    Ratika Pradhan

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Singh, M.T., Borkotokey, S. (2019). Selfish Controlled Scheme in Opportunistic Mobile Communication Network. In: Kalita, J., Balas, V., Borah, S., Pradhan, R. (eds) Recent Developments in Machine Learning and Data Analytics. Advances in Intelligent Systems and Computing, vol 740. Springer, Singapore. https://doi.org/10.1007/978-981-13-1280-9_34

Download citation

Publish with us

Policies and ethics

Search

Navigation