N-HUB Routing with Bandwidth and Energy based QOS and Link Optimization in Wireless Networks

In this paper, we simulate effectiveness of N-hub Shortest-Path Routing in wireless static topology networks. N-hub Shortest-Path Routing allows the ingress node of a routing domain to determine up to N intermediate nodes (hubs) through which a packet will pass before reaching its final destination. This facilitates better utilization of the network resources, while allowing the network routers to continue to employ the simple and well-known shortest-path routing paradigm. The concept is being used in several different ways. We explore the concept of N-hub routing in the context of Wireless Network. By using the technique the system can detect overall number of Incoming and outgoing connections and based on the parameters like delay and energy can determine the optimum number of nodes ideal for current transmission. Further the system is simulated with node failure and congestion errors. It is demonstrated that the proposed system performs better than present shortest path routing