TY - STD TI - Ambuehl C (2005) An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Proceedings of 32th ICALP, pp 1139–1150 ID - ref1 ER - TY - STD TI - Andersen FU, Berndt H, Abramowicz H, Tafazolli R (2007) Future internet from mobile and wireless requirements perspective. http://www.emobility.eu.org/ UR - http://www.emobility.eu.org/ ID - ref2 ER - TY - STD TI - Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press ID - ref3 ER - TY - JOUR AU - Bui-Xuan, B. AU - Ferreira, A. AU - Jarry, A. PY - 2003 DA - 2003// TI - Computing shortest, fastest, and foremost journeys in dynamic networks JO - Int J Found Comput Sci VL - 14 ID - Bui-Xuan2003 ER - TY - JOUR AU - Chu, Y. J. AU - Liu, T. H. PY - 1965 DA - 1965// TI - On the shortest arborescence of a directed graph JO - Sci Sin VL - 14 ID - Chu1965 ER - TY - STD TI - Cormen T, Leiserson C, Rivest R (1990) Introduction to algorithms. The MIT Press, Boston ID - ref6 ER - TY - JOUR AU - Dreyfus, S. E. PY - 1969 DA - 1969// TI - An appraisal of Some Shortest-Path Algorithms JO - Oper Res VL - 17 UR - https://doi.org/10.1287/opre.17.3.395 DO - 10.1287/opre.17.3.395 ID - Dreyfus1969 ER - TY - STD TI - Ekici E, Akyildiz IF, Bender MD (2000) Datagram routing algorithm for LEO satellite networks. In: IEEE Infocom, pp 500–508 ID - ref8 ER - TY - STD TI - Faragó A, Syrotiuk VR (2001) MERIT: a unified framework for routing protocol assessment in mobile ad hoc networks. In: Proceedings of ACM Mobicom 01, pp 53–60, ACM ID - ref9 ER - TY - STD TI - Ferreira A, Galtier J, Penna P (2002) Topological design, routing and handover in satellite networks. In: Stojmenovic I (ed) Handbook of wireless networks and mobile computing, pp 473–493. Wiley, New York ID - ref10 ER - TY - JOUR AU - Ford, L. R. AU - Fulkerson, D. R. PY - 1958 DA - 1958// TI - Constructing maximal dynamic flows from static flows JO - Oper Res VL - 6 UR - https://doi.org/10.1287/opre.6.3.419 DO - 10.1287/opre.6.3.419 ID - Ford1958 ER - TY - JOUR AU - Halpern, J. PY - 1977 DA - 1977// TI - Shortest route with time dependent length of edges and limited delay possibilities in nodes JO - Zeitschrift für Oper Res VL - 21 ID - Halpern1977 ER - TY - JOUR AU - Halpern, J. AU - Priess, I. PY - 1974 DA - 1974// TI - Shortest path with time constraints on movement and parking JO - Networks VL - 4 UR - https://doi.org/10.1002/net.3230040304 DO - 10.1002/net.3230040304 ID - Halpern1974 ER - TY - JOUR AU - Humblet, P. A. PY - 1983 DA - 1983// TI - A distributed algorithm for minimum weight directed spanning trees JO - IEEE Trans Commun COM VL - -31 ID - Humblet1983 ER - TY - JOUR AU - Issarny, V. AU - Georgantas, N. AU - Hachem, S. AU - Zarras, A. AU - Vassiliadis, P. AU - Autili, M. AU - Gerosa, M. A. AU - Ben Hamida, A. PY - 2011 DA - 2011// TI - Service-oriented middleware for the future Internet: state of the art and research directions JO - J Internet Serv Appl VL - 2 UR - https://doi.org/10.1007/s13174-011-0021-3 DO - 10.1007/s13174-011-0021-3 ID - Issarny2011 ER - TY - STD TI - Köhler E, Langkau K, Skutella M (2002) Time-expanded graphs for flow-dependent transit times. In: Proceedings of ESA’02 ID - ref16 ER - TY - STD TI - Köhler E, Skutella M (2002) Flows over time with load-dependent transit times. In: Proceedings of the 13th annual ACM-SIAM symposium on discrete algorithms, pp 174–183 ID - ref17 ER - TY - STD TI - Scheideler C (2002) Models and techniques for communication in dynamic networks. In: Alt H, Ferreira A (eds) Proceedings of the 19th international symposium on theoretical aspects of computer science, vol 2285. Springer, pp 27–49, March 2002 ID - ref18 ER - TY - STD TI - Stojmenovic I (ed) (2002) Handbook of wireless networks and mobile computing. Wiley, New York ID - ref19 ER - TY - STD TI - Syrotiuk V, Colbourn CJ (2003) Routing in mobile aerial networks. In: Proceedings of WiOpt’03—modeling and optimization in mobile, ad-hoc and wireless networks, pp 293–302, INRIA, Sophia Antipolis, March 2003 ID - ref20 ER - TY - JOUR AU - Tarjan, R. E. PY - 1977 DA - 1977// TI - Finding optimum branchings JO - Networks VL - 7 ID - Tarjan1977 ER - TY - STD TI - Wieselthier J, Nguyen G, Ephremides A (2000) On the construction of energy-efficient broadcast and multicast trees in wireless networks. In: Proceedings of IEEE Infocom, pp 585–594, Tel Aviv, 2000 ID - ref22 ER -