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...

Mobile Ad hoc Networks are highly dynamic networks. Quality of Service (QoS) routing in such networks is usually limited by the network breakage due to either node mobility or energy depletion of the mobile nodes. Also, to fulfill certain quality parameters, presence of multiple node-disjoint paths becomes essential. Such paths aid in the optimal traffic distribution and reliability in case of ...

The bijective connection graph encompasses a family of cube-based topologies, and $n$ -dimensional graphs include the hypercube almost all its variants with order notation="LaTeX">$2^{n}$ degree . Hence, it is important to design implement algorithms that work in grap...

Link-independent and node-independent DAGs satisfy the property that any path from a source to the root on one DAG is link-disjoint (node-disjoint) with any path from the source to the root on the other DAG. To achieve resilient multipath routing, first introduce the concept of independent directed acyclic graphs (IDAGs). For a given a network, we develop polynomialtime algorithms to compute li...

In this paper, we study the routing problem for the undirected binary de Bruijn interconnection network. Researchers have never proposed a shortest path routing algorithm on the undirected binary de Bruijn network. We first propose a shortest path routing algorithm, whose time complexity in the binary de Bruijn network of 2 nodes is O(m2). Then, based on our shortest path routing algorithm, we ...

Torus-Connected Cycles (TCC) have been recently proposed as interconnection network for massively parallel systems. In order to increase system dependability and interprocessor communication performance, disjoint paths routing is critical. In this paper, we focus on the set-to-set disjoint paths routing problem which consists in select mutually node-disjoint paths between two sets of nodes. As ...

In this thesis, we address issues related to reliability and energy-efficiency in wireless ad hoc networks. In the first part of the work, we deal with the problem of simultaneously routing data along multiple disjoint paths from a source to destination in the most energy efficient manner. To this end, we developed and analyzed both optimal and heuristic algorithms that find minimum energy node...

An arborescence in a digraph is a tree directed away from its root. A classical theorem of Edmonds characterizes which digraphs have λ arc-disjoint arborescences rooted at r. A similar theorem of Menger guarantees λ strongly arc disjoint rv-paths for every vertex v, where “strongly” means no two paths contain a pair of symmetric arcs. We prove that if a directed graph D contains two arc-disjoin...