A Distributed Algorithm for Self-Controled Mobile Ad-Hoc Network

In this paper an algorithm is proposed for distributed self-controlled movement of mobile nodes in a wireless ad-hoc network to maintain the topology of a Mobile Ad-Hoc Networks (MANET). Each node in the network gets the present status of other nodes and its connectivity with them through message communication. Examining the situation the nodes take necessary action to maintain the neighborhood topology. The necessary actions are stop, rush and continue with their preferred velocity. This concept is simulated in a few example networks. These simulation results show that the nodes remain in the neighborhood of each other throughout the movement, for each network.