Metaheuristics for Wireless Network Optimisation

Morgan, Mike and Grout, Vic (2007) Metaheuristics for Wireless Network Optimisation. In: UNSPECIFIED.


Download (163kB) | Preview


This paper introduces two new algorithms for the minimum connected dominating set (MCDS) problem with constraints applicable to wireless network design, based on simulated annealing and tabu search principles. Each algorithm is tested on a selection of random graphs and shown to produce significantly smaller connected dominating sets when compared to a number of established methods. The simulated annealing algorithm is found to favour large, sparse graphs while the tabu search heuristic prefers smaller dense instances. In conclusion, we consider the adaptation of these algorithms to hybrid techniques and comment on the possible use of hyper-heuristics.

Item Type: Conference or Workshop Item
Additional Information: Copyright © 2007 IEEE ' All Rights reserved. This paper was presented to the 3rd IARIA/IEEE Advanced International Conference on Telecommunications (AICT 2007) 13th -19th May 2007 in Mauritius. The proceedings were published by the IEEE and are available at material is posted here with permission of the IEEE and the author. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the products or services of Glyndwr University Wrexham. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
Keywords: wireless network design, minimum connected dominating set, simulated annealing, tabu search, metaheuristics
Divisions: ?? GlyndwrUniversity ??
Depositing User: ULCC Admin
Date Deposited: 05 Oct 2011 09:14
Last Modified: 11 Dec 2017 20:06

Actions (login required)

Edit Item Edit Item