Reverse path forwarding of broadcast packets

Dalal, Yogen K.; Metcalfe, Robert M.

doi:10.1145/359657.359665

Cited by 328 publications

(122 citation statements)

References 6 publications

(12 reference statements)

Supporting

Mentioning

121

Contrasting

Order By: Relevance

“…, N}) and the knowledge of their own residual energy, e n , our goal is to construct a tree spanning all these sources and to select an appropriate root for data collection, in a distributed way, such that the energy of the tree is maximized. We take the approach of exploring the highest-energy branch from each source to a root, by first assuming that every source node is a root, using a method similar to Reverse-Path Forwarding (RPF) [17]. This generates a total of N unique trees with each being rooted at a distinct source node.…”

Section: Lpt: the Distributed Approachmentioning

confidence: 99%

E-Span and LPT for data aggregation in wireless sensor networks

Lee

Wong

2006

Computer Communications

View full text Add to dashboard Cite

In wireless sensor networks (WSNs), when a stimulus or event is detected within a particular region, data reports from the neighboring sensor nodes (sources) are sent to the sink (destination). Data from these sources are usually aggregated along their way to the sink. The data aggregation via in-network processing reduce communication cost and improves energy efficiency. In this paper, we propose two different tree structures to facilitate data aggregation. We first propose E-Span, which is an energy-aware spanning tree algorithm. In E-span, the source node which has the highest residual energy is chosen as the root. Other source nodes choose their corresponding parent node among their neighbors based on the information of the residual energy and distance to the root. We also propose the Lifetime-Preserving Tree (LPT). In LPT, nodes which have higher residual energy are chosen as the aggregating parents. LPT also includes a self-healing feature by which the tree will be re-constructed again whenever a node is no longer functional or a broken link is detected. By choosing Directed Diffusion [C. Intanagonwiwat, R. Govindan, D. Estrin, Directed diffusion: a scalable and robust communication paradigm for sensor networks, in: Proc. of ACM MobiCom'00, Boston, MA, Aug. 2000, pp. 56-67.] as the underlying routing platform, simulation results show that in a WSN with 250 sensor nodes, the lifetime of sources can be extended significantly when data are aggregated by using either E-Span or LPT algorithms.

show abstract

Section: Lpt: the Distributed Approachmentioning

confidence: 99%

E-Span and LPT for data aggregation in wireless sensor networks

Lee

Wong

2006

Computer Communications

View full text Add to dashboard Cite

show abstract

“…This approach is based upon distance-vector routing information distribution and hop-by-hop forwarding. It uses Reverse Path Forwarding (RPF) [DM78] -a distributed algorithm for constructing an internetwork broadcast tree. DVMRP uses a modified RPF algorithm, essentially a truncated broadcast tree, to build a reverse shortest path sender-based multicast delivery tree.…”

Section: Approachesmentioning

confidence: 99%

Multicast Support for Nimrod : Requirements and Solution Approaches

Ramanathan¹

1997

View full text Add to dashboard Cite

show abstract

“…Multicast allows one copy of each packet to be sent from a source. These packets are then replicated at key branching points along a tree connecting all interested receivers [6].…”

Section: Introductionmentioning

confidence: 99%

Application layer reachability monitoring for IP multicast

Sarac

Almeroth

2005

Computer Networks

View full text Add to dashboard Cite

Abstract-Monitoring and management have become key requirements for the success of multicast deployment in the Internet. One of the most important monitoring tasks for multicast is to verify the availability of service in the network. This task is usually referred to as reachability monitoring. In this paper, we present an application layer multicast reachability monitoring system called sdr-monitor. Sdrmonitor has emerged in response to the practical need of verifying service availability and detecting potential problems during the early years of native multicast deployment in the inter-domain. Sdr-monitor leverages an existing application and provides close to real-time reachability monitoring for the multicast infrastructure. Since its initial deployment in 1998, sdr-monitor has been serving the multicast community in detecting and correcting multicast reachability problems in the Internet. In addition, sdr-monitor pioneered a number of additional research projects in multicast monitoring and management. In this paper, we first present the architecture of the sdr-monitor system and its outputs. Then, by using a four-year reachability monitoring data set, we present a long term analysis of the reachability characteristics of the multicast infrastructure. Next, by using additional network layer information, we classify reachability problems. Finally, we evaluate sdr-monitor as a reachability monitoring system and identify a number of ways in which it could be improved.

show abstract

Reverse path forwarding of broadcast packets

Cited by 328 publications

References 6 publications

E-Span and LPT for data aggregation in wireless sensor networks

E-Span and LPT for data aggregation in wireless sensor networks

Multicast Support for Nimrod : Requirements and Solution Approaches

Application layer reachability monitoring for IP multicast

Contact Info

Product

Resources

About