Optimal and heuristic algorithms for constructing interference-free multicast trees subject to delay and energy constraints on wireless mesh networks Online publication date: Thu, 23-Jun-2016
by Wen-Lin Yang
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 22, No. 2, 2016
Abstract: Due to the great concerns of environmental protection and the high rising of prices in oil, energy efficiency has become an important factor for designing network applications. In this paper, we study an optimisation problem which is concerned about how to construct an interference free multicast tree subject to delay and energy constraints on a multi-channel multi-radio wireless mesh network. Our objective is to maximise the number of mesh clients that can be included in the multicast tree. This problem is referred as the EDMRM problem. To solve it, we first propose an optimal algorithm on the basis of integer linear programming (ILP) for the EDMRM problem. Since the ILP-based method is only feasible for small-scale networks, we also provide a tabu-based heuristic algorithm for solving practical networks that consist of a large number of nodes. The experimental results show that our tabu-based heuristic can outperform the other previously proposed methods.
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