Refine your search
Collections
Co-Authors
Year
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z All
Joshi, J.
- An Entropy Encoding Method for Routing Metadata in Ad HOC Network
Abstract Views :249 |
PDF Views:3
Authors
J. Joshi
1,
K. Kuppusamy
2
Affiliations
1 Department of Computer Applications, Alagappa University, Karaikudi, Tamil, Nadu, IN
2 Department of Computer Science, Alagappa University, Karaikudi, Tamil, Nadu, IN
1 Department of Computer Applications, Alagappa University, Karaikudi, Tamil, Nadu, IN
2 Department of Computer Science, Alagappa University, Karaikudi, Tamil, Nadu, IN
Source
International Journal of Knowledge Based Computer System, Vol 5, No 1 (2017), Pagination: 5-7Abstract
Secret common transmission among two or multiple nodes in a network resides at the ischolar_main of common communication security. In the existing system DSR (Dynamic Source Routing) algorithm is used when a user (sender) decides to send a packet to a destination node (receiver) in the Ad hoc network. Key wrapped technique is used to encode the ip address, path and data because the third party hacker cannot hack the information from the node and also maximum entropy is occurred. The aim of this research work is to reduce the entropy process in data transmission by identifying active nodes through which file/data are to be transmitted. The proposed method uses the selective reference algorithm to identify active nodes and the key wrapped technique to encode the ip address of the selected nodes and find it path/route to transfer the file/data. This proposed work reduces the entropy process and router path is more secure and provide high performance of ad hoc network during transmission.Keywords
Encoding, Entropy, Metadata, Routing.
References
- W. Diffie, and M. E. Hellman, “New directions in cryptography,” IEEE Trans. Inf. Theory, vol. 22, no. 6, pp. 644-654, Nov. 1976.
- S. K. Park, and K. W. Miller, “True random number generators for cryptography,” in Cryptographic Engineering. New York, NY, USA: Springer, pp. 55-73, 2009.
- Y. Shah, W. Trappe, and N. Mandayam “Information-theoretically secret key generation for fading wireless channels,” IEEE Trans. Inf. Forensics Security, vol. 5, no. 2, pp. 240-254, Jun. 2010.
- M. Bloch, J. Barros, M. R. D. Rodrigues, and S. W. McLaughlin, “Wireless information-theoretic security,” IEEE Trans. Inf. Theory, vol. 54, no. 6, pp. 2515-2534, Jun. 2008.
- Y. Zhang, A. Juels, and M. K. Reiter, “Cross-VM side channels and their use to extract private keys,” IEEE Trans. Inf. Theory, vol. 39, no. 3, pp. 733-742, May 1993.
- https://fcit.usf.edu/network/chap1/chap1.htm
- https://en.wikipedia.org/wiki/ Network_security
- https://www.techopedia.com/definition/5868/ad-hoc-network
- https://en.wikipedia.org/wiki/Metadata
- https://en.wikipedia.org/wiki/ Router_(computing)