Journal of Communications and Networks

  • 제16권4호
  • /
  • Pages.378-384
  • /
  • 2014
  • /
  • 1229-2370(pISSN)
  • /
  • 1976-5541(eISSN)
한국통신학회 (The Korean Institute of Commucations and Information Sciences)
권호 표지
DOI QR코드

DOI QR Code

DTN Routing with Back-Pressure based Replica Distribution

  • Jiao, Zhenzhen (Research Center of Ubiquitous Sensor Networks, University of Chinese Academy of Sciences) ;
  • Tian, Rui (School of Software Engineering, Beijing University of Technology) ;
  • Zhang, Baoxian (Research Center of Ubiquitous Sensor Networks, University of Chinese Academy of Sciences) ;
  • Li, Cheng (Faculty of Engineering and Applied Science, Memorial University)
  • 투고 : 2014.04.15
  • 발행 : 2014.08.30
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Replication routing can greatly improve the data delivery performance by enabling multiple replicas of the same packet to be transmitted towards its destination simultaneously. It has been studied extensively recently and is now a widely accepted routing paradigm in delay tolerant networks (DTNs). However, in this field, the issue of how to maximize the utilization efficiency of limited replication quota in a resource-saving manner and therefore making replication routing to be more efficient in networks with limited resources has not received enough attention. In this paper, we propose a DTN routing protocol with back-pressure based replica distribution. Our protocol models the replica distribution problem from a resource allocation perspective and it utilizes the idea of back-pressure algorithm, which can be used for providing efficient network resource allocation for replication quota assignment among encountered nodes. Simulation results demonstrate that the proposed protocol significantly outperforms existing replication routing protocols in terms of packet delay and delivery ratio.

키워드

과제정보

연구 과제 주관 기관 : National Natural Science Foundation of China

참고문헌

  1. M. Khabbaz, C. Assi, and W. Fawaz. "Disruption-tolerant networking: A comprehensive survey on recent developments and persisting challenges," IEEE Commun. Surveys & Tutorials, vol. 14, pp. 607-640, May 2012. https://doi.org/10.1109/SURV.2011.041911.00093
  2. A. Vahdat and D. Becker, "Epidemic routing for partially connected ad hoc networks," Tech. Rep. CS-2000-06, Duke University, 2000.
  3. B. Burns, O. Brock, and B. Levine, "MV routing and capacity building in disruption tolerant networks," in Proc. IEEE INFOCOM'05, USA, Mar. 2005.
  4. T. Spyropoulos, K. Psounis, and C. Raghavendra, "Efficient routing in intermittently connected mobile networks: The multiple-copy case," IEEE/ACM Trans. on Netw., vol. 16, pp. 77-90, Feb. 2008. https://doi.org/10.1109/TNET.2007.897964
  5. A. Lindgren, A. Doria, and O. Schelen, "Probabilistic routing in intermittently connected networks," ACM SIGMOBILE Mobile Comput. Commun. Rev., vol. 7, pp. 19-20, July 2003. https://doi.org/10.1145/961268.961272
  6. A. Balasubramanian, B. Levine, and A. Venkataramani, "Replication routing in DTNs: A resource allocation approach," IEEE/ACM Trans. Netw., vol. 18, pp. 596-609, Apr. 2010. https://doi.org/10.1109/TNET.2009.2036365
  7. J. Burgess et al., "MaxProp: Routing for vehicle-based disruption-tolerant networks," in Proc. IEEE INFOCOM'06, Spain, Apr. 2006.
  8. T. Spyropoulos, K. Psounis, and C. Raghavendra, "Spray and wait: An efficient routing scheme for intermittently connected mobile networks," in Proc. ACM SIGCOMM Workshop '05, USA, Aug. 2005.
  9. T. Spyropoulos, K. Psounis, and C. Raghavendra, "Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility," in Proc. PERCOM Workshop '07, USA, Mar. 2007.
  10. Y. Wu et al. , "CCR: Capacity-constrained replication for data delivery in vehicular networks," in Proc. IEEE INFOCOM'13, Italy, Apr. 2013.
  11. E. Bulut, Z. Wang, and B. Szymanski, "Cost-effective multiperiod spraying for routing in delay-tolerant networks," IEEE/ACM Trans. Netw., vol. 18, pp. 1530-1543, Oct. 2010. https://doi.org/10.1109/TNET.2010.2043744
  12. S. Nelson, M. Bakht, and R. Kravets, "Encounter-based routing in DTNs," in Proc. IEEE INFOCOM'09, Brazil, Apr. 2009.
  13. J. Ben-Othman and B. Yahya, "Energy efficient and QoS based routing protocol for wireless sensor networks," J. Parallel Distrib. Comput., vol. 70, pp. 849-857, Aug. 2010. https://doi.org/10.1016/j.jpdc.2010.02.010
  14. A. Kobbane, J. Ben-Othman, and M. E. Koutbi, "Packet dropping for realtime applications in wireless networks," in Proc. IEEE ICC'13 , Hungary, June 2013.
  15. M. Koulali et al., "Optimal distributed relay selection for duty-cycling wireless sensor networks," in Proc. IEEE GLOBECOM, USA, Dec. 2012.
  16. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," IEEE Trans. Autom. Control, vol. 37, pp. 1936-1948, Dec. 1992. https://doi.org/10.1109/9.182479
  17. A. Eryilmaz and R. Srikant, "Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control," in Proc. IEEE INFOCOM'05, USA, Mar. 2005.
  18. A. Keranen, J. Ott, and T. Karkkainen, "The ONE simulator for DTN protocol evaluation," in Proc. Simutools '09, Mar. 2009.
  19. L. Georgiadis, M. J. Neely, and L. Tassiulas, Resource Allocation and Cross-Layer Control in Wireless Networks, Now Publishers Inc, 2006.
  20. X. Lin, N. Shroff, and R. Srikant, "A tutorial on cross-layer optimization in wireless networks," IEEE J. Sel. Areas Commun., vol. 24, pp. 1452-1463, Aug. 2006. https://doi.org/10.1109/JSAC.2006.879351
  21. J. Ryu, L. Ying, and S. Shakkottai, "Back-pressure routing for intermittently connected networks," in Proc. IEEE INFOCOM'JO, USA, Mar. 2010.
  22. A. Dvir and A. Vasilakos, "Back-pressure-based routing protocol for DTNs," in Proc. ACM SIGCOMM'10, INDIA, Oct. 2010.
  23. M. Alresaini et ai., "Backpressure with adaptive redundancy (BWAR)," in Froc. IEEE INFOCOM'12, USA, Mar. 2012.