Controlling resource hogs in mobile delay-tolerant networks

Computer Communications

Volumn 33, Issue 1, 2010, Pages 2-10

  Solis, John ^a   Asokan, N ^b   Kostiainen, Kari ^b   Ginzboorg, Philip ^b   Ott, Jörg ^c  

^a Ringgold Standard Institution Informatics   (United States)

^b NOKIA RESEARCH CENTER   (United States)

^c AALTO UNIVERSITY   (Finland)

Author keywords

Delay tolerant networks; Resource hogs; Resource management

Indexed keywords

COARSE-GRAINED; DELAY TOLERANT NETWORKS; GENERATION RATE; MESSAGE DELIVERY; PRIORITY CLASS; RESOURCE MANAGEMENT; SHOW THROUGH; UNRELIABLE LINKS;

AUTHENTICATION; NATURAL RESOURCES MANAGEMENT; RESOURCE ALLOCATION;

WIRELESS NETWORKS;

EID: 70849094080     PISSN: 01403664     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comcom.2009.07.019     Document Type: Article

References (40)

1. V. Cerf, S. Burleigh, A. Hooke, L. Torgerson, R. Durst, K. Scott, K. Fall, H. Weiss, Delay-tolerant network architecture, RFC 4838, April 2007.
2. K. Fall, A delay-tolerant network architecture for challenged internets, in: Proceedings of ACM SIGCOMM'03, 2003.
3. Pentland A., Fletcher R., and Hasson A. Daknet: rethinking connectivity in developing nations. IEEE Computer 37 1 (2004) 78-83
4. J. Burgess, G.D. Bissias, M. Corner, B.N. Levine, Maxprop: routing for vehicle-based disruption-tolerant networks, in: Proceedings of IEEE INFOCOM'06, 2006.
5. P. Juang, H. Oki, Y. Wang, M. Martonosi, L.-S. Peh, D. Rubenstein, Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet, in: Proceedings of ASPLOS'02, 2002.
6. Burleigh S., Hooke A., Torgerson L., Fall K., Cerf V., Durst B., and Scott K. Delay-tolerant networking: an approach to interplanetary internet. IEEE Communications Magazine 41 6 (2003) 128-136
7. S. Guo, M. Falaki, E. Oliver, S.U. Rahman, A. Seth, M. Zaharia, U. Ismail, S. Keshav, Design and implementation of the KioskNet System, in: International Conference on Information Technologies and Development, 2007.
8. Disruption tolerant networking. Available from: .
9. UMass DieselNet. Available from: .
10. G. Hardin, The tragedy of the commons, Science 162 (1968) 1243-1248. Available from: .
11. J. Burgess, G.D. Bissias, M. Corner, B.N. Levine, Surviving attacks on disruption-tolerant networks without authentication, in: Proceeding of ACM MobiHoc'07, 2007.
12. The free rider problem, Entry in the Stanford Encyclopedia of Philosphy. Available from: , May 2003.
13. A. Keränen, J. Ott, Increasing reality for dtn protocol simulations, Tech. Rep., Helsinki University of Technology, Networking Laboratory. Available from: , July 2007.
14. A. Vahdat, D. Becker, Epidemic routing for partially connected ad hoc networks, Tech. Rep. CS-200006, Duke University, April 2000.
15. T. Spyropoulos, K. Psounis, C.S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks, in: Proceedings of ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN), 2005.
16. A. Lindgren, A. Doria, O. Schelen, Probabilistic routing in intermittently connected networks, in: Proceedings of The First International Workshop on Service Assurance with Partial and Intermittent Resources (SAPIR), 2004.
17. Medhi J. Stochastic Models in Queueing Theory. 2nd ed. (2003), Academic Press, London (Chapter 3.3)
18. Anderson R., and Moore T. The economics of information security. Science 314 5799 (2006) 610-613 10.1126/science.1130992
19. N. Asokan, K. Kostiainen, P. Ginzboorg, J. Ott, C. Luo, Applicability of identity-based cryptography for disruption-tolerant networking, in: Proceeding of ACM MobiOpp'07, 2007.
20. N. Asokan, Discrimination is useful: why and how to discriminate messages in public DTNs, in: Dagstuhl Delay and Disruption-Tolerant Networking (DTN) II Seminar. Available from: , February 2009.
21. Dartmouth campus traces. Available from: .
22. J. Nagle, RFC 970: on packet switches with infinite storage (Dec. 1985). URL ftp://ftp.internic.net/rfc/rfc970.txt, ftp://ftp.math.utah.edu/pub/rfc/rfc970.txt.
23. H. Luo, P. Medvedev, J. Cheng, S. Lu, A self-coordinating approach to distributed fair queueing in ad hoc wireless networks, in: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2001.
24. Floyd S., and Jacobson V. Link-sharing and resource management models for packet networks. IEEE/ACM Transactions on Networking 3 4 (1995) 365-386. http://dx.doi.org/10.1109/90.413212
25. Shreedhar M., and Varghese G. Efficient fair queueing using deficit round-robin. IEEE/ACM Transactions on Networking 4 3 (1996) 375-385. http://dx.doi.org/10.1109/90.502236
26. Yang J.-P. Self-configured fair queueing. Simulation 83 2 (2007) 189-198. http://dx.doi.org/10.1177/0037549707080608
27. Y.-K. Ip, W.-C. Lau, O.-C. Yue, Forwarding and replication strategies for dtn with resource constraints, in: Vehicular Technology Conference (VTC) IEEE 65th, 2007, pp. 1260-1264.
28. V. Erramilli, M. Crovella, Forwarding in opportunistic networks with resource constraints, in: CHANTS'08: Proceedings of the Third ACM Workshop on Challenged Networks, ACM, New York, NY, USA, 2008, pp. 41-48. doi: http://doi.acm.org/10.1145/1409985.1409994.
29. A. Krifa, C. Barakat, T. Spyropoulos, Optimal buffer management policies for delay tolerant networks, in: SECON, 2008, pp. 260-268.
30. Briscoe B. Flow rate fairness: dismantling a religion. ACM SIGCOMM Computer Communications Review 37 2 (2007) 63-74
31. A. Balasubramanian, B. Levine, A. Venkataramani, DTN routing as a resource allocation problem, in: Proceedings of ACM SIGCOMM'07, 2007.
32. M. Seligman, Storage usage of custody transfer in delay tolerant networks with intermittent connectivity, in: Proceedings of ICWN06, 2006.
33. S. Buchegger, J.-Y.L. Boudec, Nodes bearing grudges: towards routing security, fairness, and robustness in mobile ad hoc networks, in: Proceedings of the Tenth Euromicro Workshop on Parallel, Distributed and Network-based Processing (EUROMICRO-PDP), 2002.
34. S. Buchegger, J.-Y.L. Boudec, Performance analysis of the confidant protocol, in: MobiHoc'02: Proceedings of the 3rd ACM International Symposium on Mobile ad hoc Networking & Computing, ACM, New York, NY, USA, 2002, pp. 226-236. doi:http://doi.acm.org/10.1145/513800.513828.
35. A. Cheng, E. Friedman, Sybilproof reputation mechanisms, in: P2PECON'05: Proceedings of the 2005 ACM SIGCOMM Workshop on Economics of Peer-to-peer Systems, ACM, New York, NY, USA, 2005, pp. 128-132. doi: http://doi.acm.org/10.1145/1080192.1080202.
36. Altman E., Kherani A., Michiardi P., and Molva R. Non-cooperative forwarding in ad-hoc networks. Lecture Notes in Computer Science 3462/2005 (2005) 486-498
37. L. Buttyán, J.-P. Hubaux, Enforcing service availability in mobile ad-hoc wans, in: MobiHoc'00: Proceedings of the 1st ACM International Symposium on Mobile ad hoc Networking & Computing, IEEE Press, Piscataway, NJ, USA, 2000, pp. 87-96.
38. L. Buttyán, J.-P. Hubaux, Stimulating cooperation in self-organizing mobile ad hoc networks, ACM Journal for Mobile Networks (MONET), special issue on Mobile Ad Hoc Networks.
39. S. Zhong, J. Chen, Y.R. Yang, Enforcing service availability in mobile ad-hoc wans, in: Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2003.
40. E. Huang, J. Crowcroft, I. Wassell, Rethinking incentives for mobile ad hoc networks, in: Proceedings of the ACM SIGCOMM Workshops, 2004.