Equal-cost multi-path routing

About: Equal-cost multi-path routing is a research topic. Over the lifetime, 10472 publications have been published within this topic receiving 249362 citations.

Load-aware on-demand routing (LAOR) protocol for mobile ad hoc networks

Abstract: Most current routing protocols for mobile ad hoc networks consider the shortest path with minimum hop counts at the optimal route. However, the minimum end-to-end delay from source to destination may not always be achieved through this shortest path. In this paper, we propose an efficient delay-based load-aware on-demand routing (D-LAOR) protocol, which determines the optimal path based on the estimated total path delay and the hop count. We demonstrate the effectiveness of D-LAOR by integrating it with the ad hoc on-demand distance vector (AODV) routing protocol. Simulation results obtained suing the ns-2 network simulation platform, show that D-LAOR scheme increases packet delivery fraction and decreases end-to-end delay by more than 10% in a moderate network scenario when compared with the original AODV ad the other LAOR protocols.

Landmark Selection and Greedy Landmark-Descent Routing for Sensor Networks

Abstract: We study the problem of landmark selection for landmark-based routing in a network of fixed wireless communication nodes. We present a distributed landmark selection algorithm that does not rely on global clock synchronization, and a companion local greedy landmark-based routing scheme. We assume no node location information, and that each node can communicate with some of its geographic neighbors. Each node is named by its hop count distances to a small number of nearby landmarks. Greedy routing at a node is performed to equalize its vector of landmark distances to that of the destination. This is done by following the shortest path to the landmark that maximizes the ratio of its distances to the source and the destination. In addition, we propose a method to alleviate the difficulty in routing to destinations near the boundaries by virtually expanding the network boundaries. The greedy routing, when combined with our landmark selection scheme, has a provable bounded path stretch relative to the best path possible, and guarantees packet delivery in the continuous domain. In the discrete domain, our simulations show that the landmark selection scheme is effective, and the companion routing scheme performs well under realistic settings. Both the landmark selection and greedy routing assumes no specific communication model and works with asymmetric links. Although some of the analysis are non-trivial, the algorithms are simple, flexible and cost-effective enough to warrant a real-world deployment.

Internet path inflation due to policy routing

Abstract: In our previous work, we used a simplified model of routing policy in the Internet to study the impact of policy routing on Internet path-lengths. This prior work suffered from two shortcomings--it was based on a single snapshot of the Internet topology, and our simplified policy model could generate AS paths that violate peering relationships. In this paper, we address these two shortcomings by re-examining our results with respect to a more recent snapshot of the Internet, and improving the policy model to avoid peering violation. We find that our prior observations regarding the path inflation due to routing policy appear to hold both across time and with respect to a more sophisticated model of routing policy.© (2001) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

PSO-based approach for energy-efficient and energy-balanced routing and clustering in wireless sensor networks

Abstract: Many schemes have been proposed for energy-efficient routing in wireless sensor networks (WSNs). However, most of these algorithms focus only on energy efficiency in which each node finds a shortest path to the base station (BS), but remain silent about energy balancing which is equally important to prolong the network lifetime. In this paper, we propose particle swarm optimization-based routing and clustering algorithms for WSNs. The routing algorithm builds a trade-off between energy efficiency and energy balancing, whereas the clustering algorithm takes care of the energy consumption of gateways as well as sensor nodes. We develop an efficient particle-encoding scheme and derive a multi-objective fitness function for each of the proposed routing and clustering algorithms. The algorithms are also capable of tolerating the failure of cluster heads. We perform extensive simulations on the proposed schemes and the results are compared with the existing algorithms to demonstrate their superiority in terms of various performance metrics.

A Distributed Routing Design for a Broadcast Environment

Abstract: In this paper, we will present the need for distributed network control in a packet radio environment, the criteria used for its evaluation, and an overview of the network algorithms chosen to maintain routing information and to route user traffic The routing algorithm, known as tiered rings, functions by building a distributed tree of shortest path routes to each packet radio in the network The information kept by each node grows only linearly as the network expands The design uses the radio channel efficiently by providing shortest path routing and by taking advantage of the information available in a broadcast environment