Efficient enhanced routing algorithm to find Optimal path in multi-hop network

ABSTRACT: We consider a single source that imparts to a single goal helped by a few transfers through various hops. At each hop, just a single node transmits, while the various nodes get the transmitted flag, and store it subsequent to processing/decoding and blending it with the signs got in past hops. That is, we think about that terminals utilize propelled energy gathering transmission/gathering procedures, for example, maximal proportion joining gathering of redundancy codes, or data collection with rateless codes. Aggregate strategies increment correspondence dependability, diminish energy utilization, and abatement inertness. We examine the properties that a directing measurement must fulfill in these collective networks to ensure that ideal ways can be processed with Dijkstra's algorithm. We display the issue of directing in collective multi-hop networks, as the issue of steering in a hypergraph. We demonstrate that optimality properties in a conventional multi-hop organize (monotonicity and isotonicity) are never again valuable and determine another arrangement of adequate conditions for optimality