Vinh Trong Le

Learn More
Genetic Algorithms (GA) provide an attractive approach to solving the challenging problem of dynamic routing and wavelength assignment (RWA) in optical Wavelength Division Multiplexing (WDM) networks, because they usually achieve a significantly low blocking probability. Available GA-based dynamic RWA algorithms were designed mainly for WDM networks with a(More)
In this paper, we consider the problem of survivable routing in dynamic WDM networks with single link failure model. Our work mainly concerns in how to dynamically determine a protection cycle (i.e., two link-disjoint paths between a node pair) to establish a dependable lightpath with backup paths sharing. This problem is identified as NP-complete, thus a(More)
In this paper, we study the dynamic survivable routing problem, both in optical networks without wavelength conversion and in optical networks with sparse wavelength conversion, and propose a novel hybrid algorithm for it based on the combination of mobile agents technique and genetic algorithms (GA). By keeping a suitable number of mobile agents in the(More)
This paper considers the problem of dynamic survivable routing in WDM networks with single link failure model. This work mainly concerns in how to dynamically determine a protection cycle (i.e., two link-disjoint paths between a node pair) to establish a dependable lightpath with backup paths sharing. The problem is identified as NP-complete, thus a(More)
In this paper, we consider the problem of designing an efficient topology in 3D Wireless Sensor Network (3D-WSN) that balances node energy consumption, improves efficiency of data transmission and prolongs network lifetime. 3D-WSN has attracted significant interests in recent years due to its applications in various disciplinary fields such as target(More)
In this paper, we study the challenging problem of optimizing gateway placement for throughput in Wireless Mesh Networks and propose a novel algorithm based on Particle Swarm Optimization (PSO) for it. By generating the locations of gateway randomly and independently, we calculate the fitness value of each scheme, and update them step by step with the best(More)
  • 1