We propose a novel heuristic algorithm that performs geographical routing based on a greedy approach. Our proposed scheme first allocates the geographic locations of the source and the destination ...nodes influenced by their GPS information. A virtual Euclidean path is considered as a reference line to choose appropriate node for routing. Then, a multi-hop technique is adopted to establish routing path between them. The nodes in the routing paths are chosen in a greedy manner, having minimum distance from the Euclidean line and having minimum overlap in coverage area with its immediate predecessor node. The elegance in our proposed method is that it is capable of routing data successfully from the source to the destination, with nominal number of hops, and hence improves power handling capability of the network. Performance analysis of our algorithm is done in terms of routing overhead, and average end-to-end delay measure.
