A Parallel Routing Algorithm for Torus NoCs

Abstract. This paper proposes a parallel routing algorithm for routing multiple data streams over disjoint paths in the torus Network-on-Chip (NoC) architecture. We show how to construct a maximal set of disjoint paths between any two nodes of a torus network topology and then make use of the constructed paths for the simultaneous routing of multiple data streams between these nodes. Analytical performance evaluation results are obtained showing the effectiveness of the proposed parallel routing algorithm in reducing communication delays and increasing throughput when transferring large amounts of data in an NoC-based multi-core system

Cell-Based Broadcasting Algorithms in Mobile Ad-Hoc Networks

This paper proposes new cell-based broadcasting algorithms (CBB) for mobile ad-hoc networks (MANETs). It shows how communication methods originally designed for wired multiprocessor interconnection networks can be used in MANETs. CBB algorithms are based on a logical 2-dimensional grid view of the geographical region of the MANET. They make use of existing spanning trees in the 2- dimensional grid interconnection networks to support broadcasting in MANETs. In this study we developed a simulation model to measure the delivery ratio and the number of rebroadcast messages and compare the results with the well known probabilistic broadcasting algorithm

Cell-Based Broadcasting Algorithms in Mobile Ad-Hoc Networks

<p>This paper proposes new cell-based broadcasting algorithms (CBB) for mobile ad-hoc networks (MANETs). It shows how communication methods originally designed for wired multiprocessor interconnection networks can be used in MANETs. CBB algorithms are based on a logical 2-dimensional grid view of the geographical region of the MANET. They make use of existing spanning trees in the 2- dimensional grid interconnection networks to support broadcasting in MANETs. In this study we developed a simulation model to measure the delivery ratio and the number of rebroadcast messages and compare the results with the well known probabilistic broadcasting algorithm.</p

An Overview Survey of Recent Routing Protocols for Underwater Wireless Sensor Networks

With the recent advances in underwater sensor devices and technologies, underwater wireless sensor networks (UWSNs) enable a variety of applications such as underwater exploration and monitoring, disaster prevention, and military surveillance and reconnaissance. However, these kinds of networks faces a number of challenges induced by the nature of the underwater environment and its influence on the physical media. Therefore, new routing protocols are proposed specifically for such networks to mitigate these challenges. This paper surveys some of the recent routing protocols for UWSNs. Specifically, the idea of each protocol is presented as well as its advantages and disadvantages. Furthermore, the presented protocols are classified into different categories. The paper is concluded with some open research issues

A Paradigm for Allocating Parallel Application Tasks to Heterogeneous Computing Resources on the Grid

Permission to make digital or hard copies of portions of this work for personal or classroom use is granted provided that the copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. T