1. S. Bhadra and A. Ferreira. Computing Multicast Trees in Dynamic Networks and the Complexity of Connected Components in Evolving Graphs. Journal of Internet Services and Applications, 3(3):269-275, 2012.
   Abstract: Future Internet technologies and the deployment of mobile and nomadic services enable complex communications networks, that have a highly dynamic behavior. This naturally engenders route-discovery problems under changing conditions over these networks, but the temporal variations in the topology of dynamic networks are not effectively captured in a classical graph model. In this paper, we use evolving graphs, which help capture the dynamic characteristics of such networks, in order to compute multicast trees with minimum overall transmission time for a class of wireless mobile dynamic networks. We first show that computing different types of strongly connected components in evolving digraphs is NP-Hard, and then propose a polynomial-time algorithm to build all rooted directed Minimum Spanning Trees in strongly connected dynamic networks. These results open new avenues for the implementation of Internet spanning-tree based protocols over highly dynamic network infrastructures.
   

   @article{BF12,
   
    author = {Bhadra, S. and Ferreira, A.},
   
    title = {Computing Multicast Trees in Dynamic Networks and the Complexity of Connected Components in Evolving Graphs},
   
    journal = {Journal of Internet Services and Applications},
   
    volume = {3},
   
    number = {3},
   
    year = {2012},
   
    pages = {269-275},
   
    ee = {http://dx.doi.org/10.1007/s13174-012-0073-z},
   
    bibsource = {DBLP, http://dblp.uni-trier.de},
   
    abstract = {Future Internet technologies and the deployment of mobile and nomadic services enable complex communications networks, that have a highly dynamic behavior. This naturally engenders route-discovery problems under changing conditions over these networks, but the temporal variations in the topology of dynamic networks are not effectively captured in a classical graph model. In this paper, we use evolving graphs, which help capture the dynamic characteristics of such networks, in order to compute multicast trees with minimum overall transmission time for a class of wireless mobile dynamic networks. We first show that computing different types of strongly connected components in evolving digraphs is NP-Hard, and then propose a polynomial-time algorithm to build all rooted directed Minimum Spanning Trees in strongly connected dynamic networks. These results open new avenues for the implementation of Internet spanning-tree based protocols over highly dynamic network infrastructures.},
   
    
   }

2. A. Ferreira and A. Jarry. Minimum-Energy Broadcast Routing in Dynamic Wireless Networks. Journal of Green Engineering, 2(2):115--123, 2012.
   

   @article{FJ12,
   
    author = {Ferreira, A. and Jarry, A.},
   
    title = {Minimum-Energy Broadcast Routing in Dynamic Wireless Networks},
   
    journal = {Journal of Green Engineering},
   
    volume = {2},
   
    number = {2},
   
    year = {2012},
   
    pages = {115--123},
   
    
   }

1. A. Goldman, P. Floriano, and A. Ferreira. A tool for obtaining information on DTN traces. In Proceedings of the 4th Extreme Conference on Communication, Zurique, CH, 2012. (pdf)
   Abstract: The applications for dynamic networks are growing every day, and thus, so is the number of studies on them. An important part of such studies is the generation of results through simulation and comparison with other works. We implemented a tool to generate information on a given network trace, obtained by building its corresponding evolving graph. This information is useful to help researchers choose the most suitable trace for their work, to interpret the results correctly and to compare data from their work to the optimal results in the network. In this work, we present the implementation of the DTNTES tool which provides the aforementioned services and use the system to evaluate the DieselNet trace.
   

   @inproceedings{GPF12,
   
    author = { A. Goldman and P. Floriano and A. Ferreira },
   
    title = { A tool for obtaining information on DTN traces },
   
    booktitle = { Proceedings of the 4th Extreme Conference on Communication },
   
    year = {2012},
   
    address = {Zurique, CH},
   
    pdf = { extremecom2012.ee.ethz.ch/papers/12-extremecom2012-Floriano.pdf },
   
    abstract = {The applications for dynamic networks are growing every day, and thus, so is the number of studies on them. An
    important part of such studies is the generation of results
    through simulation and comparison with other works. We
    implemented a tool to generate information on a given network
    trace, obtained by building its corresponding evolving
    graph. This information is useful to help researchers choose
    the most suitable trace for their work, to interpret the results
    correctly and to compare data from their work to the
    optimal results in the network. In this work, we present
    the implementation of the DTNTES tool which provides the
    aforementioned services and use the system to evaluate the
    DieselNet trace.},
   
    
   }

BACK TO INDEX