Routing in a delay tolerant network, Proc. ACM SIGCOMM, pp.145-157, 2004. ,
Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case, IEEE/ACM Transactions on Networking, vol.16, issue.1, pp.77-90, 2008. ,
DOI : 10.1109/TNET.2007.897964
Virtual data mules for data collection in road-side sensor networks, Proceedings of the Second International Workshop on Mobile Opportunistic Networking, MobiOpp '10, pp.32-40, 2010. ,
DOI : 10.1145/1755743.1755750
URL : https://hal.archives-ouvertes.fr/inria-00490054
On models and algorithms for dynamic communication networks: the case for evolving graphs, Proc. ALGOTEL, 2002. ,
Routing in space and time in networks with predictable mobility, Georgia Institute of Technology, 2004. ,
Optimal routing and scheduling for deterministic delay tolerant networks, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services, 2009. ,
DOI : 10.1109/WONS.2009.4801844
Data MULEs: Modeling and analysis of a three-tier system for sparse sensor networks, Ad Hoc Networks, pp.215-233, 2003. ,
VADD: Vehicle-Assisted Data Delivery in Vehicular Ad Hoc Networks, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pp.1910-1922, 2008. ,
DOI : 10.1109/INFOCOM.2006.298
Stochastic and dynamic networks and routing, Handbooks in Operations Research and Management Science, pp.141-295, 1995. ,
Capacity regions for wireless ad hoc networks, IEEE Trans. Wireless Commun, vol.2, issue.4, pp.736-748, 2003. ,
Constructing Maximal Dynamic Flows from Static Flows, Operations Research, vol.6, issue.3, pp.419-433, 1958. ,
DOI : 10.1287/opre.6.3.419
An introduction to network flows over time Springer Research Trends in Combinatorial Optimization, pp.451-482, 2009. ,
Building a reference combinatorial model for MANETs, IEEE Network, vol.18, issue.5, pp.24-29, 2004. ,
DOI : 10.1109/MNET.2004.1337732
A forward network simplex algorithm for solving multiperiod network flow problems, Naval Research Logistics Quarterly, vol.15, issue.3, pp.445-467, 1986. ,
DOI : 10.1002/nav.3800330310
The Quickest Transshipment Problem, Proc. Annual ACM-SIAM Symp. on Discrete Algorithms, pp.512-521, 1995. ,
DOI : 10.1287/moor.25.1.36.15211
Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities, Networks, vol.33, issue.4, pp.303-318, 1988. ,
DOI : 10.1002/net.3230180405
Complexity of minimum spanning tree in evolving graphs and the minimum-energy broadcast routing problem, Proc. WiOpt, 2004. ,
Delay tolerant bulk data transfers on the internet, Proc. ACM Sigmetrics, pp.229-238, 2009. ,
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks, IEEE Transactions on Automatic Control, vol.37, issue.12, pp.1936-1948, 1992. ,
DOI : 10.1109/9.182479
Feasible Rate Allocation in Wireless Networks, IEEE INFOCOM 2008, The 27th Conference on Computer Communications, 2008. ,
DOI : 10.1109/INFOCOM.2008.153
Rate control for communication networks: shadow prices, proportional fairness and stability, Journal of the Operational Research Society, vol.49, issue.3, pp.237-252, 1998. ,
DOI : 10.1057/palgrave.jors.2600523
Mathematical decomposition techniques for distributed cross-layer optimization of data networks, IEEE Journal on Selected Areas in Communications, vol.24, issue.8, pp.1535-1547, 2006. ,
DOI : 10.1109/JSAC.2006.879364
Scheduling broadcasts in multihop radio networks, IEEE Transactions on Communications, vol.38, issue.4, pp.456-460, 1990. ,
DOI : 10.1109/26.52656