Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/600965
Title: Bulk Data Dissemination in Wireless Sensor Networks: Analysis, Implications and Improvement
Authors: Xiaolong Zheng;Jiliang Wang;Wei Dong;Yuan He;Yunhao Liu
subject: bulk data dissemination|Wireless sensor networks|protocol design
Year: 2016
Publisher: IEEE
Abstract: To guarantee reliability, bulk data dissemination relies on the negotiation scheme in which senders and receivers negotiate transmission schedule through a three-way handshake procedure. However, we find negotiation incurs a long dissemination time and seriously defers the network-wide convergence. On the other hand, the flooding approach, which is conventionally considered inefficient and energy-consuming, can facilitate bulk data dissemination if appropriately incorporated. This motivates us to pursue a delicate tradeoff between negotiation and flooding in the bulk data dissemination. We propose SurF (Survival of the Fittest), a bulk data dissemination protocol which adaptively adopts negotiation and leverages flooding opportunistically. SurF incorporates a time-reliability model to estimate the time efficiencies (flooding versus negotiation) and dynamically selects the fittest one to facilitate the dissemination process. We implement SurF in TinyOS 2.1.1 and evaluate its performance with 40 TelosB nodes. The results show that SurF, while retaining the dissemination reliability, reduces the dissemination time by 40 percent in average, compared with the state-of-the-art protocols.
Description: 
URI: http://localhost/handle/Hannan/178280
http://localhost/handle/Hannan/600965
ISSN: 0018-9340
volume: 65
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7113818.pdf242.6 kBAdobe PDFThumbnail
Preview File
Title: Bulk Data Dissemination in Wireless Sensor Networks: Analysis, Implications and Improvement
Authors: Xiaolong Zheng;Jiliang Wang;Wei Dong;Yuan He;Yunhao Liu
subject: bulk data dissemination|Wireless sensor networks|protocol design
Year: 2016
Publisher: IEEE
Abstract: To guarantee reliability, bulk data dissemination relies on the negotiation scheme in which senders and receivers negotiate transmission schedule through a three-way handshake procedure. However, we find negotiation incurs a long dissemination time and seriously defers the network-wide convergence. On the other hand, the flooding approach, which is conventionally considered inefficient and energy-consuming, can facilitate bulk data dissemination if appropriately incorporated. This motivates us to pursue a delicate tradeoff between negotiation and flooding in the bulk data dissemination. We propose SurF (Survival of the Fittest), a bulk data dissemination protocol which adaptively adopts negotiation and leverages flooding opportunistically. SurF incorporates a time-reliability model to estimate the time efficiencies (flooding versus negotiation) and dynamically selects the fittest one to facilitate the dissemination process. We implement SurF in TinyOS 2.1.1 and evaluate its performance with 40 TelosB nodes. The results show that SurF, while retaining the dissemination reliability, reduces the dissemination time by 40 percent in average, compared with the state-of-the-art protocols.
Description: 
URI: http://localhost/handle/Hannan/178280
http://localhost/handle/Hannan/600965
ISSN: 0018-9340
volume: 65
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7113818.pdf242.6 kBAdobe PDFThumbnail
Preview File
Title: Bulk Data Dissemination in Wireless Sensor Networks: Analysis, Implications and Improvement
Authors: Xiaolong Zheng;Jiliang Wang;Wei Dong;Yuan He;Yunhao Liu
subject: bulk data dissemination|Wireless sensor networks|protocol design
Year: 2016
Publisher: IEEE
Abstract: To guarantee reliability, bulk data dissemination relies on the negotiation scheme in which senders and receivers negotiate transmission schedule through a three-way handshake procedure. However, we find negotiation incurs a long dissemination time and seriously defers the network-wide convergence. On the other hand, the flooding approach, which is conventionally considered inefficient and energy-consuming, can facilitate bulk data dissemination if appropriately incorporated. This motivates us to pursue a delicate tradeoff between negotiation and flooding in the bulk data dissemination. We propose SurF (Survival of the Fittest), a bulk data dissemination protocol which adaptively adopts negotiation and leverages flooding opportunistically. SurF incorporates a time-reliability model to estimate the time efficiencies (flooding versus negotiation) and dynamically selects the fittest one to facilitate the dissemination process. We implement SurF in TinyOS 2.1.1 and evaluate its performance with 40 TelosB nodes. The results show that SurF, while retaining the dissemination reliability, reduces the dissemination time by 40 percent in average, compared with the state-of-the-art protocols.
Description: 
URI: http://localhost/handle/Hannan/178280
http://localhost/handle/Hannan/600965
ISSN: 0018-9340
volume: 65
issue: 5
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7113818.pdf242.6 kBAdobe PDFThumbnail
Preview File