Minimum-cost gateway placement in wireless mesh networks with QoS constraints Online publication date: Mon, 10-May-2010
by Zhigang Chen, Feng Zeng
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 4, No. 4, 2010
Abstract: In wireless mesh networks (WMNs), gateway optimal placement is key to network performance, QoS and construction cost. This paper focuses on gateway placement with QoS constraints in WMNs, and aims to minimise the cost of gateway placement. Firstly, a new concept of limited dominating set (LDS) in graph is presented to address the minimum-cost gateway placement problem, which is converted to find the minimum weighted LDS in a graph. Secondly, we propose a heuristic algorithm WMB-LDS to find the minimum weighted LDS for a graph, which takes the performance/cost ratio of gateway candidates as heuristic information. Furthermore, we design a genetic algorithm GA-LDS to search for the global optimal solution. At last, simulation is done, and the experimental results show that, compared with previous work, WMB-LDS has better performance and lower computing complexity, and GA-LDS has the best experiment result at the price of the increasing computing complexity.
Online publication date: Mon, 10-May-2010
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 Communication Networks and Distributed Systems (IJCNDS):
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 email@example.com