• DocumentCode
    2846797
  • Title

    One Leader at One Time: OLOT Routing in Delay Tolerant Networks

  • Author

    Bai, Bing ; Feng, Zhenqian ; Zhao, Baokang ; Su, Jinshu

  • Author_Institution
    Dept. of Comput., Nat. Univ. of Defense Technol., Changsha, China
  • fYear
    2011
  • fDate
    16-18 Dec. 2011
  • Firstpage
    432
  • Lastpage
    435
  • Abstract
    Routing is a challenge problem in Delay-tolerant networks (DTNs) due to the intermittent connectivity environment. To cope with it, both single-copy and multi-copy routing protocols have been proposed. The difference between them is how to handle with the messages that have been forwarded to the next hop. These messages will be removed from buffer immediately in the single-copy protocols, while be kept and forwarded to other relays in the multi-copy cases. However, there is a gap between the two protocols. In our previous work, we have indicated it and proposed a Snail Crawling(SC) method to fill the gap. In this paper, we indicate that the SC method is just an enhanced method but not a routing protocol. By adopting heuristic strategies in messages distribution of SC, we get a new routing protocol One Leader at One Time(OLOT), in which only one node can forward message to another relay at the same time. Simulation results show that both the delivery rate and the overhead of OLOT are better than the SC method.
  • Keywords
    delay tolerant networks; message passing; routing protocols; DTN; OLOT routing; SC method; delay tolerant networks; message distribution; message forwarding; message handling; multicopy routing protocol; one leader at one time routing; single-copy routing protocol; snail crawling method; Delay; Mobile communication; Mobile computing; Relays; Routing; Routing protocols; Delay Tolerant; OLOT; networking; routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Mobile Ad-hoc and Sensor Networks (MSN), 2011 Seventh International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4577-2178-6
  • Type

    conf

  • DOI
    10.1109/MSN.2011.53
  • Filename
    6117460