International Journal of Computer Networks and Applications

Open Access Open Access  Restricted Access Subscription Access

CETA: Cooperation Enforcement and Trust Algorithm to Handle Selfish Attack in Delay Tolerant Network


Affiliations
1 Department of computer Science of Faculty of Sciences and Techniques, University of Moulay Ismail, Errachidia, Morocco
 

Nobody can deny that a ‘Delay Tolerant Network (DTN)' is a wireless mobile network capable of withstanding intermittent connectivity and long delays. Furthermore, DTN is a partitioned network that ensures data delivery via the Store and Forward strategy. However, due to resource scarcity (limited storage capacity, limited power, and energy...), DTN can be vulnerable to various types of attacks that can pose a serious threat. Among these types of attacks is selfish behavior, which can potentially ruin the network's integrity, authenticity, confidentiality, and availability. A selfish node tries to maximize its own assets by refusing to transfer other nodes' messages and only forwarding its own. We attempt to investigate the impact of selfish behavior on the existing flooding and forwarding-based routing DTN protocols in this paper. Following that, a comprehensive overview of existing solutions to the selfish attack is presented. To address this threat, we proposed a security mechanism called CETA, which is based on an effective proposed novel algorithm (COOPERATION ENFORCEMENT and TRUST ALGORITHM). The proposed mechanism involves encouraging DTN nodes to collaborate in message forwarding in order to improve delivery probability. Using the ONE simulator, we assessed the performance of our proposed algorithm CETA in DTN under selfish attack. Through simulation tests, CETA efficiency was demonstrated, resulting in promising selfish behavior in terms of delivery probability, overhead ratio, Latency average, and hop count.

Keywords

DTN, Security, Selfish Node, Algorithm, Trust, Cooperative, Attack.
User
Notifications
Font Size

  • F. Hamza and S. M. C. Vigila, “Cluster Head Selection Algorithm for MANETs Using Hybrid Particle Swarm Optimization-Genetic Algorithm,” Int. J. Comput. Netw. Appl., vol. 8, no. 2, pp. 119–129, 2021.

  • F. Warthman, “Delay-and disruption-tolerant networks (DTNs),” Tutor. V 0 Interplanet. Internet Spec. Interest Group, pp. 5–9, 2012.

  • P. Pathak, A. Shrivastava, and S. Gupta, “A Survey on Various Security Issues in Delay Tolerant Networks,” J. Adv. Shell Program., vol. 2, no. 2, pp. 12–18, 2015.

  • P. K. BVSP, S. Sarma, and G. B. Prasad, “A Brief Survey on Security in Delay/Disruption Tolerant Networks,” Int. J. Pure Appl. Math., vol. 118, no. 14, pp. 157–162, 2018.

  • S. Farrell, S. Symington, H. Weiss, and P. Lovell, “Delay-Tolerant Networking Security Overview,” Internet Engineering Task Force, Internet Draft draft-irtf-dtnrg-sec-overview-06, Mar. 2009. Accessed: Aug. 19, 2021. [Online]. Available: https://datatracker.ietf.org/doc/draft-irtf-dtnrg-sec-overview-03

  • P. M. Jawandhiya, M. M. Ghonge, M. S. Ali, and J. S. Deshpande, “A survey of mobile ad hoc network attacks,” Int. J. Eng. Sci. Technol., vol. 2, no. 9, pp. 4063–4071, 2010.

  • P. Goyal, S. Batra, and A. Singh, “A literature review of security attack in mobile ad-hoc networks,” Int. J. Comput. Appl., vol. 9, no. 12, pp. 11–15, 2010.

  • R. Di Pietro, S. Guarino, N. V. Verde, and J. Domingo-Ferrer, “Security in wireless ad-hoc networks–a survey,” Comput. Commun., vol. 51, pp. 1–20, 2014.

  • Q. Li, S. Zhu, and G. Cao, “Routing in socially selfish delay tolerant networks,” in 2010 Proceedings IEEE Infocom, 2010, pp. 1–9.

  • A. Keränen, M. Pitkänen, M. Vuori, and J. Ott, “Effect of non-cooperative nodes in mobile DTNs,” in 2011 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, 2011, pp. 1–7.

  • S. E. Loudari, M. Benamar, and N. Benamar, “New classification of nodes cooperation in delay tolerant networks,” in International Symposium on Ubiquitous Networking, 2015, pp. 301–309.

  • A. Vahdat and D. Becker, “Epidemic routing for partially connected ad hoc networks.” Technical Report CS-200006, Duke University, 2000.

  • R. Wang, Z. Wang, W. Ma, S. Deng, and H. Huang, “Epidemic Routing Performance in DTN with Selfish Nodes,” IEEE Access, vol. PP, pp. 1–1, May 2019, doi: 10.1109/ACCESS.2019.2916685.

  • T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Spray and wait: an efficient routing scheme for intermittently connected mobile networks,” in Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, 2005, pp. 252–259.

  • A. Lindgren, A. Doria, and O. Schelén, “Probabilistic routing in intermittently connected networks,” ACM SIGMOBILE Mob. Comput. Commun. Rev., vol. 7, no. 3, pp. 19–20, 2003.

  • C. C. Sobin, “Analyzing the impact of selfishness on probabilistic routing algorithms in Delay Tolerant Networks,” in 2015 International Conference on Computing and Network Communications (CoCoNet), 2015, pp. 186–190.

  • J. Burgess, B. Gallagher, D. D. Jensen, and B. N. Levine, “MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks.,” in Infocom, 2006, vol. 6.

  • A. Waqas, “Interference Aware Cooperative Routing Algorithm for Wireless Ad Hoc Networks over Nakagami Fading and Lognormal Shadowing,” Int. J. Comput. Netw. Appl., vol. 3, no. 4, p. 78, Aug. 2016, doi: 10.22247/ijcna/2016/v3/i4/48568.

  • L. Buttyán, L. Dóra, M. Félegyházi, and I. Vajda, “Barter trade improves message delivery in opportunistic networks,” Ad Hoc Netw., vol. 8, no. 1, pp. 1–14, 2010.

  • L. Liu, “A survey on barter-based incentive mechanism in opportunistic networks,” in 2013 2nd International Symposium on Instrumentation and Measurement, Sensor Network and Automation (IMSNA), 2013, pp. 365–367.

  • L. Wei, Z. Cao, and H. Zhu, “Mobigame: A user-centric reputation based incentive protocol for delay/disruption tolerant networks,” in 2011 IEEE Global Telecommunications Conference-GLOBECOM 2011, 2011, pp. 1–5.

  • F. Gai, J. Zhang, P. Zhu, and X. Jiang, “Trust on the ratee: a trust management system for social internet of vehicles,” Wirel. Commun. Mob. Comput., vol. 2017, 2017.

  • B. B. Chen and M. C. Chan, “Mobicent: a credit-based incentive system for disruption tolerant network,” in 2010 Proceedings IEEE INFOCOM, 2010, pp. 1–9.

  • S. A. Ezzahidi, E. Sabir, S. Koulali, and E.-H. Bouyakhf, “Robust fully distributed file caching for delay-tolerant networks: A reward-based incentive mechanism,” Int. J. Distrib. Sens. Netw., vol. 13, no. 4, p. 1550147717700149, 2017.

  • S. Jain and A. Verma, “Bubble rap incentive scheme for prevention of node selfishness in delay-tolerant networks,” in Smart innovations in communication and computational sciences, Springer, 2019, pp. 289–303.

  • P. Nagrath, S. Aneja, and G. n. Purohit, “Taxonomy of reputation-based defending mechanisms against types of attacks in delay tolerant networks,” Int. J. Secur. Netw., vol. 16, no. 2, pp. 77–91, Jan. 2021, doi: 10.1504/IJSN.2021.116772.

  • A. Sharma, N. Goyal, and K. Guleria, “Performance optimization in delay tolerant networks using backtracking algorithm for fully credits distribution to contrast selfish nodes,” J. Supercomput., vol. 77, no. 6, pp. 6036–6055, Jun. 2021, doi: 10.1007/s11227-020-03507-4.

  • C. Ş. Şahin, S. Gundry, and M. U. Uyar, “Markov chain analysis of self-organizing mobile nodes,” J. Intell. Robot. Syst., vol. 67, no. 2, pp. 133–153, 2012.

  • https://www.netlab.tkk.fi/tutkimus/dtn/theone/pub/the_one.pdf

  • R. S. Mangrulkar and M. Atique, “Routing protocol for Delay Tolerant Network: A survey and comparison,” in 2010 International Conference on Communication Control and Computing Technologies, Oct. 2010, pp. 210–215. doi: 10.1109/ICCCCT.2010.5670553.


