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

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

Genetic algorithms with elitism-based immigrants for dynamic shortest path problem in mobile ad hoc networks

This article is posted here with permission from the IEEE - Copyright @ 2009 IEEEIn recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm optimization (PSO), etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile ad hoc network (MANET), wireless sensor network (WSN), etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, that is, the network topology changes over time due to energy conservation or node mobility. Therefore, the SP problem turns out to be a dynamic optimization problem (DOP) in MANETs. In this paper, we propose to use elitism-based immigrants GA (EIGA) to solve the dynamic SP problem in MANETs. We consider MANETs as target systems because they represent new generation wireless networks. The experimental results show that the EIGA can quickly adapt to the environmental changes (i.e., the network topology change) and produce good solutions after each change.This work was supported by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1

Multi-population genetic algorithms with immigrants scheme for dynamic shortest path routing problems in mobile ad hoc networks

Copyright @ Springer-Verlag Berlin Heidelberg 2010.The static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile ad hoc network (MANET), wireless mesh network, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, that is, the network topology changes over time due to energy conservation or node mobility. Therefore, the SP problem turns out to be a dynamic optimization problem in mobile wireless networks. In this paper, we propose to use multi-population GAs with immigrants scheme to solve the dynamic SP problem in MANETs which is the representative of new generation wireless networks. The experimental results show that the proposed GAs can quickly adapt to the environmental changes (i.e., the network topology change) and produce good solutions after each change.This work was supported by the Engineering and Physical Sciences Research Council(EPSRC) of UK under Grant EP/E060722/1

A multipopulation parallel genetic simulated annealing based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Copyright @ 2008 Elsevier B.V. All rights reserved.In this paper, we propose an integrated Quality of Service (QoS) routing algorithm for optical networks. Given a QoS multicast request and the delay interval specified by users, the proposed algorithm can find a flexible-QoS-based cost suboptimal routing tree. The algorithm first constructs the multicast tree based on the multipopulation parallel genetic simulated annealing algorithm, and then assigns wavelengths to the tree based on the wavelength graph. In the algorithm, routing and wavelength assignment are integrated into a single process. For routing, the objective is to find a cost suboptimal multicast tree. For wavelength assignment, the objective is to minimize the delay of the multicast tree, which is achieved by minimizing the number of wavelength conversion. Thus both the cost of multicast tree and the user QoS satisfaction degree can approach the optimal. Our algorithm also considers load balance. Simulation results show that the proposed algorithm is feasible and effective. We also discuss the practical realization mechanisms of the algorithm.This work was supported in part by the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant nos. 60673159 and 70671020, the National High-Tech Research and Development Plan of China under Grant no. 2006AA01Z214, Program for New Century Excellent Talents in University, and the Key Project of Chinese Ministry of Education under Grant no. 108040

Polycyclic aromatic hydrocarbons biodegradation using isolated strains under indigenous condition

