Mainly opportunistic routing is for multihop wireless networks.  Major issues on opportunistic routing is selection forwarding coordination. .  In this paper we compare selected set of algorithm that has been proposed in literature.  Generally   routing protocols send   traffic along reliable path and have some problem with path.  Upon each transmission the candidate coordinate such that the most priority one receiving the packet will forward the data. So we propose an efficient energy, speed and link stability as selection criteria   which take advantage of the geographic routing and broadcast nature of wireless medium. Forwarding   forms the basic criteria for sending the data in opportunistic routing. In this paper we compare candidate selection algorithm with the proposed algorithm. To avoid packet duplication, the first node that is selected suppresses the selection of further nodes. Since the basic scheme can lead to packet duplication, we describe alternative ways of suppressing those. The proposed method will consume more energy and accommodating more hosts. We finally give common approach for forwarding packets.

Keywords:  Manet, Candidate Selection, opportunistic routing, performance, extremely opportunistic routing, novelty, packet forwarding, least cost opportunistic routing