Topic
Zone Routing Protocol
About: Zone Routing Protocol is a research topic. Over the lifetime, 18209 publications have been published within this topic receiving 383658 citations.
Papers published on a yearly basis
Papers
More filters
••
TL;DR: This paper first examines the basic problem of QoS routing, namely, finding a path that satisfies multiple constraints, and its implications on routing metric selection, and presents three path computation algorithms for source routing and for hop-by-hop routing.
Abstract: Several new architectures have been developed for supporting multimedia applications such as digital video and audio. However, quality-of-service (QoS) routing is an important element that is still missing from these architectures. In this paper, we consider a number of issues in QoS routing. We first examine the basic problem of QoS routing, namely, finding a path that satisfies multiple constraints, and its implications on routing metric selection, and then present three path computation algorithms for source routing and for hop-by-hop routing.
1,769 citations
••
TL;DR: This paper proposes PRoPHET, a probabilistic routing protocol for intermittently connected networks and shows that it is able to deliver more messages than Epidemic Routing with a lower communication overhead.
Abstract: In this paper, we address the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exists at any time, rendering traditional routing protocols unable to deliver messages between hosts. There does, however, exist a number of scenarios where connectivity is intermittent, but where the possibility of communication still is desirable. Thus, there is a need for a way to route through networks with these properties. We propose PRoPHET, a probabilistic routing protocol for intermittently connected networks and compare it to the earlier presented Epidemic Routing protocol through simulations. We show that PRoPHET is able to deliver more messages than Epidemic Routing with a lower communication overhead.
1,750 citations
••
05 Nov 2003TL;DR: This work study and evaluate link estimator, neighborhood table management, and reliable routing protocol techniques, and narrow the design space through evaluations on large-scale, high-level simulations to 50-node, in-depth empirical experiments.
Abstract: The dynamic and lossy nature of wireless communication poses major challenges to reliable, self-organizing multihop networks. These non-ideal characteristics are more problematic with the primitive, low-power radio transceivers found in sensor networks, and raise new issues that routing protocols must address. Link connectivity statistics should be captured dynamically through an efficient yet adaptive link estimator and routing decisions should exploit such connectivity statistics to achieve reliability. Link status and routing information must be maintained in a neighborhood table with constant space regardless of cell density. We study and evaluate link estimator, neighborhood table management, and reliable routing protocol techniques. We focus on a many-to-one, periodic data collection workload. We narrow the design space through evaluations on large-scale, high-level simulations to 50-node, in-depth empirical experiments. The most effective solution uses a simple time averaged EWMA estimator, frequency based table management, and cost-based routing.
1,735 citations
01 Feb 2007
TL;DR: The Dynamic Source Routing protocol is a simple and efficient routing protocol designed specifically for use in multi-hop wireless ad hoc networks of mobile nodes, designed to work well even with very high rates of mobility.
Abstract: The Dynamic Source Routing protocol (DSR) is a simple and efficient
routing protocol designed specifically for use in multi-hop wireless
ad hoc networks of mobile nodes. DSR allows the network to be
completely self-organizing and self-configuring, without the need for
any existing network infrastructure or administration. The protocol is
composed of the two mechanisms of "Route Discovery" and "Route
Maintenance", which work together to allow nodes to discover and
maintain source routes to arbitrary destinations in the ad hoc
network. The use of source routing allows packet routing to be
trivially loop-free, avoids the need for up-to-date routing
information in the intermediate nodes through which packets are
forwarded, and allows nodes forwarding or overhearing packets to cache
the routing information in them for their own future use. All aspects
of the protocol operate entirely on-demand, allowing the routing
packet overhead of DSR to scale automatically to only that needed to
react to changes in the routes currently in use. This document
specifies the operation of the DSR protocol for routing unicast IP
packets in multi-hop wireless ad hoc networks.
1,649 citations
••
26 Mar 2000
TL;DR: It is demonstrated that even though DSR and AODV share a similar on-demand behavior the differences in the protocol mechanics can lead to significant performance differentials.
Abstract: Ad hoc networks are characterized by multi-hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. We compare the performance of two prominent on-demand routing protocols for mobile ad hoc networks - dynamic source routing (DSR) and ad hoc on-demand distance vector routing (AODV). A detailed simulation model with MAC and physical layer models is used to study inter-layer interactions and their performance implications. We demonstrate that even though DSR and AODV share a similar on-demand behavior the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials are analyzed using varying network load, mobility and network size. Based on the observations, we make recommendations about how the performance of either protocol can be improved.
1,629 citations