Short and Robust Communication Paths in Dynamic Wireless Networks
The authors consider the problem of finding and maintaining communication paths in wireless Mobile Ad hoc NETworks (MANET). They consider this problem as a bi-objective problem when trying to minimize both the length of the constructed paths and the number link reconnections. They propose two centralized algorithms that help analyze the problem from a dynamic graph point of view. These algorithms give lower bounds for their proposed decentralized ant-based algorithm that constructs and maintains such paths in a MANET.