Multicast With Minimal Congestion Using Connected Dominating Sets
draft-perkins-manet-smurf-00
| Document | Type | Expired Internet-Draft (individual) | |
|---|---|---|---|
| Author | Charles Perkins | ||
| Last updated | 2005-07-12 | ||
| Stream | (None) | ||
| Intended RFC status | (None) | ||
| Formats |
Expired & archived
pdf
htmlized (tools)
htmlized
bibtex
|
||
| Stream | Stream state | (No stream defined) | |
| Consensus Boilerplate | Unknown | ||
| RFC Editor Note | (None) | ||
| IESG | IESG state | Expired | |
| Telechat date | |||
| Responsible AD | (None) | ||
| Send notices to | (None) | ||
https://www.ietf.org/archive/id/draft-perkins-manet-smurf-00.txt
Abstract
Flooding is useful for many reasons in ad hoc networks, but causes congestion that can block traffic. Selecting multi-point relays (MPRs) reduces congestion due to flooding, but has several disadvantages. It is possible to select a subset of the MPRs to do the same job more effectively. In this document, signaling is specified for identifying a relatively small connected dominating set that can still manage the flooding operation.
Authors
Charles Perkins (charliep@iprg.nokia.com)
(Note: The e-mail addresses provided for the authors of this Internet-Draft may no longer be valid.)