A Privacy Preserving and Efficient Randomness Routing in Adhoc Wireless Network

• Published in: Turkish journal of computer and mathematics education Vol. 12; no. 3; pp. 5583 - 5588
• Main Authors: Jyothi, G Asha, Polisetty, Sri Ram Chandra, Suryakala, K
• Format: Journal Article
• Language: English
• Published: Gurgaon Ninety Nine Publication 10.04.2021
• Subjects: Ad hoc networks; Algorithms; Data transmission; Efficiency; Encryption; Format; Mathematics; Nodes; Privacy; Protocol (computers); Routing (telecommunications); Wireless networks
• ISSN: 1309-4653; 1309-4653
• DOI: 10.17762/turcomat.v12i3.2224

Now a day’s automatic key establishment of any two devices in the network is placed an important role and generation of key is used for public key based algorithm. By using public key based algorithm we can automatically generated secret key any two devices in the network. So that by performing this process we can randomly generate secret key. In the ad hoc networks another concepts is routing from source node to destination node. The generation of routing process can be done by randomly and performing this process we can improve the efficiency in the routing. In this paper we are implementing random routing of secure data transmission protocol for generating routing and provide privacy of transferred message. By implementing this protocol we can provide random routing process for transferring message. Before transferring message the server will randomly generate routing for source node to destination node. After that the source node will send data to destination node. Before transferring message or data the source node will encrypt and send the cipher format data to destination node. The destination node will retrieve cipher format data and perform the decryption process. After completion of decryption process the destination node will get original message. By implementing those concepts we can improve the efficiency for generating routing and also provide security of transferring message.