Data security in ad-hoc networks using randomization of cryptographic algorithms.

B. Ananda Krishna; S. Radha; K. Chenna Keshava Reddy

No Detail Found!

Data security in ad-hoc networks using randomization of cryptographic algorithms.

Author(s)

B. Ananda Krishna Department of ECE, SSN College of Engineering, SSN Nagar, Kalavakkam, India

S. Radha Department of ECE, SSN College of Engineering, SSN Nagar, Kalavakkam, India

K. Chenna Keshava Reddy Department of ECE, JNTU, Kukatpally, Hyderabad, India

Abstract

Ad hoc networks are a new wireless networking paradigm for mobile hosts. Unlike traditional mobile wireless networks, ad hoc networks do not rely on any fixed infrastructure. Instead, hosts rely on each other to keep the network connected. The military tactical and other security sensitive operations are still the main to their unique properties. One main challenge in design of these networks is how to feasibly detect and defend the major attacks against data, impersonation and unauthorized data modification. Also, in the same network some nodes may be malicious whose objective is to degrade the network performance. In this study, we propose a security model in which the packets are encrypted and decrypted using multiple algorithms where the selection scheme is random. The performance of the proposed model is analyzed ad it is observed that there is no increase in control overhead but a slight delay is introduced due to the encryption process. We conclude that the proposed security model works well for heavily loaded networks with high mobility and can be extended for more cryptographic algorithms.

Publication Details

Page(s) 4007-4012

DOI DOI not available

Published Journal: Journal of Applied Sciences, Volume: 7, Issue: 24, Year: 2007

Request the full text from PASTIC