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

Enhanced buffer management policy that utilises message properties for delay-tolerant networks

Enhanced buffer management policy that utilises message properties for delay-tolerant networks

For access to this article, please select a purchase option:

Buy article PDF
£12.50
(plus tax if applicable)
Buy Knowledge Pack
10 articles for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

A delay-tolerant network is a network designed so that temporary or intermittent communication problems and limitations have the least possible adverse impact. Two major issues should be considered to achieve data delivery in such challenging networking environments: a routing strategy for the network and a buffer management policy for each node in the network. The routing strategy determines which messages should be forwarded when nodes meet and the buffer management policy determines which message is purged when the buffer overflows in a node. This study proposes an enhanced buffer management policy that utilises message properties. For maximisation of the message deliveries and minimisation of the average delay, two utility functions are proposed on the basis of message properties, particularly the number of replicas, the age and the remaining time-to-live. The experimental results on two types of well-known real-world mobility trace data and synthetic data show that the proposed buffer management policy yields better results over the history-based drop and traditional policies, such as the shortest lifetime first, the most forwarded first in terms of the number of message deliveries and average delay.

References

    1. 1)
      • Daly, E.M., Haahr, M.: `Social network analysis for routing in disconnected delay-tolerant MANETs', Proc. Int. ACM Symp. on Mobile Ad Hoc Networking and Computing, September 2007, Montréal, Québec, Canada, p. 32–40.
    2. 2)
    3. 3)
    4. 4)
      • Lebrun, J., Chuah, C.-N., Ghosal, D., Zhang, M.: `Knowledge-based opportunistic forwarding in vehicular wireless ad hoc networks', Proc. Int. Conf. IEEE Vehicular Technology, May 2005, Stockholm, Sweden, p. 2289–2293.
    5. 5)
      • Lindgren, A., Phanse, K.S.: `Evaluation of queuing policies and forwarding strategies for routing in intermittently connected networks', Proc. Int. Conf. Communication Systems Software and Middleware, January 2006, New Delhi, India, p. 1–10.
    6. 6)
      • Li, Y., Qian, M., Jin, D., Su, L., Zeng, L.: `Adaptive optimal buffer management policies for realistic DTN', Proc. Int. Conf. IEEE Global Communications, November 2009, Honolulu, HI, p. 1–5.
    7. 7)
      • Nelson, S.C., Bakht, M., Kravets, R.: `Encounter-based routing in DTNs', Proc. Int. Conf. IEEE Computer Communications, April 2009, Rio de Janeiro, Brazil, p. 846–854.
    8. 8)
      • Vahdat, A., Becker, D.: `Epidemic routing for partially connected ad hoc networks', Tech. Rep. CS-2000–06, CS Dept., Duke University, 2000.
    9. 9)
      • Seligman, M.: `Storage usage of custody transfer in delay tolerant networks with intermittent connectivity', Proc. Int. Conf. Wireless Networks, June 2006, Las Vegas, NV, p. 386–392.
    10. 10)
    11. 11)
    12. 12)
      • Jardosh, S., Zunnun, N., Ranjan, P., Srivastava, S.: `Effect of network coding on buffer management in wireless sensor network', Proc. Int. Conf. Intelligent Sensors, Sensor Networks and Information Processing, December 2008, Sydney, Australia, p. 157–162.
    13. 13)
      • Leguay, J., Friedman, T., Conan, V.: `Evaluating mobility pattern space routing for DTNs', Proc. Int. Conf. IEEE Infocom, April 2006, Barcelona, Spain, p. 1–10.
    14. 14)
    15. 15)
    16. 16)
    17. 17)
      • Shu, W., Padmanabh, K., Gupta, P.: `Prioritized buffer management policy for wireless sensor nodes', Proc. Int. Conf. Advanced Information Networking and Applications Workshops, May 2009, Bradford, UK, p. 787–792.
    18. 18)
      • Krifa, A., Barakat, C., Spyropoulos, T.: `An optimal joint scheduling and drop policy for delay tolerant networks', Proc. Int. Workshop on Autonomic and Opportunistic Communication, June 2008, Newport Beach, CA, p. 1–6.
    19. 19)
      • Hui, P., Chaintreau, A., Scott, J., Gass, R., Crowcroft, J., Diot, C.: `Pocket switched networks and human mobility', Proc. Int. ACM SIGCOMM Workshop Delay-Tolerant Networking, August 2005, Philadelphia, PA, p. 244–251.
    20. 20)
    21. 21)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2010.0422
Loading

Related content

content/journals/10.1049/iet-com.2010.0422
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address