• DocumentCode
    3226626
  • Title

    An SSP formulation of routing in DTN networks

  • Author

    Iraqi, Youssef

  • Author_Institution
    Khalifa Univ. (KUSTAR), Sharjah, United Arab Emirates
  • fYear
    2010
  • fDate
    11-13 Oct. 2010
  • Firstpage
    316
  • Lastpage
    323
  • Abstract
    In this paper we present a Stochastic Shortest Path (SSP) formulation of routing in DTN networks where all the nodes are potentially mobile and where only an aggregate mobility information is available. We present a solution to the optimal case and present two heuristics to solve the problem. Extensive simulations assess the performance of the proposed schemes.
  • Keywords
    mobile radio; routing protocols; DTN network routing; SSP formulation; aggregate mobility information; delay tolerant networks; mobile node; stochastic shortest path formulation; Complexity theory; Heuristic algorithms; Markov processes; Mobile communication; Mobile computing; Routing; Steady-state;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless and Mobile Computing, Networking and Communications (WiMob), 2010 IEEE 6th International Conference on
  • Conference_Location
    Niagara Falls, ON
  • Print_ISBN
    978-1-4244-7743-2
  • Electronic_ISBN
    978-1-4244-7741-8
  • Type

    conf

  • DOI
    10.1109/WIMOB.2010.5645047
  • Filename
    5645047
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3226626