Abstract: In MANET, to form a multi-hop network, autonomous nodes act as a traffic originators and forwarders. In this, out-of-range nodes are reached by routing process. Due to constraints on battery power and bandwidth consumption, routing is considered to be a challenging task. To avoid complex route discovery and maintenance, stateless location-based routing schemes have been proposed, in which nodes makes routing decision solely on knowledge about its own, neighbour(s) and destinationís location. Such prerequisite in natural routing scheme suffers from local maxima or loop problems. We mitigate these problems by proposing randomized routing algorithms in this paper. It outperforms others in terms of packet delivery ratio and throughput.

Keywords: MANET, PGR, GeRaF, hidden node, topology.