Identifying Froud Nodes Using Key Sharing Techniques Through Alternative Path and Key Generation for Protected Communication in MANETs

Abstract

In this network, after hubs arrangement,
every hub will have or figure Trust Value (TV) for every
one of its neighbors in view of its execution,
effectiveness, QOS and different parameters. On the off
chance that anyone needs to speak with some other hub,
at that point source hub must request that its neighbors
pick conceivable PATH2 and not to choose certain path
or not to choose most expected path i.e. PATH1 which is
minimal effort/most limited path, at that point source hub
will send a mystery key or mystery path course
key(summation/control of all hubs in the path) to the
looking for hub, at that point searcher hub will
hold/spare the key for settled measure of time. This
procedure occurs for all hubs of a specific path which
will include in the correspondence. After this procedure,
source hub will solicit key shape all hubs from most
brief/minimal effort path called PATH1 and confirm a
similar key with the one which has sent before to those
hubs. Along these lines, we can kill the malignant hubs
as these hubs can't send the key which is asked by some
other hubs. Consequently, it guarantees secured
correspondence among honest to goodness hubs