Cyclic Redundancy Check Based Data Authentication in Opportunistic Networks

  • Megha Gupta
Conference paper
Part of the Lecture Notes on Data Engineering and Communications Technologies book series (LNDECT, volume 27)


Opportunistic Networks (OppNets) work with dynamic topology, neither having focused management nor any protection system. Security is a challenging and open research issue in OppNets. A source node always has the concerns about its data. The success of any network depends on percentage of guaranteed and authenticated delivery that it can provide from source node to destination node. OppNets nodes like handheld devices, vehicular nodes, sensors, RFID, etc., have limited calculation resources and small buffering capacity. Hence the aim of the proposed technique is to logically use the energy and storage of the OppNet nodes. In this paper, we present a novel message authentication technique for opportunistic networks. The proposed technique is based on cyclic redundancy check (CRC) encryption with timestamps. The idea is simple but powerful with high accuracy results and efficiently utilizing the resources of the network nodes. The analysis of the proposed protocol shows that it can resist malicious attacks, which may alter or modify the data packets during the transmission.


  1. 1.
    Y. Wu, Y. Zhao, M. Riguidel, G. Wang, P. Yi, Security and trust management in opportunistic networks: a survey. J. Secur. Commun. Netw. 8(9), 1812–1827 (2015)CrossRefGoogle Scholar
  2. 2.
    A. Ahmad, R. Doss, M. Alajeely, K. Ahmad, Securing OppNets from packet integrity attacks using trust and reputation, in 2017 31st International Conference on Advanced Information Networking and Applications Workshops (WAINA) (IEEE, Piscataway, 2017), pp. 7–12Google Scholar
  3. 3.
    A. Shikfa, Security challenges in opportunistic communication, in IEEE GCC Conference and Exhibition (GCC) (IEEE, Piscataway, 2011), pp. 425–428Google Scholar
  4. 4.
    J. Wang, Z.A. Kissel, Introduction to Network Security: Theory and Practice (Wiley, Singapore, 2016)Google Scholar
  5. 5.
    P. Kumar, N. Chauhan, N. Chand, Security framework for opportunistic networks, in Progress in Intelligent Computing Techniques: Theory, Practice, and Applications. Advances in Intelligent Systems and Computing, vol. 719 (Springer, Singapore, 2018), pp. 465–471.Google Scholar
  6. 6.
    A. Shikfa, M. Onen, R. Molva, Privacy in content-based opportunistic networks, in IEEE International Conference on Advanced Information Networking and Applications Workshops (IEEE, Piscataway, 2009), pp. 832–837Google Scholar
  7. 7.
    A. Shikfa, M. Onen, R. Molva, Privacy in context-based and epidemic forwarding, in IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (IEEE, Piscataway, 2009), pp. 1–7Google Scholar
  8. 8.
    Y. Ma, A. Jamalipour, Opportunistic node authentication in intermittently connected mobile ad hoc networks, in IEEE 16th Asia-Pacific Conference on Communications (APCC) (IEEE, Piscataway, 2010), pp. 453–457Google Scholar
  9. 9.
    U.P. Singh, N. Chauhan, Authentication using trust framework in opportunistic networks, in 2017 8th International Conference on Computing, Communication and Networking Technologies (ICCCNT) (IEEE, Piscataway, 2017), pp. 1–7Google Scholar
  10. 10.
    A. Keranen, J. Ott, T. Karkkainen, The ONE simulator for DTN protocol evaluation, in Proceedings of the 2nd International Conference on Simulation Tools and Techniques (ICST, Brussels, 2009)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Megha Gupta
    • 1
  1. 1.Miranda HouseUniversity of DelhiNew DelhiIndia

Personalised recommendations