This paper presents network coding based reliable disjoint and braided multipath routing (NC-RMR ) for sensor networks, which forms multipath by hop-by-hop method and only maintains local path information of each node without establishing end-to-end paths. Neighbors of each local node are divided into groups according to their hops to sink nodes to improve the network load balancing. For furthe...

Spanning trees are widely used in interconnection networks for routing, broadcasting, fault-tolerance, and securely delivering messages, as well parallel distributed computing. The problem of efficiently finding a maximal set independent spanning (ISTs) is still open arbitrary (general) topologies (graphs). first contribution this paper presenting two efficient methods that solve the Eisenstein...

In this paper, we give an algorithm for the node-to-set disjoint paths problem in a transposition graph. The algorithm is of polynomial order of n for an n-transposition graph. It is based on recursion and divided into two cases according to the distribution of destination nodes. The maximum length of each path and the time complexity of the algorithm are estimated theoretically to be O(n7) and...

The problem of computing a minimum cost subgraph D′ = (V,A′) of a directed graph D = (V,A) so that D′ contains k edge-disjoint paths from a specified root r ∈ V to every other node in V is known to be nicely solvable since it can be formulated as a matroid intersection problem. A corresponding problem when openly disjoint paths are requested rather than edge-disjoint was solved in [12] with the...

A joint power control and maximally disjoint routing algorithm is proposed for multihop CDMA wireless ad hoc networks. A framework of power control with QoS constraints in CDMA wireless ad hoc networks is introduced and the feasibility condition of the power control problem is identified. Both centralized solution and distributed implementations are derived to calculate the transmission power g...

In activation network problems we are given a directed or undirected graph G = (V,E) with a family {fuv : (u, v) ∈ E} of monotone non-decreasing activation functions from D to {0, 1}, where D is a constant-size subset of the non-negative real numbers, and the goal is to find activation values xv for all v ∈ V of minimum total cost ∑ v∈V xv such that the activated set of edges satisfies some con...

Abstract. Disjoint multipath routing (DMPR) is an effective strategy to achieve robustness in networks, where data is forwarded along multiple linkor nodedisjoint paths. DMPR poses significant challenges in terms of obtaining loopfree multiple (disjoint) paths and effectively forwarding the data over the multiple paths, the latter being particularly significant in datagram networks. One approac...

In a WDM network, a single component failure may lead to multiple failures in the logical topology. Protection switching schemes that adopt traditional edge-disjoint or node-disjoint path-selection algorithms may not be able to protect the active connections properly. In this paper, we generalize the disjoint path problem by providing a framework that can model arbitrary types of failures, so t...