Static routing

About: Static routing is a research topic. Over the lifetime, 25733 publications have been published within this topic receiving 576732 citations.

Adaptive multipath source routing in ad hoc networks

Abstract: In this paper, we propose a new multipath routing protocol for ad hoc wireless networks-multipath source routing (MSR), which is an extension of DSR (dynamic source routing). Based on the measurement of RTT, we propose a scheme to distribute load among multiple paths. The simulation results show that our approach improves the packet delivery ratio and the throughput of TCP and UDP, and reduces the end-to-end delay and the average queue size, while adding little overhead. As a result, MSR decreases the network congestion and increases the path fault tolerance quite well.

Social feature-based multi-path routing in delay tolerant networks

Abstract: Most routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection process. In this paper, we use the internal social features of each node in the network to perform the routing process. This approach is motivated from several social contact networks, such as the Infocom 2006 trace, where people contact each other more frequently if they have more social features in common. Our approach includes two unique processes: social feature extraction and multi-path routing. In social feature extraction, we use entropy to extract the m most informative social features to create a feature space (F-space): (F 1 , F 2 , …, F m ), where F i corresponds to a feature. The routing method then becomes a hypercube-based feature matching process where the routing process is a step-by-step feature difference resolving process. We offer two special multi-path routing schemes: node-disjoint-based routing and delegation-based routing. Extensive simulations on both real and synthetic traces are conducted in comparison with several existing approaches, including spray-and-wait routing and spray-and-focus routing.

Using multiparent routing in RPL to increase the stability and the lifetime of the network

Abstract: Energy is a very scarce resource in Wireless Sensor Networks. While most of the current proposals focus on minimizing the global energy consumption, we aim here at designing an energy-balancing routing protocol that maximizes the lifetime of the most constraint nodes. To improve the network lifetime, each node should consume the same (minimal) quantity of energy. We propose the Expected Lifetime metric, denoting the residual time of a node (time until the node will run out of energy). We design mechanisms to detect energy-bottleneck nodes and to spread the traffic load uniformly among them. Moreover, we apply this metric to RPL, the de facto routing standard in low-power and lossy networks. In order to avoid instabilities in the network and problems of convergence, we propose here a multipath approach. We exploit the Directed Acyclic Graph (DAG) structure of the routing topology to probabilistically forward the traffic to several parents. Simulations highlight that we improve both the routing reliability and the network lifetime, while reducing the number of DAG reconfigurations.

Backpressure-based routing protocol for DTNs

Abstract: In this paper we consider an alternative, highly agile In this paper we consider an alternative, highly agile approach called backpressure routing for Delay Tolerant Networks (DTN), in which routing and forwarding decisions are made on a per-packet basis. Using information about queue backlogs, random walk and data packet scheduling nodes can make packet routing and forwarding decisions without the notion of end-to-end routes. To the best of our knowledge, this is the first ever implementation of dynamic backpressure routing in DTNs. Simulation results show that the proposed approach has advantages in terms of DTN networks.