Weitere Artikel dieser Ausgabe durch Wischen aufrufen
Delay-tolerant networks (DTNs) are distinguished by low connectivity and/or unreliable links, dynamic topology change and network partitioning. Therefore, each node transmits the multiple copies of the message to increase its delivery likelihood. This phenomenon produces congestion that results in the dropping of earlier stored messages. The objective of buffer management policy is to determine which message should be eliminated when the buffer overflow happens. The existing buffer management policies can be divided into two categories: (i) local knowledge-based and (ii) global knowledge based. In a DTN environment, getting global knowledge is impossible and local knowledge-based policies are more practical. This study focuses on the local knowledge-based policies in order to reduce the drop ratio and maximize the delivery. In this paper, we presented a buffer scheduling policy called as weight based drop policy. In this proposed scheme, we dynamically adjust message weight criteria assuming message’s properties, which are message size, remaining time-to-live, message stay time in queue, hop count, and replication count. In order to utilize the buffer efficiently we use weight criteria for finding the most appropriate message for drop and rank the forward messages to its neighboring nodes. The simulation performed in ONE simulator. The simulation results of weight based drop policy by using map based mobility movement outperformed the existing DLA, FIFO, MOFO, SHIL and LIFO in terms of reducing a number of transmission, dropped messages, overhead and enhanced delivery and buffer time average.
Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten
Sie möchten Zugang zu diesem Inhalt erhalten? Dann informieren Sie sich jetzt über unsere Produkte:
Lu, Z. & Fan, J. (2010). Delay/disruption tolerant network and its application in military communications. IEEE.
Soares, V. N. G. J., Farahmand, F., & Rodrigues, J. J. P. C. (2009). Scheduling and drop policies for traffic differentiation on vehicular delay-tolerant networks. IEEE.
Soares, V. N. G. J., et al. (2009). Improvement of messages delivery time on vehicular delay-tolerant networks. In International conference on parallel processing workshops, IEEE.
Shin, M., Hong, S., & Rhee, I. (2008). DTN routing strategies using optimal search patterns. New York: ACM.
Gao, W., & Cao, G. (2010). On exploiting transient contact patterns for data forwarding in Delay Tolerant Networks. IEEE.
Gao, L., et al. (2012). M-Dimension: Multi-characteristics based routing protocol in human associated delay-tolerant networks with improved performance over one dimensional classic models. Journal of network and computer applications, 35(4), 1285–1296.
Hui, P., Crowcroft, J., & Yoneki. E. (2010). Bubble rap: Social-based forwarding in delay-tolerant networks. IEEE Transactions on Mobile Computing, 10(11), 1576–1589.
Lindgren, A., & Phanse, K. S. (2006). Evaluation of queueing policies and forwarding strategies for routing in intermittently connected networks. IEEE.
Li, Y., et al. (2009). Adaptive optimal buffer management policies for realistic DTN. IEEE.
Krifa, A., Baraka, C., & Spyropoulos, T. (2008). Optimal buffer management policies for delay tolerant networks. IEEE.
Lindgren, A., Doria, A., & Scheln, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19–20. CrossRef
Krifa, A., Chadi, B., & Spyropoulos, T. (2010). Message drop and scheduling in DTNs: theory and practice.
Li, Y., et al. (2009). N-Drop: congestion control strategy under epidemic routing in DTN. In Proceedings of the 2009 international conference on wireless communications and mobile computing: connecting the world wirelessly ( pp. 457–460). Leipzig: ACM.
Lee, F. C., Goh, W., & Yeo, C. K. (2010). A queuing mechanism to alleviate flooding attacks in probabilistic delay tolerant networks. IEEE.
Leela-Amornsin, L., & Esaki, H. (2010). Heuristic congestion control for message deletion in delay tolerant network. Smart spaces and next generation wired/wireless networking (pp. 287–298).
Kaveevivitchai, S., Ochiai, H., & Esaki, H. (2010). Message deletion and mobility patterns for efficient message delivery in DTNs.
Rashid, S., & Ayub, Q. (2010). Efficient buffer management policy DLA for DTN routing protocols under congestion. International Journal of Computer and Network Security, 2(9), 118–121.
Ayub, Q., & Rashid, S. (2010). T-Drop: An optimal buffer management policy to improve QOS in DTN routing protocols. Journal of Computing, 2(10), 46–50.
Sulma, R., Qaisar, A., & Hanan, A. A. (2011). E-DROP an effective drop buffer management policy for DTN routing protocols. International Journal of Computer Applications, 13(7), 8–13. CrossRef
Rashid, S., et al. (2012). Mean drop an effectual buffer management policy for delay tolerant network. European Journal of Scientific Research, 70(3), 396–407.
Tang, L., et al. (2012). Buffer management policies in opportunistic networks? Journal of Computational Information Systems, 8(12), 5149–5159.
Rashid, S., Hanan Abdullah, A., Ayub, Q., & Soperi Mohd Zahid, M. (2013). Dynamic prediction based multi queue (DPMQ) drop policy for probabilistic routing protocols of delay tolerant network. Journal of Network and Computer Applications, 36(5), 1395–1402.
Rashid, S., Ayub, Q., Zahid, M. S. M., & Abdullah, A. H. (2013). Message drop control buffer management policy for DTN routing protocols. Wireless personal communications, 72(1), 653–669.
Ayub, Q., Zahid, M. S. M., Rashid, S., & Abdullah, A. H. (2013). DF++: An adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network. Cluster Computing, 1–8.
Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Citeseer.
Lindgren, A., Doria, A., & Schelen, O. (2004). Probabilistic routing in intermittently connected networks. Service assurance with partial and intermittent resources (pp. 239–254).
Sandulescu, G., & Nadjm-Tehrani, S. (2008). Opportunistic DTN routing with window-aware adaptive replication. New York: ACM.
Burgess, J., et al. (2006). Maxprop: Routing for vehicle-based disruption-tolerant networks. Citeseer.
Kernen, A., Ott, J., & Krkkinen, T. (2009). The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd international conference on simulation tools and techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
Kenen, A., & Ott, J. (2007). Increasing reality for dtn protocol simulations. Tech. Rep., July: Helsinki University of Technology.
Kernen, A. (2008). Opportunistic network environment simulator. Special assignment report: Helsinki University of Technology, Department of Communications and Networking.
- Reactive Weight Based Buffer Management Policy for DTN Routing Protocols
Abdul Hanan Abdullah
- Springer US