Abstract-We present AIR (Automatic Incremental Routing), a unified approach for scalable unicast and multicast routing in mobile ad hoc networks (MANET). In AIR, nodes run a distributed routing algorithm to assign prefix labels to themselves. The labels are assigned such that routing to unicast or multicast destinations is automatic, in that a route from any node to a destination is defined by the node's prefix labels, and incremental, in that no relay node needs to know an entire path to any destination. We verify that AIR provides correct unicast and multicast routing, and present simulation results comparing AIR with AODV, OLSR, MAODV and ODMRP in MANETs. The results from these simulation experiments, as well as from tests carried out in a small testbed running AIR in wireless routers, illustrate that AIR offers substantial performance advantages over traditional unicast and multicast routing protocols, even in the case of small networks.
Abstract-We introduce the Prefix Routing Over Set Elements (PROSE) protocol for scalable routing in MANETs based on the combined use of prefix labels and distributed hashing. In PROSE, nodes use neighbor-to-neighbor signaling to label themselves with prefix labels that provide implicit routing from any node to any network destination, and nodes implement a distributed hash table to store the mappings between node identifiers (e.g., a MAC or IP address) and their prefix labels and allow destinations to publish their existence and sources to subscribe to their intended destinations. We show that PROSE provides correct routing based on prefix labels and that its signaling overhead grows sub-linearly with the network size. We present simulation and testbed results that illustrate the benefits of PROSE compared to traditional MANET routing protocols, and show that the stretch of the prefix-based routes compared to shortest-paths is smaller than three.
Abstract-We introduce Prefix-based Multicast Routing (PMR), the first approach to multicast routing in MANETs in which the network-wide dissemination of control information is independent of the number of groups and sources per group. PMR establishes a labeled directed acyclic graph (LDAG) rooted at an elected node in the MANET and assigns a prefix label to each node denoting its network location relative to the root of the LDAG. Routes between any two prefix labels are implicit in the labels themselves. The sources and receivers of a multicast group use a consistent hashing function to map the identifier of the group (e.g., an IP multicast address) onto the group-prefix-label. The node whose prefix label is the closest match to the groupprefix-label serves as the core of the group. As in prior receiverinitiated multicast approaches, receivers join a multicast group by sending join requests towards the group core, and multicast sources simply forward their multicast data packets towards the cores of the groups. We use simulation experiments to compare PMR with ODMRP and MAODV for different mobility scenarios with varying number of nodes, groups and receivers. The results clearly show that PMR is far more efficient than traditional multicast routing approaches, even in relatively small networks.
Abstract-Networks based on Ethernet bridging scale poorly as bridges flood the entire network repeatedly, and several schemes have been proposed to mitigate this flooding problem; however, none have managed to eliminate flooding completely. We present Automatic Integrated Routing (AIR) as the first routing protocol that eliminates flooding by assigning prefix labels to switches and building a Distributed Hash Table (DHT). The DHT maps host identifiers to the prefix labels of the switches through which they connect to the network. Each switch is assigned a prefix label using neighbor-to-neighbor messages. Prefix labels denote the locations of the switches in the network, and the prefix labels of any two switches automatically determine one or multiple routes between them. The DHT stores the mapping between the name of a host and its network location (prefix label) in a scalable fashion, with any one switch storing only a fraction of all the mappings. In contrast, prior approaches using DHTs to resolve host names incur the communication and storage overhead introduced by an underlying link-state routing protocol. Results using packet-level traces of Internet traffic demonstrate that AIR attains performance gains of orders of magnitude over Ethernet bridging and prior DHT-based schemes.
No abstract
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.