UFlood: High-throughput flooding over wireless mesh networks
This 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, defi...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
| Online Access: | http://hdl.handle.net/1721.1/74109 https://orcid.org/0000-0002-1455-9652 https://orcid.org/0000-0003-2700-9286 |
| _version_ | 1826207206650937344 |
|---|---|
| author | Subramanian, Jayashree Morris, Robert Tappan Balakrishnan, Hari |
| author2 | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
| author_facet | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Subramanian, Jayashree Morris, Robert Tappan Balakrishnan, Hari |
| author_sort | Subramanian, Jayashree |
| collection | MIT |
| description | This 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. |
| first_indexed | 2024-09-23T13:46:01Z |
| format | Article |
| id | mit-1721.1/74109 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:46:01Z |
| publishDate | 2012 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/741092022-10-01T16:59:30Z UFlood: High-throughput flooding over wireless mesh networks Subramanian, Jayashree Morris, Robert Tappan Balakrishnan, Hari Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Subramanian, Jayashree Morris, Robert Tappan Balakrishnan, Hari This 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. National Science Foundation (U.S.) (Grant CNS-0721702) Foxconn (Sponsorship) 2012-10-18T19:40:49Z 2012-10-18T19:40:49Z 2012-05 2012-03 Article http://purl.org/eprint/type/ConferencePaper 978-1-4673-0773-4 0743-166X http://hdl.handle.net/1721.1/74109 Subramanian, Jayashree, Robert Morris, and Hari Balakrishnan. “UFlood: High-throughput Flooding over Wireless Mesh Networks.” Proceedings IEEE INFOCOM, 2012. 82–90. https://orcid.org/0000-0002-1455-9652 https://orcid.org/0000-0003-2700-9286 en_US http://dx.doi.org/10.1109/INFCOM.2012.6195831 Proceedings IEEE INFOCOM, 2012 Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain |
| spellingShingle | Subramanian, Jayashree Morris, Robert Tappan Balakrishnan, Hari UFlood: High-throughput flooding over wireless mesh networks |
| title | UFlood: High-throughput flooding over wireless mesh networks |
| title_full | UFlood: High-throughput flooding over wireless mesh networks |
| title_fullStr | UFlood: High-throughput flooding over wireless mesh networks |
| title_full_unstemmed | UFlood: High-throughput flooding over wireless mesh networks |
| title_short | UFlood: High-throughput flooding over wireless mesh networks |
| title_sort | uflood high throughput flooding over wireless mesh networks |
| url | http://hdl.handle.net/1721.1/74109 https://orcid.org/0000-0002-1455-9652 https://orcid.org/0000-0003-2700-9286 |
| work_keys_str_mv | AT subramanianjayashree ufloodhighthroughputfloodingoverwirelessmeshnetworks AT morrisroberttappan ufloodhighthroughputfloodingoverwirelessmeshnetworks AT balakrishnanhari ufloodhighthroughputfloodingoverwirelessmeshnetworks |