Section: New Results
Data motion in networks
Participants : Stéphane Grumbach, Zhilin Wu.
We considered motion planning on directed graphs , a problem related to data motion in a network with constrained node capacity and unidirectional links, which is an abstraction of the structure of wireless sensor networks. We proposed two algorithms for solving feasibility of motion planning on acyclic and strongly connected directed graphs respectively  ,  , thus extending results by Papadimitriou et al. on undirected graphs  .