Short and Robust Communication Paths in Dynamic Wireless Networks

Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when trying to minimize both the length of the constructed paths and the number link reconnections. We propose two centralized algorithms that help analyse the problem from a dynamic graph point of view. These algorithms give lower bounds for our proposed decentralized ant-based algorithm that constructs and maintains such paths in a MANET.

• Type: Journal
• Year: 2010
• Where: ANTSW
• Authors: Yoann Pigné, Frédéric Guinand
• Keywords: ANTSW 2010, Artificial Intelligence, Dynamic Graph Point, Mobile Ad Hoc Networks, Number Link Reconnections