A Novel Secure Communication Protocol for Ad Hoc networks [SCP]

Abstract

An ad hoc network is a self organized entity with a number of mobile nodes without any
centralized access point and also there is a topology control problem which leads to high power
consumption and no security, while routing the packets between mobile hosts. Authentication is
one of the important security requirements of a communication network. The common
authentication schemes are not applicable in Ad hoc networks.

In this paper, we propose a secure communication protocol for communication between

two nodes in ad hoc networks. This is achieved by using clustering techniques. We present a
novel secure communication framework for ad hoc networks (SCP); which describes
authentication and confidentiality when packets are distributed between hosts with in the cluster
and between the clusters. These cluster head nodes execute administrative functions and network
key used for certification. The cluster head nodes (CHs) perform the major operations to achieve
our SCP framework with help of Kerberos authentication application and symmetric key
cryptography technique, which will be secure, reliable, transparent and scalable and will have
less overhead.

Purpose of the System:

Kerberos provides a centralized authentication server whose function is to
authenticate user to server and server to user. Kerberos relies exclusively on symmetric
encryption. In ad hoc network central entity is easy to attack. In our architecture we using
clustering technique, where each cluster has is own cluster head (CH) nodes. These CH act as a
Kerberos server for a set of nodes. Due to periodic change of CH in a cluster we can prevent the
networks from attack. By using Kerberos authentication application we can achieve Secure,
Reliable, Transparent, Scalable, and less overhead [12].
Existing System:
 The drawback of this approach is that it tends to overwhelm the nodes on the minimum
energy path, which is undesirable for sensor networks since all sensor nodes are
collaborating for a common mission and the duties of failed nodes may not be taken by
other nodes.
 A few schemes have been proposed to address this problem by studying the maximum
lifetime routing problem. The problem focuses on computing the flow and transmission
power to maximize the lifetime of the network, which is the time at which the first node
in the network runs out of energy. Some distributed solutions based on subgradient
algorithms and utility-based algorithm have been proposed. The common assumption of
these works is that the data flows are conserved during the transmission from the sensor
nodes to the sink node, which however is not true for sensor networks because data
collected by neighboring nodes are often spatially correlated. Therefore, redundant
information can be removed through data aggregation at the intermediate nodes.

Proposed System:
 The algorithm requires maintaining two trees—the coding tree for raw data aggregation and
the shortest path tree (SPT) for delivering the compressed data to the sink node. These works
demonstrate that data aggregation can greatly improve the performance of various
communication protocols.
 By jointly optimizing routing and data aggregation, the network lifetime can be extended
from two dimensions. One is to reduce the traffic across the network by data aggregation,
which can reduce the power consumption of the nodes close to the sink node. The other is to
balance the traffic to avoid overwhelming the bottleneck nodes. In this paper, we present a
model to integrate routing and data aggregation. We adopt the geometric routing whereby the
routing is determined solely according to the nodal position. This allows different data
correlation models such as that in to be incorporated without intervening the underlying
routing scheme.
Software Requirements :

 Operating System : Windows XP/2003 or Linux

 User Interface : AWT and Swings
 Programming Language : Java
 Web Applications : JDBC, Servlets, JSP
 IDE/Workbench : My Eclipse 6.0

Hardware Requirements:

 Processor : Pentium IV
 Hard Disk : 40GB
 RAM : 512MB or more