Show simple item record

dc.contributor.authorSubramanian, Jayashree
dc.contributor.authorMorris, Robert Tappan
dc.contributor.authorBalakrishnan, Hari
dc.date.accessioned2012-10-18T19:40:49Z
dc.date.available2012-10-18T19:40:49Z
dc.date.issued2012-05
dc.date.submitted2012-03
dc.identifier.isbn978-1-4673-0773-4
dc.identifier.issn0743-166X
dc.identifier.urihttp://hdl.handle.net/1721.1/74109
dc.description.abstractThis paper proposes UFlood, a flooding protocol for wireless mesh networks. UFlood targets situations such as software updates where all nodes need to receive the same large file of data, and where limited radio range requires forwarding. UFlood's goals are high throughput and low airtime, defined respectively as rate of completion of a flood to the slowest receiving node and total time spent transmitting. The key to achieving these goals is good choice of sender for each transmission opportunity. The best choice evolves as a flood proceeds in ways that are difficult to predict. UFlood's core new idea is a distributed heuristic to dynamically choose the senders likely to lead to all nodes receiving the flooded data in the least time. The mechanism takes into account which data nearby receivers already have as well as internode channel quality. The mechanism includes a novel bit-rate selection algorithm that trades off the speed of high bit-rates against the larger number of nodes likely to receive low bitrates. Unusually, UFlood uses both random network coding to increase the usefulness of each transmission and detailed feedback about what data each receiver already has; the feedback is critical in deciding which node's coded transmission will have the most benefit to receivers. The required feedback is potentially voluminous, but UFlood includes novel techniques to reduce its cost. The paper presents an evaluation on a 25-node 802.11 test-bed. UFlood achieves 150% higher throughput than MORE, a high-throughput flooding protocol, using 65% less airtime. UFlood uses 54% less airtime than MNP, an existing efficient protocol, and achieves 300% higher throughput.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (Grant CNS-0721702)en_US
dc.description.sponsorshipFoxconn (Sponsorship)en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/INFCOM.2012.6195831en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleUFlood: High-throughput flooding over wireless mesh networksen_US
dc.typeArticleen_US
dc.identifier.citationSubramanian, Jayashree, Robert Morris, and Hari Balakrishnan. “UFlood: High-throughput Flooding over Wireless Mesh Networks.” Proceedings IEEE INFOCOM, 2012. 82–90.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorSubramanian, Jayashree
dc.contributor.mitauthorMorris, Robert Tappan
dc.contributor.mitauthorBalakrishnan, Hari
dc.relation.journalProceedings IEEE INFOCOM, 2012en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dspace.orderedauthorsSubramanian, Jayashree; Morris, Robert; Balakrishnan, Harien
dc.identifier.orcidhttps://orcid.org/0000-0002-1455-9652
dc.identifier.orcidhttps://orcid.org/0000-0003-2700-9286
dspace.mitauthor.errortrue
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record