Mobility Similarity-Based Routing in Buffer-Limited Delay Tolerant Networks

Liu, Yao; Huang, Jiawei; Wang, Weiping; Zhou, Hongjing; An, Ying; Wang, Jianxin
June 2015
International Journal of Distributed Sensor Networks;6/2/2015, Vol. 2015, p1
Academic Journal
In delay tolerant networks (DTNs), multiple-copy routing is often adopted to improve the probability of successful message delivery but causes more traffic loads. The excessive increase in multiple messages copies often exhausts the network resources and deteriorates its performance significantly. To solve this problem, a mobility similarity-based routing (SBR) algorithm is proposed in this paper. On one hand, destination similarity is used to help the message carrier node find the appropriate relay nodes with the higher opportunity to meet the destination node in order to improve the delivery ratio. On the other hand, carrier similarity is adopted to avoid sending the same copy to the nodes with mobility similarity so as to reduce the number of message copies. Furthermore, inspired by the law of diminishing marginal utility in economics, a buffer management scheme based on the message transmission status is proposed. Experimental results show that the proposed SBR routing algorithm combined with the buffer management scheme can improve the delivery ratio and has the lower overhead ratio compared to other routing algorithms.


Related Articles

  • An Efficient Selfishness Aware Routing in Delay Tolerant Networks. Baskar, D. // Middle East Journal of Scientific Research;1/19/2014, Vol. 19 Issue 10, p1297 

    Delay Tolerant Networks (DTNs) enable data transfer when mobile nodes are only intermittently connected. DTN routing usually follows store-carry-and-forward mechanism. Therefore, the willingness of nodes to relay messages for other nodes plays a significant role in the routing process. Moreover,...

  • On Modeling The Impact of Selfish Behaviors on Limited Epidemic Routing in Delay Tolerant Networks. Wu, Yahui; Deng, Su; Huang, Hongbin // Wireless Personal Communications;Aug2013, Vol. 71 Issue 4, p2759 

    Transmission opportunity in delay tolerant network (DTN) is uncertain. To improve the routing performance, DTN tries to use every contact between nodes, and one classic policy is epidemic routing algorithm (ER). Due to much energy consumption, L-hop limited ER algorithm is proposed. However,...

  • Mobility-aware routing in delay tolerant networks. Wang, Xiaoming; Cai, Zhipeng; Zhang, Lichen; Lu, Junling // Personal & Ubiquitous Computing;Oct2015, Vol. 19 Issue 7, p1111 

    Delay tolerant networks (DTNs) make use of opportunistic encounters of nodes for communication. The characteristics of high mobility of nodes, frequent link variation and long communication delays in DTNs result in an absence of an instantaneous end-to-end path from any source to a destination,...

  • A History of Encounters Probabilistic Routing Novel Scheme in Delay Tolerant Networking. Shaochang Chen; Ming Yin // Information Technology Journal;2013, Vol. 12 Issue 22, p6980 

    A delay-tolerant network is a network designed so that temporary or intermittent communication problems and limitations have the least possible adverse impact. One major issue should be considered to enhance the performance of data delivery in such challenging networking environments: A routing...

  • Using NS2 to Analyze the Packet Drop Problem for a New Routing Method in DTNs. Shih-Yang Yang; Jiun-Ting Jiang; Po-Zung Chen // Journal of Convergence Information Technology;Feb2013, Vol. 8 Issue 4, p1 

    In this paper, we use ns2 to simulate our new routing methods. We compare the delivery ratio in four different routing methods and analysis the impacts that affect the delivery ratio. We choose our new routing, named OOPFE-Routing and has been accepted in ICCNT2012 [8], with other three routing...

  • A Hop Count Based Multi-path Forwarding Routing Scheme for Delay Tolerant Networks. Lei You; Jianbo Li; Shan jiang; Chenqu Dai // Advances in Information Sciences & Service Sciences;Apr2013, Vol. 5 Issue 7, p1199 

    Delay and Disruption Tolerant Networks (DTNs) introduces several challenges for routing. There may be no end-to-end path between nodes in DTNs. Routing in DTNs needs to operate in the presence of network partitions and thus traditional routing algorithms would fail to deliver data to...

  • Routing in delay tolerant networks with periodic connections. Mergenci, Cem; Korpeoglu, Ibrahim // EURASIP Journal on Wireless Communications & Networking;8/1/2015, Vol. 2015 Issue 1, p1 

    In delay tolerant networks (DTNs), the network may not be fully connected at any instant of time, but connections occurring between nodes at different times make the network connected through the entire time continuum. In such a case, traditional routing methods fail to operate because there are...

  • Traffic-Aware and Energy-Efficient Routing Algorithm for Wireless Sensor Networks. Ding, Wei; Tang, Liangrui; Feng, Sen // Wireless Personal Communications;Dec2015, Vol. 85 Issue 4, p2669 

    The energy of wireless sensor networks (WSNs) is generally powered by limited and portable batteries. However, there are some specific scenarios where the nodes can gain energy continuously, such as the electric energy data collection, the power line monitoring and using renewable energy....

  • POSOP Routing Algorithm: A DTN Routing Scheme for Information Connectivity of Health Centres in Hilly State of North India. Johari, Rahul; Gupta, Neelima; Aneja, Sandhya // International Journal of Distributed Sensor Networks;6/1/2015, Vol. 2015, p1 

    We explore the application of partitioned network for providing health services in difficult terrain where fixed communication infrastructure is not cost-effective due to low population density and very high cost of setting up a permanent infrastructure. We propose a hybrid routing which is...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics