Citation

Tan, Su Wei (2015) Clonal-selection-based minimum-interference channel assignment algorithms for multiradio wireless mesh networks. In: Bio-Inspired Computation in Telecommunications. Elsevier, pp. 287-321. ISBN 978-0-12-801538-4

Full text not available from this repository.

Abstract

Multiradio wireless mesh networks use mesh routers with multiple radio interfaces to improve network capacity. The attainable network capacity is dependent on how various channels (i.e., frequency bands) are assigned to each radio interface to form a mesh network with minimum interference. The channel assignment must fulfill the constraints that the number of channels assigned to a router is at most the number of interfaces on the router, and the resultant mesh network remains connected. This is a nondeterministic polynomial-time hard (NP-hard) problem. In this chapter, we investigate artificial immune algorithms that use greedy channel assignment to obtain feasible solutions, and use the clonal selection principle to improve the solutions. For practical considerations, small population size and small number of generations are used. By considering different mutation operators and clonal selection algorithms, several variants are evaluated. Through extensive simulations, we show that our proposal outperforms a genetic algorithm, a graph-theoretic algorithm, and a Tabu-based algorithm proposed for the same problem. In addition, the variant developed based on B-cell algorithm (BCA) and using a simple random-swapping mutation operator performs the best.

Item Type:	Book Section
Additional Information:	Chapter 13 – Clonal-Selection-Based Minimum-Interference Channel Assignment Algorithms for Multiradio Wireless Mesh Networks
Subjects:	T Technology > TK Electrical engineering. Electronics Nuclear engineering
Divisions:	Faculty of Engineering (FOE)
Depositing User:	Ms Nurul Iqtiani Ahmad
Date Deposited:	23 Feb 2015 03:14
Last Modified:	23 Feb 2015 03:14
URII:	http://shdl.mmu.edu.my/id/eprint/5986

Downloads

Edit (login required)