An Efficient and Secure Data Transmission of Common Randomness Routing in Adhoc Wireless Network

	International Journal of P2P Network Trends and Technology (IJPTT)
	© 2019 by IJPTT Journal
	Volume-9 Issue-1
	Year of Publication : 2019
	Authors : Duvvada Shreya Sri, R.V.L.S.N Sastry

Citation

MLA Style: Duvvada Shreya Sri, R.V.L.S.N Sastry "An Efficient and Secure Data Transmission of Common Randomness Routing in Adhoc Wireless Network" International Journal of P2P Network Trends and Technology 9.1 (2019): 1-4.

APA Style:Duvvada Shreya Sri, R.V.L.S.N Sastry, (2019). An Efficient and Secure Data Transmission of Common Randomness Routing in Adhoc Wireless Network. International Journal of P2P Network Trends and Technology, 9(1), 1-4.

Abstract

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.

References

[1] V.Joseph and G. de Veciana, “Nova: Qoe-driven optimization of dash based video delivery in networks,” arXiv preprint arXiv:1307.7210, 2013.
[2] Priyanka Goyal, Vinti Parmar and Rahul Rishi, “MANET: Vulnerabilities, Challenges, Attacks, Application”, IJCEM International Journal of Computational Engineering & Management, Vol. 11, January 2011.
[3] W.Diffie and M. E. Hellman, “New directions in cryptography,” Information Theory, IEEE Transaction on vol. 22, no.6, pp.644-654,1976.
[4] Khisti, A and G. Wornell, 2012. “Secret-key generation using correlated sources and channels,” Information Theory, IEEE Transactions on, 58(2): 652-670.
[5] Mukesh Singhal, 2012. “Key Management Protocols for Wireless Networks“international journal.
[6] Park, S.K and K.W. Miller, 2009. “Random number generators: good ones are hard to find,” Communications of the ACM, 31(10): 1192-1201.
[7] Renner and S. Wolf, 2005. “Simple and Tight Bounds for Information Reconciliation and Privacy Amplification”,pp: 199-216.
[8] Shuangqing Wei† S and Jing Deng, 2015. “KERMAN: A key establishment algorithm based on harvesting randomness in Manets” 14,April
[9] Ren, K and Q. Wang, 2011. “Characteristics in wireless communications,” Wireless Communications, IEEE, 18(4): 6-12.
[10] Sunar, B., 2009. “True random number generators for cryptography,” in Cryptographic Engineering. Springer, pp: 55-73.
[11] Ye, C and P. Narayan, 2012. “Secret key and private key constructions for simple multi terminal source models,” Information Theory, IEEE Transactions on, 58(2): 639-651.
[12] Wang, Q., H. Su and K. Kim, 2011. “Fast and scalable secret key generation exploiting channel phase randomness in wireless networks,” in infocom, Proceedings IEEE, pp: 1422-1430.
[13] Ueli M. Maurer, 2011. “Secret key Agreement By Public discussion from common Information” IEEE Transaction, March.

Keywords
Security, Secret Key Establishment, Common Randomness, Dynamic Source Routing.