Identifying Froud Nodes Using Key Sharing Techniques Through Alternative Path and Key Generation for Protected Communication in MANETs
| Author(s) | : | Chandrakant Naikodi |
| Institution | : | Visiting Professor,CiTech, Bangalore, Karnataka, India |
| Published In | : | Vol. 4, Issue 10 — October 2017 |
| Page No. | : | 14-16 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
In this network, after hubs arrangement,every hub will have or figure Trust Value (TV) for everyone of its neighbors in view of its execution,effectiveness, QOS and different parameters. On the offchance that anyone needs to speak with some other hub,at that point source hub must request that its neighborspick conceivable PATH2 and not to choose certain pathor not to choose most expected path i.e. PATH1 which isminimal effort/most limited path, at that point source hubwill send a mystery key or mystery path coursekey(summation/control of all hubs in the path) to thelooking for hub, at that point searcher hub willhold/spare the key for settled measure of time. Thisprocedure occurs for all hubs of a specific path whichwill include in the correspondence. After this procedure,source hub will solicit key shape all hubs from mostbrief/minimal effort path called PATH1 and confirm asimilar key with the one which has sent before to thosehubs. Along these lines, we can kill the malignant hubsas these hubs can't send the key which is asked by someother hubs. Consequently, it guarantees securedcorrespondence among honest to goodness hubs
Chandrakant Naikodi, “Identifying Froud Nodes Using Key Sharing Techniques Through Alternative Path and Key Generation for Protected Communication in MANETs”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 4, Issue 10, pp. 14-16, October 2017.
