In this paper, we focus on the scheme for the route optimization in 6LoWPAN based MANEMO environments. If 6LoWPAN mobile routers for supporting NEMO protocol are organized by neste...
The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path wi...
Zhanfeng Jia, Rajarshi Gupta, Jean C. Walrand, Pra...
We deepen the theoretical analysis of the genetic algorithm for the all-pairs shortest path problem proposed by Doerr, Happ and Klein (GECCO 2008). We show that the growth of the ...
We study the combinatorial properties of optimal refueling policies, which specify the transportation paths and the refueling operations along the paths to minimize the total trans...
Abstract— This paper revisits the multi-robot boundary coverage problem in which a group of k robots must inspect every point on the boundary of a 2-dimensional environment. We f...