Skip to main content

Secure Mobile Ad Hoc Routing Using Confrontations (SMARUC) and Nodes Communication with CCM (Character Classification Model) - OKE (Optimal Key Exchange) - SSL (Secure Socket Layer) Model

  • Conference paper
  • First Online:
Computational Science and Its Applications – ICCSA 2023 Workshops (ICCSA 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14105))

Included in the following conference series:

  • 621 Accesses

Abstract

Manet (Mobile Adhoc network) is a dynamic network with no fixed infrastructure. So Data Routing among nodes in a wireless network is pretty complex when compared to traditional centralized network architecture. There is always possibility the nodes vulnerable to all kinds of attacks. Even though cryptography models, key exchange models are there for data exchange but all are struggled with security and all are bound by global time complexities even in message communication among nodes. So we addressed this problem by generating trusted dynamic topology with secure data communication using “SMARUC with CCMOKE” Model. This method which generates exchanges key in minimum time complexity even compared to Diffie-Hellman model. For Crypto, data transmission between nodes done with simple RSC-OKE-SSL crypto model which performs communication in minimum time complexity compared to other cryptography models. By this method of forming dynamic network blocks the doorway of malicious nodes and generates the secured dynamic topology.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Agrawal, P., Zeng, Q.-A.: Introduction to Wireless and Mobile Systems. Brooks/Cole, Thomson, Pacific Grove, CA (2002)

    Google Scholar 

  2. Dhurandher, S.K., Obaidat, M.S.: FACES: friend – based ad hoc routing using challenges to establish security in MANETs systems. IEEE Syst. J. 5(2), 176–188 (2011)

    Google Scholar 

  3. Perkins, C., Royer, E., Das, S.: Ad Hoc on Demand Distance Vector (AODV) Routing. Internet experimental RFC 3561 (2003)

    Google Scholar 

  4. Johnson, D.B., Maltz, D.: Dynamic source routing in ad hoc wireless networks. In: Imielinski, T., Korth, H. (eds.) Book Chapter in Mobile Computing, pp. 131–181. Kluwer, Dordrecht, The Netherlands (1996)

    Google Scholar 

  5. Jiang, M., Li, J., Tay, Y.C.: Cluster Based Routing Protocol (CBRP) Functional Specification (1998)

    Google Scholar 

  6. Sanzgiri, K., Levine, B.N., Shields, C., Dahill, B., Belding-Royer, E.M.: A secure routing protocol for ad hoc networks. In: Proceedings of the 10th IEEE International Conference on Network Protocols (ICNP), Paris, France, pp. 78–89, 12–15 November 2002

    Google Scholar 

  7. Hu, Y., Perrig, A., Johnson, D.B.: Ariadne: a secure on-demand routing protocol for ad hoc networks. Wirel. Netw. 11(1–2), 21–38 (2005)

    Article  Google Scholar 

  8. Marti, S., Giuli, T.J., Lai, K., Baker, M.: Mitigating routing misbehavior in mobile ad hoc networks. In: Proceedings of the MobiCom 2000, Boston, MA, pp. 255–265 (2000)

    Google Scholar 

  9. Chiang, C.C., et al.: Routing in clustered multihop, mobile wireless networks with fading channel. In: Proceedings of the IEEE SICON’97 (1997)

    Google Scholar 

  10. Hasan, A., Sharma, N.: New method towards encryption schemes. In: International Conference on Reliability, Optimization and Information Technology (2014)

    Google Scholar 

  11. Vollala, S., Varadhan, V.V.: Efficient modular multiplication algorithms for public key cryptography. In: 2014 IEEE International Advance Computing Conference (IACC)

    Google Scholar 

  12. Desmedt, Y.: ElGamal public key encryption. In: Encyclopedia of Cryptography and Security, p. 183. Springer, US (2005)

    Google Scholar 

  13. Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120126 (1978)

    Google Scholar 

  14. Agnew, G.B., Mullin, R.C., Vanstone, S.A.: Fast Exponentiation in GF (2n). In: Advances in Cryptology—EUROCRYPT 1988, pp.225–231. Springer Berlin Heidelberg (1988)

    Google Scholar 

  15. Syeda, M., Zbang, Y.Q., Pan, Y.: Parallel granular neural networks for fast credit card fraud detection. In: Proceedings of the IEEE International Conference on Fuzzy Systems 2002, vol.1, pp.572–577 (2002)

    Google Scholar 

  16. Polkowski, L., Kacprzyk, J., Skowron, A.: Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems. Physica-Verlag, Heidelberg (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to R. M. Krishna Sureddi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Sureddi, R.M.K., Ravva, S.K., Kolikipogu, R. (2023). Secure Mobile Ad Hoc Routing Using Confrontations (SMARUC) and Nodes Communication with CCM (Character Classification Model) - OKE (Optimal Key Exchange) - SSL (Secure Socket Layer) Model. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2023 Workshops. ICCSA 2023. Lecture Notes in Computer Science, vol 14105. Springer, Cham. https://doi.org/10.1007/978-3-031-37108-0_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-37108-0_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-37107-3

  • Online ISBN: 978-3-031-37108-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics