Level Based Routing Using Dynamic Programming for 2D Mesh

Abstract

The performance of the interconnection network doesn't only depend on the topology, but it also depends on the Routing algorithm used. The simplest Routing algorithm for the mesh topology in networks on chip is the XY Routing algorithm. The level based Routing algorithm has been proved to be more efficient than the XY Routing algorithm. In this paper, level based Routing algorithm using the dynamic programming has been proposed. The proposed Routing algorithm proves to be more efficient in the terms of the computation. The proposed Routing algorithm has achieved up to two times bigger speed.

An Energy-Efficient Clustering Algorithm Combined Game Theory and Dual-Cluster-Head Mechanism for WSNs

“…Therefore the energy efficiency can be markedly improved if the communication overhead is cut down largely. Since the data communication and the traffic flow depend on the routing protocol [9], the energy consumption can be reduced if the routing protocol takes the energy efficiency into consideration. On the other hand, the traffic flow pattern of WSNs is different from that of traditional wireless networks owing to the distinct logical topology.…”