Whisper: Fast flooding for low-powerwireless networks
2019 (Engelska)Ingår i: ACM transactions on sensor networks, ISSN 1550-4867, E-ISSN 1550-4859, Vol. 15, nr 4, artikel-id 47Artikel i tidskrift (Refereegranskat) Published
Abstract [en]
This article presentsWhisper, a fast and reliable protocol to flood small amounts of data into a multi-hop network. Whisper makes use of synchronous transmissions, a technique first introduced by the Glossy flooding protocol. In contrast to Glossy,Whisper does not let the radio switch from receive to transmit mode between messages. Instead, it makes nodes continuously transmit identical copies of the message and eliminates the gaps between subsequent transmissions. To this end, Whisper embeds the message to be flooded into a signaling packet that is composed of multiple packlets-where a packlet is a portion of the message payload that mimics the structure of an actual packet. A node must intercept only one of the packlets to detect that there is an ongoing transmission and that it should start forwarding the message. This allows Whisper to speed up the propagation of the flood and, thus, to reduce the overall radio-on time of the nodes. Our evaluation on the FlockLab testbed shows thatWhisper achieves comparable reliability but 2×lower radio-on time than Glossy. We further show that by embedding Whisper in an existing data collection application, we can more than double the lifetime of the network. © 2019 Copyright held by the owner/author(s).
Ort, förlag, år, upplaga, sidor
Association for Computing Machinery , 2019. Vol. 15, nr 4, artikel-id 47
Nyckelord [en]
Consecutive packet transmissions, Energy-efficient sampling, Low-power wireless networks, Periodic and event-based traffic, Synchronous transmissions, Energy efficiency, Floods, Energy efficient, Event-based, Low power wireless networks, Packet transmissions, Synchronous transmission, Low power electronics
Nationell ämneskategori
Naturvetenskap
Identifikatorer
URN: urn:nbn:se:ri:diva-40923DOI: 10.1145/3356341Scopus ID: 2-s2.0-85075557956OAI: oai:DiVA.org:ri-40923DiVA, id: diva2:1376755
2019-12-102019-12-102019-12-10Bibliografiskt granskad