Weitere Artikel dieser Ausgabe durch Wischen aufrufen
In delay tolerant network interruptions will occur continuously because there is no end-to-end path exists for the longer period of time from source to destination. In this context, delays can be immensely large due to its environment contrails e.g. wildlife tracking, sensor network, deep space and ocean networks. Furthermore, larger replication of messages put into the network is to increase delivery probability. Due to this high buffer occupancy storage space and replication result in a huge overhead on the network. Consequently, well-ordered intelligent message control buffer drop policies are necessary to operate on buffer that allows control on messages drop when the node buffers are near to overflow. In this paper, we propose an efficient buffer management policy which is called message drop control source relay (MDC-SR) for delay tolerant routing protocols. We also illustrate that conventional buffer management policy like Drop oldest, LIFO and MOFO be ineffective to consider all appropriate information in this framework. The proposed MDC-SR buffer policy controls the message drop while at the same time maximizes the delivery probability and buffer time average and reduces the message relay, drop and hop count in the reasonable amount. Using simulations support on an imitation mobility models Shortest Path Map Based Movement and Map Route Movements, we show that our drop buffer management MDC-SR with random message sizes performs better as compared to existing MOFO, LIFO and DOA.
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:
Papadopouli, M., & Schulzrinne, H. (2000). Seven degrees of separation in mobile ad hoc networks. In Proceedings of the IEEE GLOBECOM (vol. 3, pp. 1707–1711, vol. 1703). IEEE.
Cerf, V., Burleigh, S., Hooke, A., Torgerson, L., Durst, R., Scott, K., et al. (2007). Delay-tolerant network architecture. RFC 4838, April.
Wu, H., Fujimoto, R., Guensler, R., & Hunter, M. MDDV: a mobility-centric data dissemination algorithm for vehicular networks. In Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks, 2004 (pp. 47–56): ACM.
Juang, P., Oki, H., Wang, Y., Martonosi, M., Peh, L. S., & Rubenstein, D. Energy-efficient computing for wildlife tracking: Design tradeoffs and early experiences with ZebraNet. In ACM Sigplan Notices, 2002 (Vol. 37, pp. 96–107, Vol. 10): ACM.
Szewczyk, R., Osterweil, E., Polastre, J., Hamilton, M., Mainwaring, A., & Estrin, D. (2004). Habitat monitoring with sensor networks. Communications of the ACM, 47(6), 34–40. CrossRef
Mathurapoj, A., Pornavalai, C., & Chakraborty, G. Fuzzy-spray: efficient routing in delay tolerant ad-hoc network based on fuzzy decision mechanism. In Fuzzy Systems, 2009. FUZZ-IEEE 2009. IEEE International Conference on, 2009 (pp. 104–109): IEEE.
Rahman, A. H. A., & Zukarnain, Z. A. (2009). Performance comparison of AODV, DSDV and I-DSDV routing protocols in mobile ad hoc networks. European Journal of Scientific Research, 31(4), 566–576.
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2004). Single-copy routing in intermittently connected mobile networks. In Proceedings of the IEEE conference on sensor and ad hoc communications and networks (SECON) (pp. 235–244). IEEE.
Shah, R. C., Roy, S., Jain, S., & Brunette, W. (2003). Data mules: Modeling and analysis of a three-tier architecture for sparse sensor networks. Ad Hoc Networks, 1(2–3), 215–233. CrossRef
Ramanathan, R., Hansen, R., Basu, P., Rosales-Hain, R., & Krishnan, R. (2007). Prioritized epidemic routing for opportunistic networks. In Proceeding of ACM MobiOpp’07 (pp. 62–66). ACM.
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2005). Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proceeding of mobile computer and communication review (pp. 252–259). ACM.
Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2007). Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Proceeding of workshop on PerCom apos (pp. 79–85). IEEE.
Burgess, J., Gallagher, B., Jensen, D., & Levine, B. N. (2006) Maxprop: Routing for vehicle-based disruption-tolerant networks. In Proceeding of of IEEE infocom (vol. 6, pp. 1–11). Citeseer.
Rashid, S., Ayub, Q., Zahid, M. S. M., & Abdullah, A. H. (2010). Optimization of DTN routing protocols by using forwarding strategy (TSMF) and queuing drop policy (DLA). International Journal of Computer and Network Security, 2(10), 71.
Ayub, Q., Rashid, S., & Zahid, M. S. M. (2010). Optimization of epidemic router by new forwarding queue mode TSMF. International Journal of Computer Applications IJCA, 7(11), 5–8. CrossRef
Lindgren, A., & Phanse, K. S. (2006). Evaluation of queuing policies and forwarding strategies for routing in intermittently connected networks. In Proceedings of IEEE COMSWARE (pp. 1–10). IEEE.
Krifa, A., Baraka, C., & Spyropoulos, T. (2008). Optimal buffer management policies for delay tolerant networks. In IEEE conference on sensor, mesh and ad hoc communications and networks (SECON 2008) (pp. 260–268). IEEE.
Li, Y., Zhao, L., Liu, Z., & Liu, Q. (2009). N-drop: Congestion control strategy under epidemic routing in DTN. In Research center for wireless information networks, Chongqing University of posts & telecommunication, Chongqing 400065, china (pp. 457–460). 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. Heuristic Congestion Control for Message Deletion in Delay Tolerant Network. In Smart Spaces and Next Generation Wired/Wireless Networking: Third Conference on Smart Spaces, ruSMART 2010, and 10th International Conference, NEW2AN 2010, St. Petersburg, Russia, Proceedings, 2010 (Vol. 6294, pp. 287): Springer.
Kaveevivitchai, S., Ochiai, H., & Esaki, H. Message deletion and mobility patterns for efficient message delivery in DTNs. In Pervasive Computing and Communications Workshops (PERCOM Workshops), 2010 8th IEEE International Conference on, 2010 (pp. 760-763): IEEE.
Soares, V. N. G. J., Rodrigues, J. J. P. C., Ferreira, P. S., & Nogueira, A. M. D. (2009). Improvement of messages delivery time on vehicular delay-tolerant networks. In International conference on parallel processing workshops (pp. 344–349). IEEE.
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. (2011). E-DROP an effective drop buffer management policy for DTN routing protocols. International Journal of Computer Applications, 13(7), 8–13. CrossRef
Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks, Duke University, Durham Tech. Rep. CS- 200006.
Kernen, A., & Ott, J. (2007). Increasing reality for dtn protocol simulations. Helsinki University of Technology, Tech. Rep., July.
Keränen, A., Ott, J., & Kärkkäinen, T. The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd International Conference on Simulation Tools and Techniques, 2009 (pp. 55): ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
- Message Drop Control Buffer Management Policy for DTN Routing Protocols
M. Soperi Mohd Zahid
Abdul Hanan Abdullah
- Springer US