580 California St., Suite 400
San Francisco, CA, 94104
Key research themes
1. How can multi-parameter QoS-aware gateway selection enhance overall network performance in MANET-Internet integration?
This research area focuses on selecting Internet gateways in Mobile Ad Hoc Networks (MANETs) based on multiple Quality of Service (QoS) path parameters rather than single metrics. It is crucial because effective gateway selection directly impacts throughput, end-to-end delay, packet delivery ratio, and energy consumption in hybrid networks. Combining parameters such as path availability, residual load capacity, latency, and link quality leads to gateway selection schemes that adapt dynamically to network conditions, ensuring improved overall network performance.
Key finding: Proposed a gateway selection algorithm that integrates multiple QoS parameters—path availability period, available capacity, and latency—alongside a dynamic feedback system for path condition updates, resulting in improved... Read more
Key finding: Introduced a hybrid gateway discovery and selection scheme where gateways broadcast advertisements reactively with TTL based on their distance to requesting nodes. This method reduces routing overhead and enables nodes to... Read more
Key finding: Reviewed a broad spectrum of gateway selection parameters employed in the literature, including hop count, path quality (link capacity, queue length), load balancing (interface queue size), mobility (mobility tracing value),... Read more
Key finding: Developed an adaptive gateway discovery algorithm that dynamically tunes the scope (TTL) of gateway advertisement messages according to network traffic patterns to minimize overhead and maintain effective connectivity.... Read more
2. What metaheuristic and optimization techniques best address the routing and gateway selection problem in heterogeneous networks?
This theme examines the application and comparative performance of metaheuristic algorithms such as genetic algorithms, ant colony optimization (ACO), particle swarm optimization (PSO), and heuristic routing decision systems (RDS) in solving complex routing and gateway selection problems. Given the NP-hard nature of optimal gateway placement and multi-constraint routing, these approaches provide flexible frameworks to optimize objectives like throughput, latency, energy consumption, and load balancing in networks featuring multiple metrics and constraints.
Key finding: Developed a genetic algorithm (GA) designed to find shortest paths in network routing, comparable in performance to Dijkstra's algorithm. The GA uses evolutionary principles to optimize routes by minimizing path cost,... Read more
Key finding: Presented a novel hybrid algorithm combining Ant Colony Optimization (ACO) with Particle Swarm Optimization (PSO) to optimize gateway placement focused on maximizing network throughput in Wireless Mesh Networks. The approach... Read more
Key finding: Introduced a routing decision system (RDS) utilizing multiple preference functions to solve multi-constraint optimization problems (MCOP) in routing, combining traffic-oriented and resource-oriented metrics. The associated... Read more
Key finding: Proposed a structured methodology for the rigorous implementation and evaluation of metaheuristic algorithms solving routing problems, emphasizing standardization in experiment design, parameter tuning, and statistical... Read more
3. How do shortest-path and multi-criteria decision-making algorithms integrate for robust and context-aware optimal route selection in gateway selection?
This area investigates enhancing gateway selection and routing by combining classical shortest-path algorithms (like Dijkstra’s) with Multi-Criteria Decision-Making (MCDM) methods. Incorporating multiple decision parameters such as cost, congestion, risk, and priority weights enables sophisticated and context-aware route optimization. This approach is fundamental for logistics, MANETs, and hybrid networks requiring adaptive and balanced gateway routing that accounts for varying metric priorities and dynamic network states.
Key finding: Combined Dijkstra's shortest path algorithm with vector normalization-based Multi-Criteria Decision-Making (MCDM) to select optimal routes considering multiple parameters including cost, distance, congestion, and risk... Read more
Key finding: Provided an overview of routing algorithms focusing on shortest path methods such as Dijkstra’s and their extensions for quality of service (QoS) optimization. Emphasized that while shortest path routing is efficient, it... Read more
Key finding: Analyzed different genetic algorithm selection schemes integrated with shortest path computations to identify optimal and reliable wired network routing. Results indicated that incorporating evolutionary selection mechanisms... Read more
Key finding: Implemented an agent-based routing approach combining various optimization metaheuristics including ants, bees, genetic algorithms, particle swarm optimization, and hybrids (e.g., Ant-PSO). Simulations using NS2 demonstrated... Read more