The main constraint when Mobile Ad-hoc Networks is taken into account is that the energy consumption. Since the sensor nodes are deployed during a rough terrain with unpredictable environmental conditions the nodes fail mainly thanks to battery drain, and in most cases, it's impossible to exchange the batteries. So, it'll be known to use an appropriate routing algorithm for locating the simplest available path that consumes lesser energy and reduces the delay. One such sort of routing protocol is Opportunistic Routing. During this sort of routing each packet, each hop and therefore the next relay node is found dynamically by selecting the node that captures the packet transmission. The comparison for the typical energy consumption of nodes shows improvement in BFS compared to AOMDV, Dynamic Channel Allocation. The BFS achieved a true improvement as compared to AOMDV, Dynamic Channel Allocation for the consumed energy which was one among the objectives of this work.