Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

A hybrid multiple copy routing algorithm in space delay-tolerant networks

空间 DTN 网络混合式多拷贝路由算法研究

  • 104 Accesses

  • 5 Citations

Abstract

With the development of technology and applications in space delay-tolerant networks (SDTNs), increasing attention has been paid on the routing technologies between different DTN nodes. This paper proposes a novel hybrid multiple copy routing (HMCR) algorithm that can be applied not only to deterministic space scenarios but also to opportunistic space scenarios. HMCR combines contact graph and delivery probability metrics to make forwarding decisions. In order to verify the new HMCR algorithm’s performance, research work has been carried out to prove its availability in SDTNs. The analysis and simulation results show that, compared with other algorithms such as contact graph routing (CGR), Epidemic, and PRoPHET, the new HMCR algorithm performs well in the areas of message delivery ratios, average end-to-end delays, and transmission overhead, which proves to be suitable for highly dynamic SDTNs.

摘要

创新点

混合式多拷贝路由算法力图将多拷贝路由策略转发的快速性与计算转发路由的智能性相结合, 构建基于最早到达的非实时连通路由, 在最大化利用已知链路信息进行CGR转发的同时, 通过引入随机转发方式有效避免对于先验知识的过度依赖, 既能防止过多的冗余拷贝对网络性能造成的负面影响, 又能避免由于单个消息在网络中转发可能遭遇的路由错误, 克服了CGR路由算法和随机路由算法的不足。

This is a preview of subscription content, log in to check access.

