We give an algorithm that, for a fixed graph H and integer k, decides whether an n-vertex Hminor-free graph G contains a path of length k in 2 √ k) · n steps. Our approach builds on a combination of Demaine-Hajiaghayi’s bounds on the size of an excluded grid in such graphs with a novel combinatorial result on certain branch decompositions of H-minor-free graphs. This result is used to bound the...

In this paper we study through simulations the impact of PHY/MAC protocols on higher layers. In a comparative way, we investigate the effectiveness of some protocols when they coexist on a wireless mesh network environment. Results show that PHY/MAC parameters have an important impact on routing performances. Based on these results, we propose two traffic-aware routing metrics based on link ava...

A paradox of dynamic routing in the Cohen-Kelly network is studied. Intuitively, we expect that adding capacity to a network improves the performance of the users. Braess showed an example wherein the opposite occurs. We refer to such a situation as a paradox. In this paper, we deal with a class of queueing networks in which Cohen and Kelly discovered a paradox in static routing. We consider th...

In this paper, we compare the Dynamic Source Routing (DSR) protocol and our Energy Aware Dynamic Source Routing protocol (EADSR). The implementation of the routing protocols is carried out using the Click modular router infrastructure on laptops with wireless ethernet cards running Linux. We demonstrate the working of both ad hoc routing protocols through our experiments and highlight the energ...