• DocumentCode
    2046398
  • Title

    Routing strategy for minimizing the packet loss in disruptive tolerant networks

  • Author

    Lipsa, Gabriel

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Maryland Univ., College Park, MD
  • fYear
    2008
  • fDate
    19-21 March 2008
  • Firstpage
    1167
  • Lastpage
    1172
  • Abstract
    In this paper, it is discussed how to do routing in disruptive tolerant networks (DTN) in order to minimize the packet loss. In DTN there is no guarantee of path existence between the source and the destination. For such networks, the usual networking protocols do not work properly and cannot deliver the packets between nodes in the network. However there are cases where the connectivity between 2 nodes doesn´t exist at any given time but communication is still possible. In this paper, we propose a routing heurestic, for minimizing the packet loss in DTN, where the nodes have finite buffers.
  • Keywords
    minimisation; telecommunication network routing; disruptive tolerant networks; packet loss minimisation; routing heurestic; Ad hoc networks; Bandwidth; Cellular phones; Communication channels; Disruption tolerant networking; Educational institutions; Portable computers; Protocols; Relays; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on
  • Conference_Location
    Princeton, NJ
  • Print_ISBN
    978-1-4244-2246-3
  • Electronic_ISBN
    978-1-4244-2247-0
  • Type

    conf

  • DOI
    10.1109/CISS.2008.4558695
  • Filename
    4558695