Designing Mobility using Distance Routing Effect Algorithm

An ad-hoc network signifies a solution designed for a specific problem or task and it is an independent network that provides usually temporary peer-to-peer connectivity without relying on a complete network infrastructure. It allows users to communicate while forming a temporary network, without any form of federal administration. Each node participating in the network performs the host and router function, and willing to forward packets for other nodes. For this a routing protocol is needed. An approach utilizes the individuality of such a network a DISTANCE ROUTING EFFECT ALGORITHM FOR MOBILITY. The protocol uses the distance effect and the mobility rate as a means to assure routing accuracy. When data needs to be exchanged between nodes, the directional algorithm sends messages in the recorded direction of the destination node, guaranteeing the delivery by following the direction. The improved algorithm suggested within this paper includes an additional parameter, direction of travel, as a means of determining the location of a destination node. When data needs to be exchanged between two nodes, the directional algorithm sends messages in the recorded direction of the destination node, guaranteeing the delivery. The result is an enhancement to the delivery ratio, sent to the received packet. This allows the reduction in the number of control packets that need to be distributed.