The treatment and disposal of domestic sIudge is an expensive and environmentally sensitive problem. It is also a growing problem since sludge production will continue to increase as new wastewzter treatment plants are built due to population increase. The large volume of domestic sIudge produced had made it difficult for many countries including Malaysia to assure complete treatment of the sludge before discharging to the receiving environment. Domestic sludge contains diverse range of pollutants such as pathogen, inorganic and organic compounds. These pollutants are toxic, mutagenic or carcinogenic and may threaten human health. Iiilproper disposal and handling of sludge may pose serious impact to the environment especially on soil and water cycles. Previous studies on Malaysian domestic sludge only reported on bulk parameters and heavy metals. Thus, no study reported on organic micro pollutants, namely, polycylic aromatic hydrocarbons (PAHs). Their recalcitrance and persistence make them problematic environmental contaminants. Microbial degradation is considered to be the primary mechanism of PAHs removal from the environment. Much has been reported on biodegradation of PAHs in several countries but there is a lack of information quantitative on this subject in Malaysia. This study is carried out to understand the nature of domestic sludge and to provide a better understanding on the biodegradation processes of PAHs. The methodology of this study comprised field activities, laboratory work and mathematical modelling. Field activities involved sampling of domestic sludge from Kolej Mawar, Universiti Teknologi MARA, Shah Alam, Selangor. Laboratory activities include seven phases of experimental works. First phase is characterization study of domestic sludge based on bulk parameters, heavy metals and PAHs. Second phase is enrichment and purification of bacteria isolated from domestic sludge using single PAHs and mixed PAHs as growth substrate. This was followed by identification of bacteria using BIOLOG system. The fourth phase focussed on turbidity test to monitor growth rate of the isolated bacteria. Preliminary degradation study involves optimization of the process at different substrate concentration, bacteria concentration, pH and temperature. The optimum conditions established from optimization study were used in degradation study. In biodegradation study, two experimental conditions were performed. These conditions include using bacteria isolated from single PAHs as substrate and bacteria isolated from mixed PAHs. Protein and pH tests were done during degradation study. Final activity is mathematical modelling of the biodegradation process. In general results on bulk parameters are comparable to previous studies. Zinc was the main compound with a mean concentration of 11 96.4 mglkg. PAHs were also detected in all of the samples, with total concentration between 0.72 to 5.36 mglkg dry weight for six PAHs. In the examined samples, phenanthrene was the main compound with a mean concentration of 1.0567 mglkg. The results fiom purification studies of bacteria strains sucessfull isolated 13 bacteria strains fiom single PAH substrate while three bacteria were isolated from the mixed PAHs substrate. Based on bacteria growth rates, only six strains grown on single PAHs and three strains grown on mixed PAHs were used for further studies. Results from the optimization study of biodegradation indicated that maximum rate of PAHs removal occurred at 100 mg~-' of PAHs, 10% bacteria concentration, pH 7.0 and 30°C. The results showed that bacteria grown on lower ring of PAHs are not able to grow on higher ring of PAHs. As for example Micrococcus diversus grown on napthalene as sole carbon source was unable to degrade other PAHs like acenapthylene, acenapthene, fluorene, phenanthrene and antlracene. In the case of bacteria isolated from mixed PAHs, the results showed that most of the napthalene was degraded by isolated strains with the highest average degradation rate followed by acenapthylene, acenapthene, fluorene, phenanthrene and anthracene. 377$3(53867$.$$1�781.8�781�$0,1$+ D4ff + c\,cpda~ition trends were observed in the study could be attributed to the different subsr , i,lo\~ir 'Led during isolation process. Interaction through cometabolism and synergistic ocolq bacteria strains isolated from single substrate. Thus, only synergistic interaction was oL, :a 77ed for bacteria isolated from mixed substrate. Corynebacterium urolyticum re\e;;ed I,, be the best strain in degrading PAHs. The experimental results have led to a model conccl~t desclibing I'AHs degradation

QoS multicast tree construction in IP/DWDM optical internet by bio-inspired algorithms

Copyright @ Elsevier Ltd. All rights reserved.In this paper, two bio-inspired Quality of Service (QoS) multicast algorithms are proposed in IP over dense wavelength division multiplexing (DWDM) optical Internet. Given a QoS multicast request and the delay interval required by the application, both algorithms are able to find a flexible QoS-based cost suboptimal routing tree. They first construct the multicast trees based on ant colony optimization and artificial immune algorithm, respectively. Then a dedicated wavelength assignment algorithm is proposed to assign wavelengths to the trees aiming to minimize the delay of the wavelength conversion. In both algorithms, multicast routing and wavelength assignment are integrated into a single process. Therefore, they can find the multicast trees on which the least wavelength conversion delay is achieved. Load balance is also considered in both algorithms. Simulation results show that these two bio-inspired algorithms can construct high performance QoS routing trees for multicast applications in IP/DWDM optical Internet.This work was supported in part ny the Program for New Century Excellent Talents in University, the Engineering and Physical Sciences Research Council (EPSRC) of UK under Grant EP/E060722/1, the National Natural Science Foundation of China under Grant no. 60673159 and 70671020, the National High-Tech Reasearch and Development Plan of China under Grant no. 2007AA041201, and the Specialized Research Fund for the Doctoral Program of Higher Education under Grant no. 20070145017