Skip to main content

Delay Tolerant Routing and Applications

  • Chapter
  • First Online:
Opportunistic Mobile Networks

Part of the book series: Computer Communications and Networks ((CCN))

Abstract

The fundamental goal of any communication network is to have the messages delivered to their corresponding destinations. In conventional networks, such as MANETs, determining a routing path with optimum cost is rather easy. However, such approaches become difficult in DTNs/OMNs due to their unique characteristics, as noted in the previous chapter. The network topology of DTNs/OMNs is not only highly dynamic, but also exhibits high degree of network partitioning. In particular, the concept of end-to-end communication paths practically ceases to exist therein. To overcome such issues and constraints, several schemes have been proposed in the literature to achieve efficient routing in DTNs/OMNs. In this chapter, we take a look at a broad category of such protocols. A common characteristic of all these routing protocols is that they are replication based, i.e., they create multiple copies of a message in the OMN concerned. However, some of them attempt to restrict the extent of replication in different ways to achieve efficiency. We, then, present a set of commonly used metrics for measuring the performance of OMNs. Subsequently, we discuss about real-life traces that are increasingly being used with network simulations nowadays. Finally, we conclude this chapter by retrospecting some of the applications of DTNs.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    In [57], the authors considered routing of packets. For the sake of consistency, we use the term message here. The general problem of routing, however, remains the same irrespective of whether the data unit considered is a packet or a message.

  2. 2.

    An initial version of some of these definitions appeared in one of the authors blog at http://delay-tolerant-networks.blogspot.com/2014/03/commonly-used-metrics.html.

  3. 3.

    This section has been reproduced by permission of the Institution of Engineering&Technology.

    B.K. Saha, S. Misra, “Effects of heterogeneity on the performance of pocket switched networks,” IET Networks, 2013, vol. 3, no. 2, pp. 110–118.

  4. 4.

    A detailed list can be found at https://sites.google.com/site/dtnresgroup/home/code.

  5. 5.

    https://sites.google.com/site/dtnresgroup/home/code/dtn2documentation.

  6. 6.

    https://ion.ocp.ohiou.edu/.

  7. 7.

    http://reeves.viagenie.ca/.

  8. 8.

    https://trac.ibr.cs.tu-bs.de/project-cm-2012-ibrdtn.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sudip Misra .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Misra, S., Saha, B.K., Pal, S. (2016). Delay Tolerant Routing and Applications. In: Opportunistic Mobile Networks. Computer Communications and Networks. Springer, Cham. https://doi.org/10.1007/978-3-319-29031-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-29031-7_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-29029-4

  • Online ISBN: 978-3-319-29031-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics