Please use this identifier to cite or link to this item: http://localhost/handle/Hannan/232554
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHongyu Gongen_US
dc.contributor.authorLuoyi Fuen_US
dc.contributor.authorXinzhe Fuen_US
dc.contributor.authorLutian Zhaoen_US
dc.contributor.authorKainan Wangen_US
dc.contributor.authorXinbing Wangen_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-04-06T08:42:11Z-
dc.date.available2020-04-06T08:42:11Z-
dc.date.issued2017en_US
dc.identifier.other10.1109/TIT.2016.2623317en_US
dc.identifier.urihttp://localhost/handle/Hannan/232554-
dc.description.abstractMulticast tree is a key structure for data dissemination from one source to multiple receivers in wireless networks. Minimum length multica modeled as the Steiner tree problem, and is proven to be NP-hard. In this paper, we explore how to efficiently generate minimum length multi wireless sensor networks (WSNs), where only limited knowledge of network topology is available at each node. We design and analyze a simple algorithm, which we call toward source tree (TST), to build multicast trees in WSNs. We show three metrics of TST algorithm, i.e., running and energy efficiency. We prove that its running time is O(&x221A;(n log n)), the best among all existing solutions to our best knowledge. We prove that TST tree length is in the same order as Steiner tree, which give a theoretical upper bound and use simulations to show the ratio be only 1.114 when nodes are uniformly distributed. We evaluate energy efficiency in terms of message complexity and the number of forwarding prove that they are both order-optimal. We give an efficient way to construct multicast tree in support of transmission of voluminous data.en_US
dc.format.extent280,en_US
dc.format.extent296en_US
dc.publisherIEEEen_US
dc.relation.haspart7725956.pdfen_US
dc.titleDistributed Multicast Tree Construction in Wireless Sensor Networksen_US
dc.typeArticleen_US
dc.journal.volume63en_US
dc.journal.issue1en_US
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7725956.pdf1.24 MBAdobe PDF
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHongyu Gongen_US
dc.contributor.authorLuoyi Fuen_US
dc.contributor.authorXinzhe Fuen_US
dc.contributor.authorLutian Zhaoen_US
dc.contributor.authorKainan Wangen_US
dc.contributor.authorXinbing Wangen_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-04-06T08:42:11Z-
dc.date.available2020-04-06T08:42:11Z-
dc.date.issued2017en_US
dc.identifier.other10.1109/TIT.2016.2623317en_US
dc.identifier.urihttp://localhost/handle/Hannan/232554-
dc.description.abstractMulticast tree is a key structure for data dissemination from one source to multiple receivers in wireless networks. Minimum length multica modeled as the Steiner tree problem, and is proven to be NP-hard. In this paper, we explore how to efficiently generate minimum length multi wireless sensor networks (WSNs), where only limited knowledge of network topology is available at each node. We design and analyze a simple algorithm, which we call toward source tree (TST), to build multicast trees in WSNs. We show three metrics of TST algorithm, i.e., running and energy efficiency. We prove that its running time is O(&x221A;(n log n)), the best among all existing solutions to our best knowledge. We prove that TST tree length is in the same order as Steiner tree, which give a theoretical upper bound and use simulations to show the ratio be only 1.114 when nodes are uniformly distributed. We evaluate energy efficiency in terms of message complexity and the number of forwarding prove that they are both order-optimal. We give an efficient way to construct multicast tree in support of transmission of voluminous data.en_US
dc.format.extent280,en_US
dc.format.extent296en_US
dc.publisherIEEEen_US
dc.relation.haspart7725956.pdfen_US
dc.titleDistributed Multicast Tree Construction in Wireless Sensor Networksen_US
dc.typeArticleen_US
dc.journal.volume63en_US
dc.journal.issue1en_US
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7725956.pdf1.24 MBAdobe PDF
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHongyu Gongen_US
dc.contributor.authorLuoyi Fuen_US
dc.contributor.authorXinzhe Fuen_US
dc.contributor.authorLutian Zhaoen_US
dc.contributor.authorKainan Wangen_US
dc.contributor.authorXinbing Wangen_US
dc.date.accessioned2013en_US
dc.date.accessioned2020-04-06T08:42:11Z-
dc.date.available2020-04-06T08:42:11Z-
dc.date.issued2017en_US
dc.identifier.other10.1109/TIT.2016.2623317en_US
dc.identifier.urihttp://localhost/handle/Hannan/232554-
dc.description.abstractMulticast tree is a key structure for data dissemination from one source to multiple receivers in wireless networks. Minimum length multica modeled as the Steiner tree problem, and is proven to be NP-hard. In this paper, we explore how to efficiently generate minimum length multi wireless sensor networks (WSNs), where only limited knowledge of network topology is available at each node. We design and analyze a simple algorithm, which we call toward source tree (TST), to build multicast trees in WSNs. We show three metrics of TST algorithm, i.e., running and energy efficiency. We prove that its running time is O(&x221A;(n log n)), the best among all existing solutions to our best knowledge. We prove that TST tree length is in the same order as Steiner tree, which give a theoretical upper bound and use simulations to show the ratio be only 1.114 when nodes are uniformly distributed. We evaluate energy efficiency in terms of message complexity and the number of forwarding prove that they are both order-optimal. We give an efficient way to construct multicast tree in support of transmission of voluminous data.en_US
dc.format.extent280,en_US
dc.format.extent296en_US
dc.publisherIEEEen_US
dc.relation.haspart7725956.pdfen_US
dc.titleDistributed Multicast Tree Construction in Wireless Sensor Networksen_US
dc.typeArticleen_US
dc.journal.volume63en_US
dc.journal.issue1en_US
Appears in Collections:2017

Files in This Item:
File SizeFormat 
7725956.pdf1.24 MBAdobe PDF