A Novel Efficient Network Scheme for Routing Using Dijkstra’s Algorithm

Abstract

In the wireless system the data transmission between the source and goal kept up by the participation among the two hubs. In the custom system which data transmission amongst source and goal accomplished through the halfway hub that can get the data from quick hubs and transmits to next hub. Now and again this issue in the data transmission, for example, delays in routing requires more vitality to transmit the data. This paper examines the issue of finding ideal ways in single-source single goal aggregate multi hop systems. We consider a solitary source that imparts to a solitary goal helped by a few transfers through multiple hops. At each hop, just a single hub transmits, while the various hubs get the transmitted flag, and store it in the wake of handling/disentangling and blending it with the signs got in past hops. That is, we consider that terminals make utilization of cutting edge vitality gathering transmission/gathering systems, for example, maximal proportion consolidating gathering of redundancy codes, or data amassing with rate less codes. Collective systems increment correspondence unwavering quality, lessen vitality utilization, and reduction inertness. We explore the properties that a routing metric must fulfill in these aggregate systems to ensure that ideal ways can be processed with Dijkstra's algorithm. We demonstrate the issue of routing in aggregate multi-hop systems, as the issue of routing in a hyper diagram. We demonstrate that optimality properties in a customary multi-hop organize (monotonicity and is tonicity) are not any more helpful and infer another arrangement of adequate conditions for optimality. We delineate these outcomes by concentrate the base vitality routing issue in static aggregate multi-hop systems for various sending methodologies at transfers. Proposed framework empowers noteworthy execution through the briefest way routing.