Developing an ideal routing protocol that satisfies various wireless sensor network applications is difficult due to their different requirements. In this paper, we propose a parametric routing protocol that considers performance parameters such as time, reliability, and energy to satisfy various circumstances of wireless sensor network applications. Based on a geographic algorithm, the propose...

In this paper, we present several enhanced network techniques which are appropriate for VLSI implementation and have reduced complexity, high throughput and simple routing algorithm even if basic network problems such as deadlock and livelock are considered. We develop a new packet definition to support different requirements in an MIMD message passing architecture and also verify its efficienc...

To meet the growing computation-intensive applications and the needs of low-power, highperformance systems, and the number of computing resources in single-chip has enormously increased, because current VLSI technology can support such an extensive integration of transistors. This paper presents adaptive routing selection strategies suitable for network-on-chip (NoC). The main prototype present...

We make use of the existence of cell-disjoint paths in the 3D grid topology to design a new highly reliable adaptive geographic routing protocol called Grid-based Adaptive Routing Protocol (GARP) for Underwater Wireless Sensor Networks. In GARP, the underwater environment is viewed as a virtual 3D grid of cells. A packet is forwarded following a pre-constructed routing path from a node in a gri...

Networks of workstations are emerging as a costeffective alternative to parallel computers. The interconnection between workstations usually relies on switchbased networks with irregular topologies. This irregularity makes routing and deadlock avoidance quite complicated. Current proposals avoid deadlock by removing cyclic dependencies between channels and therefore, many messages are routed al...

In this paper, we propose a design methodology for faulttolerant adaptive routers for parallel and distributed computers. The key idea of our method is integrating minimal and non-minimal routing that is supported by independent virtual channels (VCs). Distinguishing the routing functions for each set of VCs simplifies the design of fault-tolerant algorithms. After describing the method, we sho...

Efficient and deadlock-free routing is critical to the performance of networks-on-chip. In this paper we present an approach that can be coupled to any adaptive routing algorithm to improve the performance with a minimal overhead on area and energy consumption. The proposed approach introduces the concept of Neighbors-on-Path to exploit the situations of indecision occurring when the routing fu...

In this paper, we propose GeoRank, a geographic routing approach for the IPv6-enabled large-scale low-power and lossy networks. We discuss the main drawbacks of the RPL (IPv6 Routing Protocol for Low-Power and Lossy Networks) for P2P (point-to-point) communication in large-scale 6LoWPAN networks. Then, we address such drawbacks by proposing a routing protocol, named GeoRank, which integrates RP...

Fire hazard monitoring and evacuation for building environments is a novel application area for the deployment of wireless sensor networks. In this context, adaptive routing is essential in order to ensure safe and timely data delivery in building evacuation and fire fighting resource applications. Existing routing mechanisms for wireless sensor networks are not well suited for building fires, ...

This paper introduces a graph-partitioning generic methodology for developing deadlock-free wormhole routing in an arbitrary network. Further extension allows partial cyclic dependencies among virtual channels. A novel fully adaptive nonminimal deadlock-free routing algorithm has been developed for k-ary n-cube torus network. Since our technique is based on decomposing a network into several su...