An optimal algorithm for small group multicast in wireless sensor networks Online publication date: Mon, 02-Jul-2018
by Weizhong Luo; Jianxin Wang; Zhaoquan Cai; Gang Peng; Jiong Guo; Shigeng Zhang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 28, No. 3, 2018
Abstract: We propose an optimal algorithm to construct a delay-bounded minimum energy routing tree for multicast in wireless sensor networks. Finding the minimum energy multicast tree with constrained delay has been proved to be a NP-hard problem. Existing works mainly focus on developing approximation or heuristic algorithms to find approximate solutions. We formally define the Min-power h-Multicast problem - to find a minimum energy multicast tree in which the path from the source to every destination node is less than h hops - and translate it into a minimum Steiner tree problem. We then develop a dynamic programming algorithm to get an optimal solution to the problem with a running time that is exponential exclusively with respect to the size of the multicast group. Simulation results show that, compared with existing algorithms, our algorithm saves energy consumption by factors between 19% and 42% with comparable running time for small group multicast.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook