Created by W.Langdon from gp-bibliography.bib Revision:1.8051
Efficient communication protocols are very important for providing good services, but in ad hoc networks is very challenging. It is necessary to deal with packet loss, collisions, mobility, network partitions, fading, energy constraints, obstacles, etc. Due to the intrinsic broadcast nature of wireless medium, dissemination algorithms are one of the most appropriate protocols for communicating devices. Additionally, broadcasting is one of the main low level operation as many applications and even other protocols rely on its service.
Therefore, in this thesis, we are proposing two different broadcasting algorithms for efficiently disseminate messages in the network. The first approach relays on an underlying tree topology, while the second is an energy aware algorithm that tries to reduce the energy consumption. In these unpredictable and changeable networks, protocols need to adapt to the current circumstances and this adaptability is usually obtained using thresholds. The values of these thresholds directly influence the behaviour of the algorithm. Finding them is a complex and critical task as protocols are usually very sensitive. We tackle this problem using approximation algorithms or metaheuristics, more specifically, we use a parallel iterative local search and two evolutionary algorithms. In order to ease this process, we have created a modular experimental framework for evaluating, validating and optimising any algorithm in MANETs.",
Language : English
supervisor Dr. Pascal Bouvry",
Genetic Programming entries for Gracia Patricia Ruiz Villalobos