2,266 research outputs found
A genetic-inspired joint multicast routing and channel assignment algorithm in wireless mesh networks
Copyright @ 2008 IEEEThis paper proposes a genetic algorithm (GA) based optimization approach to search a minimum-interference multicast tree which satis¯es the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. The path-oriented en- coding method is used and each chromosome 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. Crossover and mutation are well designed to adapt to the tree structure. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed GA based multicast algorithm achieves better performance in terms of both the total channel conflict and the tree cost than that of a well known algorithm
Joint QoS multicast routing and channel assignment in multiradio multichannel wireless mesh networks using intelligent computational methods
Copyright @ 2010 Elsevier B.V. All rights reserved.In this paper, the quality of service multicast routing and channel assignment (QoS-MRCA) problem is investigated. It is proved to be a NP-hard problem. Previous work separates the multicast tree construction from the channel assignment. Therefore they bear severe drawback, that is, channel assignment cannot work well with the determined multicast tree. In this paper, we integrate them together and solve it by intelligent computational methods. First, we develop a unified framework which consists of the problem formulation, the solution representation, the fitness function, and the channel assignment algorithm. Then, we propose three separate algorithms based on three representative intelligent computational methods (i.e., genetic algorithm, simulated annealing, and tabu search). These three algorithms aim to search minimum-interference multicast trees which also satisfy the end-to-end delay constraint and optimize the usage of the scarce radio network resource in wireless mesh networks. To achieve this goal, the optimization techniques based on state of the art genetic algorithm and the techniques to control the annealing process and the tabu search procedure are well developed separately. Simulation results show that the proposed three intelligent computational methods based multicast algorithms all achieve better performance in terms of both the total channel conflict and the tree cost than those comparative references.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1
Near Optimal Channel Assignment for Interference Mitigation in Wireless Mesh Networks
In multi-radio multi-channel (MRMC) WMNs, interference alleviation is
affected through several network design techniques e.g., channel assignment
(CA), link scheduling, routing etc., intelligent CA schemes being the most
effective tool for interference mitigation. CA in WMNs is an NP-Hard problem,
and makes optimality a desired yet elusive goal in real-time deployments which
are characterized by fast transmission and switching times and minimal
end-to-end latency. The trade-off between optimal performance and minimal
response times is often achieved through CA schemes that employ heuristics to
propose efficient solutions. WMN configuration and physical layout are also
crucial factors which decide network performance, and it has been demonstrated
in numerous research works that rectangular/square grid WMNs outperform random
or unplanned WMN deployments in terms of network capacity, latency, and network
resilience. In this work, we propose a smart heuristic approach to devise a
near-optimal CA algorithm for grid WMNs (NOCAG). We demonstrate the efficacy of
NOCAG by evaluating its performance against the minimal-interference CA
generated through a rudimentary brute-force technique (BFCA), for the same WMN
configuration. We assess its ability to mitigate interference both,
theoretically (through interference estimation metrics) and experimentally (by
running rigorous simulations in NS-3). We demonstrate that the performance of
NOCAG is almost as good as the BFCA, at a minimal computational overhead of
O(n) compared to the exponential of BFCA
Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using tabu search
Copyright @ 2009 IEEE Computer SocietyThis 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.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1
Joint multicast routing and channel assignment in multiradio multichannel wireless mesh networks using simulated annealing
This is the post-print version of the article - Copyright @ 2008 Springer-VerlagThis paper proposes a simulated annealing (SA) algorithm 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. In the proposed SA multicast algorithm, 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 anticipate 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 annealing process are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed SA based 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.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1
- …