Traps and pitfalls of using contact traces in performance studies of opportunistic networks, 2012 Proceedings IEEE INFOCOM, pp.1377-1385, 2012. ,
DOI : 10.1109/INFCOM.2012.6195502
Trace-based performance analysis of opportunistic forwarding under imperfect node cooperation, 2012 Proceedings IEEE INFOCOM, pp.2651-2655, 2012. ,
DOI : 10.1109/INFCOM.2012.6195672
Performance evaluation of routing protocols for manets with known connectivity patterns using evolving graphs Wireless Networks, pp.627-640, 2010. ,
A tool for obtaining information on DTN traces, 4th Extreme Conference on Communication, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00742993
A linear programming formulation of flows over time with piecewise constant capacity and transit times, 2003. ,
Routing in a delay tolerant network, ACM SIGCOMM Computer Communication Review, vol.34, issue.4, pp.145-158, 2004. ,
DOI : 10.1145/1030194.1015484
Review and analysis of citations, Proceedings of 8th Experimental Software Engineering Latin American Workshop, p.9, 2011. ,
Optimal routing and scheduling for deterministic delay tolerant networks, 2009 Sixth International Conference on Wireless On-Demand Network Systems and Services, pp.27-34, 2009. ,
DOI : 10.1109/WONS.2009.4801844
Optimal Content Downloading in Vehicular Networks, IEEE Transactions on Mobile Computing, vol.12, issue.7, pp.1377-1391, 2013. ,
DOI : 10.1109/TMC.2012.115
URL : https://hal.archives-ouvertes.fr/hal-00741122
Network Flows: theory, algorithms, and applications, 1993. ,
The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, vol.2, issue.2, pp.169-197, 1981. ,
DOI : 10.1007/BF02579273