DTN routing as a resource allocation problem

Computer Communication Review

Volumn 37, Issue 4, 2007, Pages 373-384

  Balasubramanian, Aruna ^a   Levine, Brian Neil ^a   Venkataramani, Arun ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Deployment; DTN; Mobility; Routing; Utility

Indexed keywords

DEPLOYMENT; DISRUPTION TOLERANT NETWORKS; DTN; OPTIMAL PERFORMANCE; PACKET REPLICATIONS; RESOURCE ALLOCATION PROBLEM; ROUTING; UTILITY;

CARRIER MOBILITY; MAXIMUM LIKELIHOOD; OPTIMIZATION; RESOURCE ALLOCATION; ROUTING PROTOCOLS;

DELAY TOLERANT NETWORKS;

EID: 77955417778     PISSN: 01464833     EISSN: 19435819     Source Type: Conference Proceeding    
DOI: 10.1145/1282427.1282422     Document Type: Article

References (37)

1. One laptop per child. http://www.laptop.org.
2. TIER Project, UC Berkeley. http://tier.cs.berkeley.edu/.
3. A. Balasubramanian, B. N. Levine, and A. Venkataramani. DTN Routing as a Resource Allocation Problem. Technical Report 07-37, UMass Amherst, 2007.
4. N. Banerjee, M. D. Corner, and B. N. Levine. An Energy-Efficient Architecture for DTN Throwboxes. In Proc. IEEE Infocom, May 2007.
5. J. Burgess, G. Bissias, M. D. Corner, and B. N. Levine. Surviving Attacks on Disruption-Tolerant Networks without Authentication. In Proc. ACM Mobihoc, September 2007.
6. J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. In Proc. IEEE Infocom, April 2006.
7. B. Burns, O. Brock, and B. N. Levine. MV Routing and Capacity Building in Disruption Tolerant Networks. In Proc. IEEE Infocom, pages 398-408, March 2005.
8. G. Casella and R. L. Berger. Statistical Inference. Second Edition. Duxbury, 2002.
9. A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott. Impact of Human Mobility on the Design of Opportunistic Forwarding Algorithms. In Proc. IEEE Infocom, May 2006. p
10. C. Chekuri, S. Khanna, and F. B. Shepherd. An O((n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory of Computing, 2(7):137-146, 2006.
11. CPLEX. http://www.ilog.com.
12. J. Davis, A. Fagg, and B. N. Levine. Wearable Computers and Packet Transport Mechanisms in Highly Partitioned Ad hoc Networks. In Proc. IEEE ISWC, pages 141-148, October 2001.
13. P. Desnoyers, D. Ganesan, H. Li, M. Li, and P. Shenoy. PRESTO: A Predictive Storage Architecture for Sensor Networks. In Proc. USENIX HotOS, June 2005.
14. R. Gallager. A Minimum Delay Routing Algorithm Using Distributed Computation. In IEEE Trans. on Communications, volume 25, pages 73-85, Jan 1977.
15. N. Garg, S. Sobti, J. Lai, F. Zheng, K. Li, A. Krishnamurthy, and R. Wang. Bridging the Digital Divide. ACM Trans. on Storage, 1(2):246-275, May 2005.
16. V. Guruswami, S. Khanna, R. Rajaraman, B. Shepherd, and M. Yannakakis. Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. In Proc. ACM STOC, pages 19-28, 1999.
17. B. Hull et al. CarTel: A Distributed Mobile Sensor Computing System. In Proc. ACM SenSys, pages 125-138, Oct. 2006.
18. S. Jain, M. Demmer, R. Patra, and K. Fall. Using Redundancy to Cope with Failures in a Delay Tolerant Network. In Proc. ACM Sigcomm, pages 109-120, 2005.
19. S. Jain, K. Fall, and R. Patra. Routing in a Delay Tolerant Network. In Proc. ACM Sigcomm, pages 145-158, Aug. 2004.
20. E. Jones, L. Li, and P. Ward. Practical Routing in Delay-Tolerant Networks. In Proc. ACM Chants Workshop, pages 237-243, Aug. 2005.
21. F. Kelly, A. Maulloo, and D. Tan. Rate Control for Communication Networks: Shadow Prices, Proportional Fairness and Stability. In J. Op. Res. Society, volume 49, pages 237-252, 1998.
22. J. Leguay, T. Friedman, and V. Conan. DTN Routing in a Mobility Pattern Space. In Proc. ACM Chants Workshop, pages 276-283, Aug. 2005.
23. A. Lindgren, A. Doria, and O. Schelén. Probabilistic Routing in Intermittently Connected Networks. In Proc. SAPIR Workshop, pages 239-254, Aug. 2004.
24. A. Maffei, K. Fall, and D. Chayes. Ocean Instrument Internet. In Proc. AGU Ocean Sciences Conf., Feb 2006.
25. W. Mitchener and A. Vadhat. Epidemic Routing for Partially Connected Ad hoc Networks. Technical Report CS-2000-06, Duke Univ., 2000.
26. J. Ott and D. Kutscher. A Disconnection-Tolerant Transport for Drive-thru Internet Environments. In Proc. IEEE INFOCOM, pages 1849-1862, Mar. 2005.
27. C. Papadimitriou. Computational Complexity. Addison Wesley, 1994.
28. J. Partan, J. Kurose, and B. N. Levine. A Survey of Practical Issues in Underwater Networks. In Proc. ACM WUWNet, pages 17-24, Sept. 2006.
29. R. C. Shah, S. Roy, S. Jain, and W. Brunette. Data MULEs: Modeling a Three-tier Architecture for Sparse Sensor Networks. In Proc. IEEE SNPA, pages 30-41, May 2003.
30. T. Small and Z. Haas. Resource and Performance Tradeoffs in Delay-Tolerant Wireless Networks. In Proc. ACM WDTN, pages 260-267, Aug. 2005.
31. T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In Proc. ACM WDTN, pages 252-259, Aug. 2005.
32. T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Performance analysis of mobility-assisted routing. In ACM MobiHoc, pages 49-60, May 2006.
33. T. Spyropoulos and K. Psounis and C. Raghavendra. Single-copy Routing in Intermittently Connected Mobile Networks. In IEEE SECON, October 2004.
34. J. Widmer and J.-Y. Le Boudec. Network Coding for Efficient Communication in Extreme Networks. In Proc. ACM WDTN, pages 284-291, Aug. 2005.
35. Y.-C. Tseng and S.-Y. Ni and Y.-S. Chen and J.-P. Sheu. The Broadcast Storm Problem in a Mobile Ad hoc Network. Springer Wireless Networks, 8(2/3):153-167, 2002.
36. P. Zhang, C. M. Sadler, S. A. Lyon, and M. Martonosi. Hardware Design Experiences in ZebraNet. In Proc. ACM SenSys, pages 227-238, Nov. 2004.
37. X. Zhang, G. Neglia, J. Kurose, and D. Towsley. Performance Modeling of Epidemic Routing. In Proc. IFIP Networking, May 2006.