RBP: Robust Broadcast Propagation in Wireless Networks. Stann, F., Heidemann, J., Shroff, R., & Murtaza, M. Z. In Proceedings of the FourthACM SenSys Conference , pages 85–98, Boulder, Colorado, USA, November, 2006. ACM. Paper abstract bibtex Varying interference levels make broadcasting an unreliable operation in low-power wireless networks. Many routing and resource discovery protocols depend on flooding (repeated per-node broadcasts) over the network. Unreliability at the broadcast-level can result in either incomplete flooding coverage or excessive re-flooding, making path maintenance either unreliable or expensive. We present RBP, a very simple protocol that bolsters the reliability of broadcasting in such networks. Our protocol requires only local information, and resides as a service between the MAC and network layer, taking information from both. We show that RBP improves reliability while balancing energy efficiency. RBP is based on two principles: First, we exploit network density to achieve near-perfect flooding reliability by requiring moderate (50–70%) broadcast reliability when nodes have many neighbors. Second, we identify areas of sparse connectivity where important links bridge dense clusters of nodes, and strive for guaranteed reliability over those links. We demonstrate, through both testbed experiments and controlled simulations, that this hybrid approach is advantageous to providing near-perfect reliability for flooding with good efficiency. Testbed experiments show 99.8% reliability with 48% less overhead than the level of flooding required to get equivalent reliability, suggesting that routing protocols will benefit from RBP.
@InProceedings{Stann06b,
author = "Fred Stann and John Heidemann and Rajesh
Shroff and Muhammad Zaki Murtaza",
title = "RBP: Robust Broadcast Propagation in Wireless Networks",
booktitle = "Proceedings of the " # "Fourth" # " ACM {SenSys} Conference ",
year = 2006,
sortdate = "2006-11-01",
project = "ilense, snuse",
jsubject = "sensornet_data_dissemination",
publisher = "ACM",
address = "Boulder, Colorado, USA",
month = nov,
pages = "85--98",
location = "johnh: pafile",
url = "http://www.isi.edu/%7ejohnh/PAPERS/Stann06b.html",
pdfurl = "http://www.isi.edu/%7ejohnh/PAPERS/Stann06b.pdf",
supporting = "The software used in this paper is
available as diffusion-3.3.0 at \url{http://www.isi.edu/ilense/software/diffusion}.",
myorganization = "USC/Information Sciences Institute",
copyrightholder = "ACM",
copyrightterms = "Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ",
abstract = "
Varying interference levels make broadcasting an unreliable operation
in low-power wireless networks. Many routing and resource discovery
protocols depend on flooding (repeated per-node broadcasts) over the
network. Unreliability at the broadcast-level can result in either
incomplete flooding coverage or excessive re-flooding, making path
maintenance either unreliable or expensive. We present RBP, a very
simple protocol that bolsters the reliability of broadcasting in such
networks. Our protocol requires only local information, and resides
as a service between the MAC and network layer, taking information
from both. We show that RBP improves reliability while balancing
energy efficiency. RBP is based on two principles: First, we exploit
network density to achieve near-perfect flooding reliability by
requiring moderate (50--70\%) broadcast reliability when nodes have
many neighbors. Second, we identify areas of sparse connectivity where
important links bridge dense clusters of nodes, and strive for
guaranteed reliability over those links. We demonstrate, through both
testbed experiments and controlled simulations, that this hybrid
approach is advantageous to providing near-perfect reliability for
flooding with good efficiency. Testbed experiments show 99.8\%
reliability with 48\% less overhead than the level of flooding
required to get equivalent reliability, suggesting that routing
protocols will benefit from RBP.
",
}
Downloads: 0
{"_id":"M7SCuR2yoa4ANTESh","bibbaseid":"stann-heidemann-shroff-murtaza-rbprobustbroadcastpropagationinwirelessnetworks-2006","author_short":["Stann, F.","Heidemann, J.","Shroff, R.","Murtaza, M. Z."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Fred"],"propositions":[],"lastnames":["Stann"],"suffixes":[]},{"firstnames":["John"],"propositions":[],"lastnames":["Heidemann"],"suffixes":[]},{"firstnames":["Rajesh"],"propositions":[],"lastnames":["Shroff"],"suffixes":[]},{"firstnames":["Muhammad","Zaki"],"propositions":[],"lastnames":["Murtaza"],"suffixes":[]}],"title":"RBP: Robust Broadcast Propagation in Wireless Networks","booktitle":"Proceedings of the FourthACM SenSys Conference ","year":"2006","sortdate":"2006-11-01","project":"ilense, snuse","jsubject":"sensornet_data_dissemination","publisher":"ACM","address":"Boulder, Colorado, USA","month":"November","pages":"85–98","location":"johnh: pafile","url":"http://www.isi.edu/%7ejohnh/PAPERS/Stann06b.html","pdfurl":"http://www.isi.edu/%7ejohnh/PAPERS/Stann06b.pdf","supporting":"The software used in this paper is available as diffusion-3.3.0 at ˘rlhttp://www.isi.edu/ilense/software/diffusion.","myorganization":"USC/Information Sciences Institute","copyrightholder":"ACM","copyrightterms":"Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. ","abstract":"Varying interference levels make broadcasting an unreliable operation in low-power wireless networks. Many routing and resource discovery protocols depend on flooding (repeated per-node broadcasts) over the network. Unreliability at the broadcast-level can result in either incomplete flooding coverage or excessive re-flooding, making path maintenance either unreliable or expensive. We present RBP, a very simple protocol that bolsters the reliability of broadcasting in such networks. Our protocol requires only local information, and resides as a service between the MAC and network layer, taking information from both. We show that RBP improves reliability while balancing energy efficiency. RBP is based on two principles: First, we exploit network density to achieve near-perfect flooding reliability by requiring moderate (50–70%) broadcast reliability when nodes have many neighbors. Second, we identify areas of sparse connectivity where important links bridge dense clusters of nodes, and strive for guaranteed reliability over those links. We demonstrate, through both testbed experiments and controlled simulations, that this hybrid approach is advantageous to providing near-perfect reliability for flooding with good efficiency. Testbed experiments show 99.8% reliability with 48% less overhead than the level of flooding required to get equivalent reliability, suggesting that routing protocols will benefit from RBP. ","bibtex":"@InProceedings{Stann06b,\n\tauthor = \t\"Fred Stann and John Heidemann and Rajesh\n Shroff and Muhammad Zaki Murtaza\",\n\ttitle = \"RBP: Robust Broadcast Propagation in Wireless Networks\",\n\tbooktitle = \t\"Proceedings of the \" # \"Fourth\" # \" ACM {SenSys} Conference \",\n\tyear = \t\t2006,\n\tsortdate = \"2006-11-01\",\n\tproject = \"ilense, snuse\",\n\tjsubject = \"sensornet_data_dissemination\",\n\tpublisher =\t\"ACM\",\n\taddress =\t\"Boulder, Colorado, USA\",\n\tmonth =\t\tnov,\n\tpages =\t\t\"85--98\",\n\tlocation =\t\"johnh: pafile\",\n\turl =\t\t\"http://www.isi.edu/%7ejohnh/PAPERS/Stann06b.html\",\n\tpdfurl =\t\"http://www.isi.edu/%7ejohnh/PAPERS/Stann06b.pdf\",\n\tsupporting = \"The software used in this paper is\n available as diffusion-3.3.0 at \\url{http://www.isi.edu/ilense/software/diffusion}.\",\n\tmyorganization =\t\"USC/Information Sciences Institute\",\n\tcopyrightholder = \"ACM\",\n\tcopyrightterms = \"Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. \",\n\tabstract = \"\nVarying interference levels make broadcasting an unreliable operation\nin low-power wireless networks. Many routing and resource discovery\nprotocols depend on flooding (repeated per-node broadcasts) over the\nnetwork. Unreliability at the broadcast-level can result in either\nincomplete flooding coverage or excessive re-flooding, making path\nmaintenance either unreliable or expensive. We present RBP, a very\nsimple protocol that bolsters the reliability of broadcasting in such\nnetworks. Our protocol requires only local information, and resides\nas a service between the MAC and network layer, taking information\nfrom both. We show that RBP improves reliability while balancing\nenergy efficiency. RBP is based on two principles: First, we exploit\nnetwork density to achieve near-perfect flooding reliability by\nrequiring moderate (50--70\\%) broadcast reliability when nodes have\nmany neighbors. Second, we identify areas of sparse connectivity where\nimportant links bridge dense clusters of nodes, and strive for\nguaranteed reliability over those links. We demonstrate, through both\ntestbed experiments and controlled simulations, that this hybrid\napproach is advantageous to providing near-perfect reliability for\nflooding with good efficiency. Testbed experiments show 99.8\\%\nreliability with 48\\% less overhead than the level of flooding\nrequired to get equivalent reliability, suggesting that routing\nprotocols will benefit from RBP.\n\",\n}\n\n","author_short":["Stann, F.","Heidemann, J.","Shroff, R.","Murtaza, M. Z."],"bibbaseid":"stann-heidemann-shroff-murtaza-rbprobustbroadcastpropagationinwirelessnetworks-2006","role":"author","urls":{"Paper":"http://www.isi.edu/%7ejohnh/PAPERS/Stann06b.html"},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bibbase.org/f/dHevizJoWEhWowz8q/johnh-2023-2.bib","dataSources":["YLyu3mj3xsBeoqiHK","fLZcDgNSoSuatv6aX","fxEParwu2ZfurScPY","7nuQvtHTqKrLmgu99"],"keywords":[],"search_terms":["rbp","robust","broadcast","propagation","wireless","networks","stann","heidemann","shroff","murtaza"],"title":"RBP: Robust Broadcast Propagation in Wireless Networks","year":2006}