Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (1)
  • Open Access

    ARTICLE

    Prophet_TD Routing Algorithm Based on Historical Throughput and Encounter Duration

    Jingjian Chen1, Gang Xu1, *, Fengqi Wei1, Liqiang He2

    CMC-Computers, Materials & Continua, Vol.64, No.3, pp. 1845-1858, 2020, DOI:10.32604/cmc.2020.010010

    Abstract Opportunistic networks are self-organizing networks that do not require a complete path between the source node and the destination node as it uses encounter opportunities brought by nodes movement to achieve network communication. Opportunistic networks routing algorithms are numerous and can be roughly divided into four categories based on different forwarding strategies. The Prophet routing algorithm is an important routing algorithm in opportunistic networks. It forwards messages based on the encounter probability between nodes, and has good innovation significance and optimization potential. However, the Prophet routing algorithm does not consider the impact of the historical throughput of the node on… More >

Displaying 1-10 on page 1 of 1. Per Page