The back-pressure-based routing algorithms usually routes the packet through probably different paths have been widely studied in the literature. Nevertheless, these algorithm exhibits poor delay performance due to routing loops and high implementation complexity due to over burden of management of queues for every destination. Here is a new adaptive routing algorithm, where the routing and scheduling components are decoupled. The probabilistic routing algorithm is used to update the routing table. Further the network coding is as well used to increase the throughput performance of the algorithm.