A HEURISTIC APPROACH TO SECURE MOBILE AD-HOC NETWORK

Main Article Content

Arpita .
Sanjeev Indora

Abstract

An Ad Hoc[1] network is a gathering of wireless mobile nodes framing a transitory network without the aid of any centralized administration or standard support services. The topology of the ad hoc network may change rapidly and unexpectedly. One of the most problems encountered in these networks, is finding the optimization path between source and destination nodes within a specified time with minimum energy consumption. As energy and bandwidth is the main constrains in MANET so there is no requirement to pass the information through all nodes. Only the required nodes take part in communication. In this paper a swarm algorithm to find the optimal route is presented which automatically makes the network secure and more efficient. The proposed work is inspired by the path selection algorithm. The proposed work considers various parameters such as Distance, consumed energy, delay, time etc to solve routing problem. Simulation results are carried out for both algorithms using MATLAB. The results are shows in the graphical as well as in tabular forms.

Downloads

Download data is not yet available.

Article Details

Section
Articles