Hybrid routing algorithms are those algorithms which uses the concept of both proactive routing algorithms and reactive routing algorithms. Proactive routing algorithms are table driven. By the term table driven,we mean that every routing information about the nodes,in the network keeps on updating and is reflected in the table. Thus the modification in the table helps to have the current routes of every node to other nodes. Reactive algorithms are those algorithms in which the nodes keep the information about the active paths of the destination nodes. If any source wants to send a packet to the destination node then this algorithm will try to find out the best possible route and settle the request [6]. In this paper we propose an CFH (collision free and hybrid) routing algorithm that aims to route any data packet with no collision which will reduce the end to end delay and increase the throughput. © 2016,International Journal of Pharmacy and Technology. All rights reserved.