Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

access icon openaccess Survey of buffer management policies for delay tolerant networks

Delay tolerant networks (DTN) are a class of networks that are a subset of the traditional mobile ad-hoc networks. It differs from mobile ad hoc networks (MANETs) in the sense that it can withstand high delays in delivering data because of frequent network partitions, limited bandwidth and storage constraints persisting in such networks. Owing to these inherent characteristics of the delay tolerant networks improving delivery ratio in such networks depends on two main factors-use of routing strategy and a good buffer management policy. Many routing protocols have been proposed in the literature for DTN. Buffer management is a very important factor in DTN because of the very limited buffer space available in DTN nodes. Although a scheduling policy in DTN determines which message has to be forwarded first, the dropping policy decides which messages are to be dropped in case of buffer overflow. This Letter presents a survey of the existing buffer management policies proposed for DTN and discusses the pros and cons of these approaches. The buffer management techniques have been classified on the basis of information used by them whether they are based on local information of messages available at the node or global information of all the messages in the network.

References

    1. 1)
      • 14. Vasco, N.G.J., Farahmand, S.F., Rodrigues, J.J.P.C.: ‘Performance analysis of scheduling and dropping policies in vehicular delay-tolerant networks’, Int. J. Adv. Internet Technol., 2010, 3, (1), pp. 137145, ISSN: 1942---2652, http://www.iariajournals.org/internet_technology.
    2. 2)
    3. 3)
    4. 4)
    5. 5)
      • 2. Delay Tolerant Networking Research Group. Available at http://www.dtnrg.org.
    6. 6)
      • 1. Cao, Y., Sun, Z.: ‘Routing in delay/disruption tolerant networks: a taxonomy, survey and challenges’, IEEE Commun. Tutor., 2012.
    7. 7)
      • 3. Delay Tolerant Network: Challenges and Application by Farid Farahmand (AITISl).
    8. 8)
      • 20. Rashid, S., Abdullah, A.H., Soperi Mohd Zahid, M., Ayub, Q.: ‘Mean drop an effectual buffer management policy for delay tolerant network’, Eur. J. Sci. Res., 2012, 70, (3), pp. 396407.
    9. 9)
      • 5. Davis, J.A., Fagg, A.H., Levine, B.N.: ‘Wearable computers as packet transport mechanisms in highly partitioned ad-hoc networks’. Int. Symp. Wearable Computing, 2001, pp. 141148.
    10. 10)
    11. 11)
      • 12. Li, Y., Qian, M.: ‘Adaptive optimal buffer management policies for realistic DTN’. IEEE Global Telecommunication Conf., GLOBECOM 2009, USA, 30 November–4 December, 2009, pp. 15..
    12. 12)
      • 10. Lindgren, A., Phanse, K.S.: ‘Evaluation of queuing policies and forwarding strategies for routing in intermittently connected networks’. Proc. IEEE COMSWARE, January 2006, pp. 110.
    13. 13)
    14. 14)
      • 4. Krifa, A., Barakat, C., Spyropoulos, T.: ‘Optimal buffer management policies for delay tolerant networks’. IEEE Conf. Sensor, Mesh and Ad Hoc Communications and Networks (SECON 2008), June 2008, pp. 19.
    15. 15)
      • 22. Liu, Y., Wang, J., Zhang, S., Zhou, H.: ‘A buffer management scheme based on message transmission status in delay tolerant networks’, IEEE Globecom, 2011, pp. 15.
    16. 16)
      • 15. Ma, K.Y., Nenghai Liu, B.: ‘A new packet dropping policy in delay tolerant network’. USTC, Information Process Center 4th mailbox Hefei city, Anhui province, China, pp. 377380.
    17. 17)
      • 24. Tang, L., Chai, Y., Li, Y., Weng, B.: ‘Buffer management policies in opportunistic networks’, J. Comput. Inf. Syst. Binary Inf. Press, 2012, 8, (12), pp. 51495159.
    18. 18)
      • 18. Ayub, Q., Rashid, S.: ‘T-drop: an optimal buffer management policy to improve QOS in DTN routing protocols’, J. Comput., 2010, 2, (10), pp. 4650.
    19. 19)
      • 6. Burgess, J., Gallagher, B., Jensen, D.: ‘MaxProp: routing for vehicle-based disruption-tolerant networks’. INFOCOM 2006 – The 25th IEEE Int. Conf. Computer Communications, Barcelona, Catalunya, Spain, 23–29 April 2006, pp. 111.
    20. 20)
      • 16. Bjurefors, F., Gunningberg, P., Rohner, C., Tavakoli, S.: ‘Congestion avoidance in a data-centric opportunistic network’. ACM ICN'11, ON, Canada, 2011, pp. 3237.
    21. 21)
      • 17. Rashid, S., Ayub, Q.: ‘Effective buffer management policy DLA for DTN routing protocols under congestion’, Int. J. Comput. Netw. Secur., 2010, 2, (9), pp. 118121.
    22. 22)
      • 9. Spyropoulos, T., Psounis, K., Raghavendra, C.S.: ‘Spray and wait: an efficient routing scheme for intermittently connected mobile networks’. ACM SIGCOMM 2005 – Workshop on Delay Tolerant Networking and Related Networks (WDTN-05), Philadelphia, PA, USA, 22–26 August 2005, pp. 252259.
    23. 23)
      • 13. Li, Y., Zhao, L., Liu, Z., Liu, Q.: ‘N-drop congestion control strategy under epidemic routing in DTN’. Fifth ACM Conf. Mobile Computing Conf. (IWCMC 2009), Leipzig, Germany, 21–24 June 2009, pp. 457460.
    24. 24)
      • 11. Ramanathan, R., Hansen, R., Basu, P.: ‘Prioritized epidemic routing for opportunistic networks’. ACM MobiOpp'07, PR, USA, June 2007, pp. 6266.
    25. 25)
      • 7. Vahdat, A., Becker, D.: ‘Epidemic routing for partially connected ad hoc networks’. Technical Report, CS-200006, Duke University, 2000.
    26. 26)
      • 19. Rashid, S., Ayub, Q., Soperi Mohd Zahid, M., Abdullah, A.H.: ‘E-Drop: an effective drop buffer management policy for DTN routing protocols’, Int. J. Comput. Appl., 2011, 13, (7), pp. 813.
    27. 27)
      • 14. Vasco, N.G.J., Farahmand, S.F., Rodrigues, J.J.P.C.: ‘Performance analysis of scheduling and dropping policies in vehicular delay-tolerant networks’, Int.J. Adv. Internet Technol., 2010, 3, (1), pp. 137145, ISSN: 1942---2652, http://www.iariajournals.org/internet_technology.
    28. 28)
http://iet.metastore.ingenta.com/content/journals/10.1049/joe.2014.0067
Loading

Related content

content/journals/10.1049/joe.2014.0067
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address