Abstract Views: 315

PDF Views: 1




  • CETA: Cooperation Enforcement and Trust Algorithm to Handle Selfish Attack in Delay Tolerant Network

Abstract Views: 315  |  PDF Views: 1

Authors

Hanane Zekkori
Department of computer Science of Faculty of Sciences and Techniques, University of Moulay Ismail, Errachidia, Morocco
Said Agoujil
Department of computer Science of Faculty of Sciences and Techniques, University of Moulay Ismail, Errachidia, Morocco
Youssef Qaraai
Department of computer Science of Faculty of Sciences and Techniques, University of Moulay Ismail, Errachidia, Morocco

Abstract


Nobody can deny that a ‘Delay Tolerant Network (DTN)' is a wireless mobile network capable of withstanding intermittent connectivity and long delays. Furthermore, DTN is a partitioned network that ensures data delivery via the Store and Forward strategy. However, due to resource scarcity (limited storage capacity, limited power, and energy...), DTN can be vulnerable to various types of attacks that can pose a serious threat. Among these types of attacks is selfish behavior, which can potentially ruin the network's integrity, authenticity, confidentiality, and availability. A selfish node tries to maximize its own assets by refusing to transfer other nodes' messages and only forwarding its own. We attempt to investigate the impact of selfish behavior on the existing flooding and forwarding-based routing DTN protocols in this paper. Following that, a comprehensive overview of existing solutions to the selfish attack is presented. To address this threat, we proposed a security mechanism called CETA, which is based on an effective proposed novel algorithm (COOPERATION ENFORCEMENT and TRUST ALGORITHM). The proposed mechanism involves encouraging DTN nodes to collaborate in message forwarding in order to improve delivery probability. Using the ONE simulator, we assessed the performance of our proposed algorithm CETA in DTN under selfish attack. Through simulation tests, CETA efficiency was demonstrated, resulting in promising selfish behavior in terms of delivery probability, overhead ratio, Latency average, and hop count.

Keywords


DTN, Security, Selfish Node, Algorithm, Trust, Cooperative, Attack.

References





DOI: https://doi.org/10.22247/ijcna%2F2021%2F209989