Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/600965
Full metadata record
DC FieldValueLanguage
dc.contributor.authorXiaolong Zhengen_US
dc.contributor.authorJiliang Wangen_US
dc.contributor.authorWei Dongen_US
dc.contributor.authorYuan Heen_US
dc.contributor.authorYunhao Liuen_US
dc.date.accessioned2020-05-20T08:56:10Z-
dc.date.available2020-05-20T08:56:10Z-
dc.date.issued2016en_US
dc.identifier.issn0018-9340en_US
dc.identifier.other10.1109/TC.2015.2435778en_US
dc.identifier.urihttp://localhost/handle/Hannan/178280en_US
dc.identifier.urihttp://localhost/handle/Hannan/600965-
dc.descriptionen_US
dc.description.abstractTo 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.en_US
dc.publisherIEEEen_US
dc.relation.haspart7113818.pdfen_US
dc.subjectbulk data dissemination|Wireless sensor networks|protocol designen_US
dc.titleBulk Data Dissemination in Wireless Sensor Networks: Analysis, Implications and Improvementen_US
dc.typeArticleen_US
dc.journal.volume65en_US
dc.journal.issue5en_US
dc.journal.titleIEEE Transactions on Computersen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7113818.pdf242.6 kBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorXiaolong Zhengen_US
dc.contributor.authorJiliang Wangen_US
dc.contributor.authorWei Dongen_US
dc.contributor.authorYuan Heen_US
dc.contributor.authorYunhao Liuen_US
dc.date.accessioned2020-05-20T08:56:10Z-
dc.date.available2020-05-20T08:56:10Z-
dc.date.issued2016en_US
dc.identifier.issn0018-9340en_US
dc.identifier.other10.1109/TC.2015.2435778en_US
dc.identifier.urihttp://localhost/handle/Hannan/178280en_US
dc.identifier.urihttp://localhost/handle/Hannan/600965-
dc.descriptionen_US
dc.description.abstractTo 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.en_US
dc.publisherIEEEen_US
dc.relation.haspart7113818.pdfen_US
dc.subjectbulk data dissemination|Wireless sensor networks|protocol designen_US
dc.titleBulk Data Dissemination in Wireless Sensor Networks: Analysis, Implications and Improvementen_US
dc.typeArticleen_US
dc.journal.volume65en_US
dc.journal.issue5en_US
dc.journal.titleIEEE Transactions on Computersen_US
Appears in Collections:2016

Files in This Item:
File Description SizeFormat 
7113818.pdf242.6 kBAdobe PDFThumbnail
Preview File
Full metadata record
DC FieldValueLanguage
dc.contributor.authorXiaolong Zhengen_US
dc.contributor.authorJiliang Wangen_US
dc.contributor.authorWei Dongen_US
dc.contributor.authorYuan Heen_US
dc.contributor.authorYunhao Liuen_US
dc.date.accessioned2020-05-20T08:56:10Z-
dc.date.available2020-05-20T08:56:10Z-
dc.date.issued2016en_US
dc.identifier.issn0018-9340en_US
dc.identifier.other10.1109/TC.2015.2435778en_US
dc.identifier.urihttp://localhost/handle/Hannan/178280en_US
dc.identifier.urihttp://localhost/handle/Hannan/600965-
dc.descriptionen_US
dc.description.abstractTo 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.en_US
dc.publisherIEEEen_US
dc.relation.haspart7113818.pdfen_US
dc.subjectbulk data dissemination|Wireless sensor networks|protocol designen_US
dc.titleBulk Data Dissemination in Wireless Sensor Networks: Analysis, Implications and Improvementen_US
dc.typeArticleen_US
dc.journal.volume65en_US
dc.journal.issue5en_US
dc.journal.titleIEEE Transactions on Computersen_US
Appears in Collections:2016

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