HASHING ROUTING

Abstract

A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. Mostly work has been concentrated on routing aspect. Most of the protocols in this category are not incorporating proper security features. Security is one of the most important concepts in ad hoc networks. It has been observed that different protocols need different strategies for security. The study here proposes a theory in this paper based on Hashing as a tool. This scheme can make most of the on demand protocols secure. The study should help in making protocols more robust against attacks and standardize parameters for security in routing protocols.