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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Agrawal, P., Zeng, Q.-A.: Introduction to Wireless and Mobile Systems. Brooks/Cole, Thomson, Pacific Grove, CA (2002)
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)
Perkins, C., Royer, E., Das, S.: Ad Hoc on Demand Distance Vector (AODV) Routing. Internet experimental RFC 3561 (2003)
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)
Jiang, M., Li, J., Tay, Y.C.: Cluster Based Routing Protocol (CBRP) Functional Specification (1998)
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
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)
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)
Chiang, C.C., et al.: Routing in clustered multihop, mobile wireless networks with fading channel. In: Proceedings of the IEEE SICON’97 (1997)
Hasan, A., Sharma, N.: New method towards encryption schemes. In: International Conference on Reliability, Optimization and Information Technology (2014)
Vollala, S., Varadhan, V.V.: Efficient modular multiplication algorithms for public key cryptography. In: 2014 IEEE International Advance Computing Conference (IACC)
Desmedt, Y.: ElGamal public key encryption. In: Encyclopedia of Cryptography and Security, p. 183. Springer, US (2005)
Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120126 (1978)
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)
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)
Polkowski, L., Kacprzyk, J., Skowron, A.: Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems. Physica-Verlag, Heidelberg (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
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)