A Distributed Algorithm to Construct Multicast Trees in WSNs: An Approximate Steiner Tree Approach

Multicast 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 mult 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( √ 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, give a theoretical upper bound and use simulations to show the

• Type: Journal
• Year: 2015
• Where: MOBIHOC
• Authors: Hongyu Gong, Lutian Zhao, Kainan Wang, Weijie Wu, Xinbing Wang
• Keywords: Computer Networks, MOBIHOC 2015