A Joint Clustering and Routing Algorithm based on GA for Multi Objective Optimization in WSN

2020 ◽  
Author(s):  
Marwa Fattoum ◽  
Zakia Jellali ◽  
Leila Najjar Atallah
Keyword(s):  
Routing Algorithm ◽  
Multi Objective Optimization ◽  
Multi Objective

Research on Optimal Routing Algorithm for Public Transit Transfer Based on the Adjacency Matrix

2010 ◽  
Vol 40-41 ◽  
pp. 341-346
Author(s):  
Cai Xia Zhang ◽  
Liang Liang Zhuang ◽  
Xiang Dong Wang ◽  
Hai Wu Rong
Keyword(s):  
Data Processing ◽  
Adjacency Matrix ◽  
Public Transit ◽  
Routing Algorithm ◽  
Optimal Routing ◽  
Optimal Route ◽  
Multi Objective Optimization ◽  
Multi Objective

This paper introduces the Adjacency Matrix at the very beginning, the least transfer between two nodes can be obtained by using the Adjacency Matrix, and then Z matrix is introduced to achieve optimal routing algorithm for public transit transfer and to obtain optimal route by using the “two-step-descending-proliferation” algorithm. Through the "two-step" approach, efficiency and feasibility of data processing was increased. The algorithm focus on multi-objective optimization - takes the least transfer, the least cost, the shortest time, and so on.

scholarly journals QoS Routing in Ad-Hoc Networks Using GA and Multi-Objective Optimization

2011 ◽  
Vol 7 (3) ◽  
pp. 169-188 ◽  
Author(s):  
Admir Barolli ◽  
Evjola Spaho ◽  
Leonard Barolli ◽  
Fatos Xhafa ◽  
Makoto Takizawa
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc ◽  
Heuristic Algorithms ◽  
Routing Algorithm ◽  
Genetic Load ◽  
Search Space ◽  
Qos Routing ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Hoc Networks

Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).

Sign in / Sign up

Export Citation Format

Share Document