Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Agoujil, Said
- CETA: Cooperation Enforcement and Trust Algorithm to Handle Selfish Attack in Delay Tolerant Network
Abstract Views :204 |
PDF Views:1
Authors
Affiliations
1 Department of computer Science of Faculty of Sciences and Techniques, University of Moulay Ismail, Errachidia, MA
1 Department of computer Science of Faculty of Sciences and Techniques, University of Moulay Ismail, Errachidia, MA
Source
International Journal of Computer Networks and Applications, Vol 8, No 5 (2021), Pagination: 585-595Abstract
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.Full Text
References
- 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.
- COLSR An Efficient Mechanism to Secure OLSR Protocol Against Multipoint Relay Attack
Abstract Views :273 |
PDF Views:1
Authors
Affiliations
1 Department of Science Computer, University of Sciences and Technologies Errachidia, MA
1 Department of Science Computer, University of Sciences and Technologies Errachidia, MA
Source
International Journal of Computer Networks and Applications, Vol 8, No 5 (2021), Pagination: 671-681Abstract
A MANET (Mobile Ad Hoc NETwork) can be considered as a collection of self-organizing mobile devices that can communicate without the aid of an integrated infrastructure or a back-end administration. Defense, crisis management, telemedicine, tele-geoprocessing, virtual navigation, commercial and civil environment, etc. are multiple applications of this type of network. However, MANETs present several significant constraints, including restricted processing capabilities, limited bandwidth, short battery life and vulnerability to multiple attacks. This paper introduces the negative effect of the Multipoint Relay (MPR) attack against an effective routing MANET protocol, OLSR (Optimized Link State Routing). In this attack, a malicious node can broadcast altered control messages over the network to cause loss of messages and connectivity. After a study of existing solutions, a security extension, named COLSR (CMAC for OLSR) and based on CMAC (Cipher-based Message Authentication Code) is proposed and validated by simulations under the OMNeT++/INETMANET environment with the integration of the Crypto ++ library. Our solution offers a good compromise between robustness in terms of security and protocol performance. It ensures the integrity of the OLSR control messages, nodes authentication and has the advantage of a modest impact on the network performances.Keywords
MANET, OLSR, MPR Attack, Wireless Security, COLSR.Full Text
References
- Moudni H., Er-rouidi M., Faouzi H., Mouncif H., El Hadadi B. “Enhancing Security in Optimized Link State Routing Protocol for Mobile Ad Hoc Networks”. In: Sabir E., García Armada A., Ghogho M., Debbah M. (eds) Ubiquitous Networking. UNet 2017. Lecture Notes in Computer Science, vol 10542, pp. 107-116, 2017.
- Azeez A.A.A., Isaac E., Thampi S.M. “Anonymous and Secured Communication Using OLSR in MANET”. In: Abraham A., Mauri J.L., Buford J.F., Suzuki J., Thampi S.M. (eds) Advances in Computing and Communications. ACC 2011. Communications in Computer and Information Science, vol 193, 2011, pp. 145-154. Springer, Berlin, Heidelberg.
- Clausen Ed. and Jacquet Ed., “Optimized Link State Routing Protocol”. IETF: The Internet Engineering Task Force, RFC 3626, p. 8, October 2003.
- Hajare, Priyanka and P. Tijare. “Secure Optimized Link State Routing Protocol for Ad-Hoc Networks”. (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 3 (1), 2012, pp. 3053-3058.
- Abderrahim Hajji Soualfi and Said Agoujil. “Performance Impacts Of Multipoint Relay Attack Against OLSR Protocol”, International Journal of Scientific & Technology Research 9, 2020, pp. 1662-1666.
- Ferrag, M. and M. Nafaa. “Securing the OLSR routing protocol for Ad Hoc Detecting and Avoiding Wormhole Attack”. Cyber Journals: Multidisciplinary Journals in Science and Technology, Journal of Selected Areas in Telecommunications (JSAT), April Edition, 2011, pp. 51-58.
- D. Raffo, C. Adjih, T. Clausen, and P. Muhlethaler. “Securing OLSR using node locations”. In Proceedings of 2005 European Wireless (EW 2005), pages 437-443, Nicosia, Cyprus, April 10–13 2005.
- E.A. Panaousis, G. Drew, G. Millar, T.A. Ramrekha, C. Politis, “A Test-bed Implementation for Securing OLSR in Mobile Ad-hoc Networks”, International Journal of Network Security & Its Applications, Vol. 2, No. 4, pp. 141-160, October 2010.
- T. Clausen, U. Herberg, and J. Milan. “Digital signatures for admittance control in the optimized link state routing protocol version 2”. Research Report RR-7216, INRIA, February 2010.
- Azeez, A.A., Isaac, E., Thampi, S.M.: “Anonymous and secured communication using OLSR in MANET”. In: Abraham, A., Mauri, J.L., Buford, J.F., Suzuki, J., Thampi, S.M. (eds.) ACC 2011. CCIS, vol. 193, pp. 145–154. Springer, Heidelberg (2011). doi:10.1007/978-3-64222726-4_16.
- Selvi, K.T., Kuppuswami, S.: “Enhancing security in Optimized Link State Routing protocol for MANET using threshold cryptography technique”. In: 2014 International Conference on Recent Trends in Information Technology (ICRTIT), pp. 1–6. IEEE, April 2014.
- Dutta, C.B., Biswas, U. .“Specification based IDS for camouflaging wormhole attack in OLSR”. In: 2015 23th Mediterranean Conference on Control and Automation (MED), pp. 960–966. IEEE, June 2015.
- S. Gadekar and S. Kadam, “Secure optimized link state routing (OLSR) protocol against node isolation attack”, 2017 IEEE International Conference on Power, Control, Signals and Instrumentation Engineering (ICPCSI), Chennai, 2017, pp. 684-687.
- INDRAUSHA RANI, V., REDDY, K. .“To Improve The Security Of OLSR Routing Protocol Based On Local Detection Of Link Spoofing”. IJSEAT, North America, 5, pp. 652-655. jun. 2017.
- H. Priyadarshani et al., “Enhancing the security of OLSR protocol using reinforcement learning”, 2017 National Information Technology Conference (NITC), Colombo, 2017, pp. 49-54.
- R. Bhuvaneswari and R. Ramachandran, “Comparative Analysis of E-OLSR Algorithm in the Presence of Routing Attacks in MANET”, International Journal of Sensors, Wireless Communications and Control (2018) 8: 65.
- H. Kanagasundaram and A. Kathirvel, “EIMO-ESOLSR: energy efficient and security-based model for OLSR routing protocol in mobile ad-hoc network”, in IET Communications, vol. 13, no. 5, pp. 553-559, 19 3 2019.
- Christof Paar and Jan Pelzl. 2009. “Understanding Cryptography: A Textbook for Students and Practitioners (1st. ed.)”. Springer Publishing Company, Incorporated.
- Majed Alrowaithy and Nigel Thomas. 2019. “Investigating the Performance of C and C++ Cryptographic Libraries”. In Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools (VALUETOOLS 2019). Association for Computing Machinery, New York, NY, USA, 167–170.
- ChaCha20 and Poly1305 for IETF Protocols. Y. Nir, A. Langley. May 2015. (Format: TXT, HTML) (Obsoleted by RFC8439) (Status: INFORMATIONAL) (DOI: 10.17487/RFC7539).
- Krovetz, Ted. (2006). “Message Authentication on 64-bit architectures”. IACR Cryptology ePrint Archive. pp. 327-341, 2006.
- Kohno, T., Ferguson, N., & Schneier, B. (2010). “Cryptography engineering: Design principles and practical applications”. Indianapolis, IN: Wiley Pub., Inc.
- Bernstein D.J. (2005), “The Poly1305-AES Message-Authentication Code”. In: Gilbert H., Handschuh H. (eds) Fast Software Encryption. FSE 2005. Lecture Notes in Computer Science, vol 3557, pp. 32-49. Springer, Berlin, Heidelberg.
- Ted Krovetz, CSU Sacramento, Wei Dai, “VMAC: Message Authentication Code using Universal Hashing”, Internet Draft, October 2007.
- Niels Ferguson. “Authentication weaknesses in GCM”. Public Comments to NIST, 2005.
- M. Dworkin, “Recommendation for Block Cipher Modes of Operation: The CMAC Mode for Authentication”, May 2005(includes updates as of 10-06-2016: page II), NIST Special Publication 800-38B.
- eRightSoft. “MAC (Message Authentication Code) applied on files and typed-strings”. https://www.erightsoft.com/help/HMACAlgo.htm.
- A. Menezes, P. van Oorschot, S. Vanstone, “Handbook of Applied Cryptography”, CRC Press, Inc., Boca Raton (1996).
- C. Baritel-Ruet, F. Dupressoir, P. Fouque and B. Gregoire, “Formal Security Proof of CMAC and Its Variants”, 2018 IEEE 31st Computer Security Foundations Symposium (CSF), Oxford, 2018, pp. 91-104, doi: 10.1109/CSF.2018.00014.
- Song, JH., Poovendran, R., Lee, J., and T. Iwata, "The AES-CMAC Algorithm", RFC 4493, DOI 10.17487/RFC4493, June 2006,
- Eastlake 3rd, D., Schiller, J., and S. Crocker, "Randomness Requirements for Security", BCP 106, RFC 4086, DOI 10.17487/RFC4086, June 2005,
- A. H. Soualfi, S. Agoujil and Y. Qaraai, “Performance Analysis of OLSR Protocol under MPR Attack in Progressive Size Grid MANET”, 2019 International Conference on Wireless Networks and Mobile Communications (WINCOM), Fez, Morocco, 2019, pp. 1-5, doi: 10.1109/WINCOM47513.2019.8942557.