A relay node selection technique for opportunistic routing in mobile Ad Hoc networks

Abstract

In this paper, we propose a new relay node selection algorithm: relay node selection Considering Future Path(CFP) for opportunistic routings in mobile Ad Hoc networks, aiming to provide enhanced performance of successful delivery ratio. CFP based on the shortest distance algorithm and it not only considers the current distance towards the destination but also considers the future hops and estimates whether through the current node can a packet arrive at the destination. CFP can enhance the performance of successful delivery ratio by solving the potential problem of no forwarding relays in the shortest distance algorithm. Simulation results show that contrast against the shortest distance algorithm in opportunistic routing protocol GeRaF, CFP has better performance on both delivery ratio and goodput.