CFP last date
22 April 2024
Reseach Article

Efficient Routing using Bubble Rap in Delay Tolerant Network

by Patel Jaimini, Rajan Patel
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 137 - Number 5
Year of Publication: 2016
Authors: Patel Jaimini, Rajan Patel
10.5120/ijca2016908716

Patel Jaimini, Rajan Patel . Efficient Routing using Bubble Rap in Delay Tolerant Network. International Journal of Computer Applications. 137, 5 ( March 2016), 16-19. DOI=10.5120/ijca2016908716

@article{ 10.5120/ijca2016908716,
author = { Patel Jaimini, Rajan Patel },
title = { Efficient Routing using Bubble Rap in Delay Tolerant Network },
journal = { International Journal of Computer Applications },
issue_date = { March 2016 },
volume = { 137 },
number = { 5 },
month = { March },
year = { 2016 },
issn = { 0975-8887 },
pages = { 16-19 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume137/number5/24271-2016908716/ },
doi = { 10.5120/ijca2016908716 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:37:33.785254+05:30
%A Patel Jaimini
%A Rajan Patel
%T Efficient Routing using Bubble Rap in Delay Tolerant Network
%J International Journal of Computer Applications
%@ 0975-8887
%V 137
%N 5
%P 16-19
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Intermittently connected mobile ad-hoc networks are kind of wireless networks where end to end connectivity unlikely exists. Routing in such environment is carried out through the store-carry-forward mechanism. Thus, message delivery relies on node’s mobility, their contact opportunities and contact patterns. Intermittently connected mobile ad-hoc networks can be viewed as dynamic graph, where mobile nodes are vertices and contact between nodes are edges. Such graph constantly evolves as node’s connection, disconnection and reconnection and reveals the dynamic behaviour of the network. Detecting and dealing with congestion in delay tolerant networks is an important and challenging problem. Current DTN forwarding algorithms typically direct traffic towards particular nodes in order to maximize delivery ratios and minimize delays, but as traffic demands increase these nodes may become unusable. In this thesis we attempted to improve BUBBLE RAP algorithm performance by using congestion control, forwarded message exchange and message priority update mechanism. We proposed Congestion Control algorithm (CCA) to reduce the congestion occurring on highly social nodes and to improve the forwarding efficiency significantly compared to oblivious forwarding schemes. In CCA algorithm, the congestion level of node and message priority are utilized to construct a Congestion Metric (CM). In the forwarding process, the concept of message forwarding to lower CM valued nodes is added together with the BUBBLE RAP strategy to improve the delivery probability as well as together with that a try to reduce the congestion by dropping the messages over nodes having low centrality links with destination is also made.

References
  1. K. Fall, “A delay-tolerant network architecture for challenged internets,” in Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications - SIGCOMM ’03, 2003.
  2. S. Burleigh, A. Hooke, L. Torgerson, K. Fall, V. Cerf, B. Durst, K. Scott, and H. Weiss, “Delay-tolerant networking: an approach to interplanetary Internet,” IEEE Communications Magazine, vol. 41, no. 6, pp. 128–136, Jun. 2003.
  3. F. Warthman, “Delay Tolerant Networks (DTN),” prius.ist.osaka-u.ac.jp, no. March, 2003.
  4. A. Gupta, “Routing in Delay Tolerant networks,” in Proceedings of the 6th ACM conference on Embedded network sensor systems - SenSys ’08, 2009.
  5. Z. Zhang, “Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges,” IEEE Communications Surveys &
  6. E. M. Daly & M. Haahr, “Social network analysis for routing in disconnected delay-tolerant manets”, in MobiHoc ‘07 Proc. 8th ACM International Symposium on Mobile ad-hoc networking and computing, 2007.
  7. P. Hui, J. Crowcroft & E. Yoneki, “Bubble rap: social-based forwarding in delaytolerant networks”, Mobile Computing, IEEE Transactions on, vol. 10, pp. 1576-1589, November, 2011.
  8. P. Hui & J. Crowcroft, “How small labels create big improvements”, in International Workshop on Intermittently Connected Mobile Ad-hoc Networks in conjunction with IEEE PerCom 2007, March 19-23, 2007.
  9. E. Bulut and B. K. Szymanski, “Friendship based routing in delay tolerant mobile social networks,” in Proc. IEEE Global Telecommuni-cations Conference (GLOBECOM), , Dec, 2010
Index Terms

Computer Science
Information Sciences

Keywords

Quality of Node Bubble Rap Delay Tolerant Network Conjection Level.