Freedom from deadlock is one of key researches for interconnected processor network. Its significance and impact on the network's performance is appropriately cardinal. Deadlock-free, fault-tolerant, low latency and load-balance are the alluring properties of a routing algorithm for interconnected processor network. The current research on interconnection networks of multiprocessor mainly consider on wormhole switching, virtual channel flow control and routing algorithms. This structural characteristic tries to increase system efficiency by reducing network latency, which enhances network performance. In this paper, we proposed a simple, efficient and deadlock-free routing algorithm for interconnected 2-dimensionl mesh network. In our proposed method deterministic and adaptive both routing algorithm applied simultaneously in any interconnected network. The selection of deterministic routing depends on the dimension of the network. In comparison to prior algorithms, this novel routing approach makes it possible to create networks with low latency and higher performance. Our technique may be applicable to any network topology and routing methods. Simulation is carried out on different size of network and results show low network latency