Study of Mobility in Routing Protocols:

This paper addresses mobility control routing in wireless networks. The data flow request between a source-destination pair, the problem is to move node to node towards the best placement, the performance of the wireless network is improved. Our purpose is to find the best nodes selection depending on the minimization of the maximum distance that nodes have to travel to reach their final position. We propose mobility in routing protocol, the Routing Protocol based on Controlled Mobility, where the chosen nodes’ path minimizes the total travelled distance to reach destination. Specifically, controlled mobility is intended as a new design dimension wireless network allowing driving nodes to specific best position in order to achieve some common objectives. The main aim of this paper is to show the effectiveness of mobility when it is used as a new design dimension in wireless networks. Extensive simulations are conducted to evaluate the proposed routing algorithm. It show how our protocol Outperforms a well-known routing protocol, the Ad hoc On Demand Distance Vector routing (AODV), in terms of throughput, average end-to-end data packet delay and energy spent to send a packet unit.