Routing metrics for store and forward satellite constellations

Routing metrics for store and forward satellite constellations

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

Buy article PDF
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.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
Your details
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.

Route computation relies on the definition of performance indicators called routing metrics. Popular metrics are the number of hops, throughput, end-to-end delay and jitter. However, in a store and forward network displaying link disruptions, these metrics are questionable. This contribution defines seven metrics for characterising routes in a store and forward network. These metrics are: number of hops, route lifetime, end-to-end delay, capacity, synchronicity, simultaneousness and discontinuity. Some of these metrics are borrowed or adapted from classical networks, others are specifically conceived for store and forward networks. Simulations for routing in a satellite constellation show that these metrics help to capture the specifics of store and forward networks and therefore improve routing decisions.


    1. 1)
      • S. Farrell , V. Cahill . (2006) Delay – and disruption – tolerant networking.
    2. 2)
      • Wood, L., Eddy, W.M., Ivancic, W., McKim, J., Jackson, C.: `Saratoga: a delay-tolerant networking convergence layer with efficient link utilization', IWSSC 2007, Third Int. Workshop on Satellite and Space Communications, September 2007.
    3. 3)
      • Shah, R.C., Roy, S., Jain, S., Brunette, W.: `Data mules: modelling a three-tier architecture for sparse sensor networks', Proc. First IEEE. 2003 IEEE International Workshop on Sensor Network Protocols and Applications, 2003, p. 30–41.
    4. 4)
      • M.E. Steenstrup . (1995) Routing in Communications Networks.
    5. 5)
      • Jones, E.P.C., Li, L., Ward, P.A.S.: `Practical routing in delay-tolerant networks', WDTN'05: Proc. 2005 ACM SIGCOMM Work-shop on Delay-tolerant Networking, 2005, p. 237–243.
    6. 6)
      • Small, T., Haas, Z.J.: `Resource and performance tradeoffs in delay-tolerant wireless networks', WDTN'05: Proc. 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, 2005, p. 260–267.
    7. 7)
      • Z. Zhang . Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Commun. Surveys Tutorials , 1 , 24 - 37
    8. 8)
      • G. Desaulniers , D. Villeneuve . The shortest path problem with time windows and linear waiting costs. Transp. Sci. , 3 , 312 - 319
    9. 9)
      • Ferreira, A.: `Building a reference combinatorial model for MANETs', IEEE Network, September/October 2004.
    10. 10)
      • A. Lindgren , A. Doria , O. Schel . Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev. , 3 , 19 - 20
    11. 11)
      • Vahdat, A., Becker, D.: `Epidemic routing for partially connected ad hoc networks', Technical Report CS-200006, April 2000, Duke University.
    12. 12)
      • Burgess, J., Gallagher, B., Jensen, D., Levine, B.N.: `MaxProp: routing for vehicle-based disruption-tolerant networking', Proc. IEEE Infocom 2006, April 2006.
    13. 13)
      • Spyropoulos, T., Psounis, K., Raghavendra, C.S.: `Spray and wait: an efficient routing scheme for intermittently connected mobile networks', Proc. ACM WDTN, August 2005, p. 252–259.
    14. 14)
      • Marasigan, D., Rommel, P.: `MV routing and capacity building in disruption tolerant networks', INFOCOM 2005. 24th Annu. Joint Conf. IEEE Computer and Communications Societies. Proc. IEEE, 2005, 1, p. 398–408.
    15. 15)
      • J. Leguay , T. Friedman , V. Conan . Evaluating MobySpace based routing strategies in DTN. Wirel. Commun. Mobile Comput. , 10 , 1171 - 1182
    16. 16)
      • Zhao, W., Ammar, M., Zegura, E.: `A message ferrying approach for data delivery in sparse mobile ad hoc networks', MobiHoc'04: Proc. 5th ACM Int. Symp. on Mobile ad hoc Networking and Computing, 2004, p. 187–198.
    17. 17)
      • A. Balasubramanian , B. Levine , A. Venkataramani . DTN routing as a resource allocation problem. SIGCOMM Comput. Commun. Rev. , 4 , 373 - 384
    18. 18)
      • Krifa, A., Barakat, C., Spyropoulos, T.: `An optimal joint scheduling and drop policy for Delay Tolerant Networks', WOWMOM'2008, 2008, p. 1–6.
    19. 19)
      • Pallottino, S., ScutellÃ, M.G.: `Shortest path algorithms in transportation models: classical and innovative aspects', Technical Report, 1997, Università di Pisa, Dipartimento di Informatica.
    20. 20)
      • M. Desrochers , F. Soumis . A generalized permanent labelling algorithm for the shortest path problem with time windows. Can. J. Oper. Res. Inf. Process. , 3 , 191 - 212
    21. 21)
      • Cruz-Sanchez, H., Franck, L., Beylot, A.-L.: `Precomputed routing in a store and forward satellite system', VTC Fall 07: Proc. 2007 IEEE 66th Vehicular Technology Conf., 2007.

Related content

This is a required field
Please enter a valid email address