References

  1. 1

    Fall K. A delay-tolerant network architecture for challenged internets. In: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York: ACM, 2003. 27–34

  2. 2

    Perkins C E, Royer E M. Ad-hoc on-demand distance vector routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, New Orleans, 1999. 90–100

  3. 3

    Bohlooli A, Jamshidi K. Profile based routing in vehicular ad-hoc networks. Sci China Inf Sci, 2014. 57: 062313

  4. 4

    Huang H P, Cao X, Wang R C, et al. A QoS-aware routing algorithm based on ant-cluster in wireless multimedia sensor networks. Sci China Inf Sci, 2014. 57: 102307

  5. 5

    Zhang S L, Wang Z X, Liu M Q, et al. Energy-aware routing for delay-sensitive underwater wireless sensor networks. Sci China Inf Sci, 2014. 57: 102308

  6. 6

    Shah R C, Roy S, Jain S, et al. Data MULEs: modeling a three-tier architecture for sparse sensor networks. In: Proceedings of IEEE International Workshop on Sensor Network Protocols and Applications, Anchorage, 2003. 30–41

  7. 7

    Birrane E, Burleigh S, Kasch N. Analysis of the contact graph routing algorithm: bounding interplanetary paths. Acta Astronautica, 2012, 75: 108–119

  8. 8

    Mundur P, Seligman M, Lee G. Epidemic routing with immunity in delay tolerant networks. In: Proceedings of IEEE Military Communications Conference, San Diego, 2008. 1–7

  9. 9

    Dang F, Yang X L, Long K P. Spray and forward: efficient routing based on the Markov location prediction model for DTNs. Sci China Inf Sci, 2012, 55: 433–440

  10. 10

    Spyropoulos T, Psounis K, Raghavendra C S. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceeding of ACM SIGCOMM Workshop on Delay-Tolerant Networking. New York: ACM, 2005. 252–259

  11. 11

    Widmer J, Boudec J L. Network coding for efficient communication in extreme networks. In: Proceedings of ACM SIGCOMM Workshop on Delay-Tolerant Networking. New York: ACM, 2005. 284–291

  12. 12

    Spyropoulos T, Psounis K, Raghavendra C. Efficient routing in intermittently connected mobile networks: the singlecopy case. IEEE/ACM Trans Netw, 2008, 16: 63–76

  13. 13

    Lindgren A, Doria A, Schelén O. Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mob Comput Commun Rev, 2003, 7: 19–20

  14. 14

    Nishiyama H, Takahashi A, Kato N, et al. Dynamic replication and forwarding control based on node surroundings in cooperative delay-tolerant networks. IEEE Trans Parall Distrib Syst, 2015, 26: 2711–2719

  15. 15

    Eshghi S, Khouzani M, Sarkar S, et al. Optimal energy-aware epidemic routing in DTNs. IEEE Trans Autom Control, 2015, 60: 1554–1569

  16. 16

    Vendramin A, Munaretto A, Delgado M, et al. CGrAnt: a swarm intelligence-based routing protocol for delay tolerant networks. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO’12, Philadelphia, 2012. 33–40

  17. 17

    de Oliveira J, Vendramin A C B K, Munaretto A, et al. The DTN routing problem exploitation versus exploration of solutions. In: Proceedings of IEEE 81st Vehicular Technology Conference (VTC Spring), Glasgow, 2015. 1–6

  18. 18

    Burleigh C S. Contact Graph Routing. IRTF, Internet-Draft draft-burleigh-dtnrg-cgr-00, 2009

  19. 19

    Segui J, Jennings E, Burleigh S. Enhancing contact graph routing for delay tolerant space networking. In: Proceedings of IEEE Global Telecommunications Conference (GLOBECOM), Houston, 2011. 1–6

  20. 20

    Birrane E, Burleigh S, Kasch N. Analysis of the contact graph routing algorithm: bounding interplanetary paths. Acta Astronautica, 2012, 75: 108–119

  21. 21

    Araniti G, Bezirgiannidis N, Birrane E, et al. Contact graph routing in DTN space networks: overview, enhancements and performance. IEEE Commun Mag, 2015, 53: 28–46

  22. 22

    Fraire J A, Finochietto J M. Design challenges in contact plans for disruption-tolerant satellite networks. IEEE Commun Mag, 2015, 53: 163–169

  23. 23

    Hongcheng Y, Qingjun Z, Yong S, et al. Contact plan design for navigation satellite network based on simulated annealing. In: Proceedings of IEEE International Conference on Communication Software and Networks, Chengdu, 2015. 12–16

  24. 24

    Song P B, Wu J, Jiang H, et al. Snapshot integration routing for high-resolution satellite sensor networks based on delay-tolerent network. In: Proceedings of IEEE International Conference on Computer and Information Technology; Ubiquitous Computing and Communications; Dependable, Autonomic and Secure Computing; Pervasive Intelligence and Computing, Liverpool, 2015. 2400–2406

  25. 25

    CCSDS Bundle Protocol Protocol Specification. Recommendation for Space Data System Standards. CCSDS 734.2-B-1, Blue Book, Washington D C: CCSDS, 2015

  26. 26

    Licklider Transmission Protocol (LTP) for CCSDS. Recommendation for Space Data System Standards. CCSDS 734.1-B-1, Blue Book, Washington D C: CCSDS, 2015

  27. 27

    Encapsulation Service. Recommendation for Space Data System Standards. CCSDS 133.1-B-2, Blue Book, Washington D C: CCSDS, 2009

  28. 28

    AOS Space Data Link Protocol. Recommendation for Space Data System Standards. CCSDS 732.0-B-3, Blue Book, Washington D C: CCSDS, 2015

  29. 29

    Caini C, Cornice P, Firrincieli R, et al. A DTN approach to satellite communications. IEEE J Sel Areas Commun, 2008, 26: 820–827

Download references

Author information

Correspondence to Peng Wan.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Wan, P., Chen, S., Yu, T. et al. A hybrid multiple copy routing algorithm in space delay-tolerant networks. Sci. China Inf. Sci. 60, 042301 (2017). https://doi.org/10.1007/s11432-015-0954-6

Download citation

Keywords

  • space delay-tolerant networks
  • routing algorithms
  • contact graph routing
  • hybrid single copy routing
  • hybrid multiple copy routing

关键词

  • 空间 DTN 网络
  • 路由算法
  • 接触图路由
  • 混合式单拷贝路由
  • 混合式多拷贝路由