ABSTRACT

This paper introduces data forwarding algorithm for a particular applications within Mobile Adhoc networks that is based on the concept of selecting the neighbor node from a set of designated nodes. The algorithm, which is called Shortest Distance Message Broadcasting (SDMF), uses routing information to select the node with the shortest distance. The goal of the proposed algorithm is to reduce the average number of hops taken to reach the destination node that holds the desired data. Experimental evaluations using the Scalable Wireless Adhoc Network (SWAN) Simulator and AODV algorithm were performed to derive the confidence interval for the mean hop count between the source node and destination node. The results agreed with the numerical analysis of the proposed algorithm offers reduce the hop count and lesser delay when compared to the remaining algorithms..