Brunel University Research Archive (BURA) >
University >
Publications >

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/5881

Title: Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using tabu search
Authors: Cheng, H
Yang, S
Keywords: Wireless mesh network
Multicast
Channel assignment
Tabu search
Publication Date: 2009
Publisher: IEEE Computer Society
Citation: 5th International Conference on Natural Computation, Washington, DC, USA, 4: 325 - 330, 2009
Abstract: This paper proposes a tabu search (TS) based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we expect the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the tabu search procedure are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed TS multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.
Description: Copyright @ 2009 IEEE Computer Society
Sponsorship: This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1.
URI: http://bura.brunel.ac.uk/handle/2438/5881
DOI: http://dx.doi.org/10.1109/ICNC.2009.435
ISBN: 978-0-7695-3736-8
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:

File Description SizeFormat
Fulltext.pdf824.09 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.