At the present stage wireless sensor network exists some deficiencies such as finite energy, limited communication capability, multi-hop routing and dynamic topology. In addition too many nodes which are distributed intensively influence also performance of wireless sensor network. Besides distributed optimization problem always impact to efficiency of the network. For data processing and routi...

Routing tendons in straight paths along an elastic backbone is a widely used method of actuation for continuum robots. Tendon routing paths which are general curves in space enable a much larger family of robots to be designed, with configuration spaces and workspaces that are unattainable with straight tendon routing. Harnessing general tendon routing to extend the capabilities of continuum ro...

Hybrid wireless networks support both Mobile Adhoc network (MANET) and Infrastructure wireless network. An efficient data routing protocol is important to improve the network efficiency. This efficient data routing protocol support hybrid wireless networks for high capacity and scalability. In this paper, we proposed Distributed Three-Hop Routing (DTR) protocol to improve the capacity of Hybrid...

been proposed to meet the QoS requirement of today's multimedia applications. These algorithms can be divided into two categories: source routing and distributed routing. In this paper, we propose a novel QoS routing algorithm, which is an integration of source routing and distributed routing. We introduce the concept of " Domain " which is a set of neighboring nodes and links. Each node has it...

In multi-hop wireless ad-hoc networks, designing energy-efficient routing protocols is critical since nodes are power-constrained. However, it is also an inherently hard problem due to two important factors: First, the nodes may be mobile, demanding the energy-efficient routing protocol to be fully distributed and adaptive to the current states of nodes; second, the wireless links may be uni-di...

| We motivate and formally deene dynamic multipath routing and present the problem of packet forwarding in the multipath routing context. We demonstrate that for multipath sets that are suux matched, forwarding can be eeciently implemented with (1) a per packet overhead of a small, xed-length path identiier, and (2) router space overhead linear in K, the number of alternate paths between a sour...

We motivate and formally define dynamic multipath routing and present the problem of packet forwarding in the multipath routing context. We demonstrate that for multipath sets that are suffis matched, forwarding can be efficiently implemented with (1) a per packet overhead of a small, fixed-length path identifier, and (2) router space overhead linear in K , the number of alternate paths between...

In this paper we present an adaptive distributed cross-layer routing algorithm (ADCR) for hybrid wireless network with dedicated relay stations (HWN*). To support versatile multimedia communication for Mobile Terminals (MTs), the HWN* integrates a cellular network, an ad hoc network and fixed relay nodes (RNs). A MT may borrow cellular data channels that are available thousands mile away via se...

Gordon, J.M., Analysis of minimal path routing schemes in the presence of faults, Discrete Applied Mathematics 37138 (1992) 245-263. The design and analysis of fault tolerant message routing schemes for large paraIIe1 systems has been the focus of much recent research. In this paper, we present a framework for the analysis of routing schemes in distributed memory multiprocessor systems containi...

We survey in this paper the classical results, and also the most recent results, in the eld of Interval Routing, a well-known strategy to code in a compact way distributed routing algorithms. These results are classi ed in several themes: characterization, compactness and shortest path, dilation and stretch factor, speci c class of graphs (interconnection networks, bounded degree, planar, chord...