Threshold Based Best Custodian Routing Protocol for Delay Tolerant Network

Qaisar Ayub, Soperi Mohd Zahid, Sulma Rashid, Abdul Hanan Abdullah

Abstract


Delay Tolerant Network (DTN) is a kind of network in which the source may not be able to establish the stable and uninterrupted path to destination due to network partitioning, dynamic topology change and frequent disconnections. In order to dealt disruption and disconnections a store, carry and forward paradigm is used in which node stores the incoming messages in its buffer, carries it while moving and forward when comes within the transmission range of other nodes. Message forwarding contributes and important role in increasing its delivery. For instance, probabilistic routing protocol forwards message to a node having high probability value to meet message destination. These protocols cannot handle a situation in which the node continually transmits messages even the probability difference is very small. In this paper, we have proposed a routing protocol known as Threshold Based best custodian Routing Protocol (TBbcRP) for delay tolerant network. We have proposed a threshold-based method to compute the quality value which is the ability of node to carry message. A self-learning mechanism has been used to remove the delivered messages from the network. Moreover, a buffer aware mechanism has been used that make sure availability of buffer space at receiver before message transmission. We have compared the performance of TBbcRP with Epidemic, PRoPHET and Delegated Forwarding. The proposed TBbcRP outperforms in terms of maximizing the delivery probability, reducing number of transmissions and message drop.

Keywords


Delay Tolerance Network , store-carry-forward, routing protocols , algorithms

Full Text:

PDF

References


Ariyavisitakul, S. L. (2000); Turbo Space-Time Processing to Improve Wireless Channel Capacity. IEEE Transactions on Communications. 48(8): 1347-1359.
http://dx.doi.org/10.1109/ICC.2000.853697

Yujin Lim.,Jesung Kim.,Sang Lyul Min.,Joong Soo Ma(2001);

Yujin Lim.,Jesung Kim.,Sang Lyul Min.,Joong Soo Ma(2001); Performance evaluation of the Bluetooth-based public Internet access point Information Networking, 2001. Proceedings. 15th International Conference on Information Networking, 643-648.

Latiff L.A.,Fisal, N.,. (2003); Routing protocols in wireless mobile ad hoc network - a review. The 9th Asia-Pacific Conference on Communications (APCC 2003), 600-604.
http://dx.doi.org/10.1109/APCC.2003.1274428

Murthy S., and J.J. Garcia-Luna-Aceves.(1996); An efficient routing protocol for wireless networks, Mobile Networks and Applications, 1(2):183-197.
http://dx.doi.org/10.1007/BF01193336

Perkins C.E., and E.M. Royer. (1999); Ad-hoc on-demand distance vector routing, IEEE WMCSA 99, 90-100

Johnson D.B., and D.A. Maltz.(1996); Dynamic source outing in ad hoc wireless networks, Mobile computing, 153-181.

Fall, K. (2003); A Delay-Tolerant Network Architecture for Challenged Internets. In SIGCOMM 03: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. New York, NY, USA: ACM, 27-34.
http://dx.doi.org/10.1145/863955.863960

Spyropoulos T., K. Psounis., and C.S Raghavendra.(2004); Single-copy routing in intermittently connected mobile networks. in Proc. IEEE Conf. Sensor and Ad Hoc Communications and Networks (SECON), 235-244.
http://dx.doi.org/10.1109/SAHCN.2004.1381922

Ramanathan, R., Hansen, R., Basu, P., Rosales-Hain, R. and Krishnan, R. (2007); Prioritized Epidemic Routing for Opportunistic Networks. In Proc. of the 1st International MobiSys Workshop on Mobile Opportunistic Networking, ACM, 62-66.
http://dx.doi.org/10.1145/1247694.1247707

Spyropoulos, T., Psounis, K. and Raghavendra, C. (2005); Spray and Wait: An Efficient Routing Scheme for Intermittently Connected Mobile Networks. In Proceedings of the 2005 ACM SIGCOMM Workshop on Delay-Tolerant Networking, ACM, 252-259.
http://dx.doi.org/10.1145/1080139.1080143

Spyropoulos, T., Psounis, K. and Raghavendra, C. S. (2007); Spray and Focus:Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility. In Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops, PerCom Workshops 07, IEEE, 79-85.
http://dx.doi.org/10.1109/PERCOMW.2007.108

Lindgren, A., Doria, A. and Schelen, O. (2004); Probabilistic Routing in Intermittently Connected Networks. In Service Assurance with Partial and Intermittent Resources. Springer, 239-254.
http://dx.doi.org/10.1007/978-3-540-27767-5_24

Vahdat, A., Becker, D. et al. (2000); Epidemic Routing for Partially Connected Ad hoc Networks. Technical report. Technical Report CS-200006, Duke University.

de Oliveira, E. C. and de Albuquerque, C. V. (2009); NECTAR: A DTN Routing Protocol Based on Neighborhood Contact History. In Proceedings of the 2009 ACM symposium on Applied Computing. ACM, 40-46.
http://dx.doi.org/10.1145/1529282.1529290

Bulut, E., Geyik, S. C. and Szymanski, B. K. (2010); Conditional Shortest Path Routing in Delay Tolerant Networks. In IEEE International Symposium on a World of Wireless Mobile and Multimedia Networks (WoWMoM). IEEE, 1-6.
http://dx.doi.org/10.1109/WOWMOM.2010.5534960

Srinivasa, S. and Krishnamurthy, S. (2009); CREST: An Opportunistic Forwarding Protocol Based on Conditional Residual Time. In 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON09, IEEE, 1-9.
http://dx.doi.org/10.1109/SAHCN.2009.5168922

Hua, D., Du, X., Qian, Y. and Yan, S. (2009); A DTN Routing Protocol Based on Hierarchy Forwarding and Cluster Control.In International Conference on Computational Intelligence and Security, CIS09, IEEE, 2: 397-401.
http://dx.doi.org/10.1109/CIS.2009.150

Wang, G., Wang, B. and Gao, Y. (2010); Dynamic Spray and Wait Routing Algorithm with Quality of Node in Delay Tolerant Network. In International Conference on Communications and Mobile Computing (CMC), IEEE, 3: 452-456.
http://dx.doi.org/10.1109/CMC.2010.83

Erramilli, V., et al. (2008); Delegation forwarding. ACM MOBIHOC08, 251-260.
http://dx.doi.org/10.1145/1374618.1374653

Chen, X., et al.(2009); Probability delegation forwarding in delay tolerant networks. IEEE ICCCN09, 1-6.
http://dx.doi.org/10.1109/ICCCN.2009.5235229

T. Spyropoulos, K. Psounis, and C. S. Raghavendra (2007); Utility-based Message Replication for Intermittently Connected Heterogeneous Wireless Networks, in Proc. of IEEE WoWMoM workshop on Autonomic and Opportunistic Communications (AOC), (INRIA Technical Report RR-6129), June 2007.

Ling, S. and Wei, W. (2009); Feedback Adaptive Routing Algorithm for DTN. In WRI International Conference on Communications and Mobile Computing, CMC09, IEEE, 2: 267-271.
http://dx.doi.org/10.1109/CMC.2009.361

Liu, C. and J. Wu (2009); An optimal probabilistic forwarding protocolin delay tolerant networks. ACM MobiHoc 09, 105-114.
http://dx.doi.org/10.1145/1530748.1530763

Ayub, Q., Zahid, M. S. M., Rashid, S., & Abdullah, A. H. (2013); DF++: An adaptive buffer-aware probabilistic delegation forwarding protocol for Delay Tolerant Network. Cluster Computing, 1-8.
http://dx.doi.org/10.1007/s10586-013-0331-2

Qaisar Ayub; M soperi Mohd Zahid; Abdul Hanan Abdullah; Sulma Rashid (2013); Connection frequency buffer aware routing protocol for delay tolerant network. Journal of Electrical Engineering and Technology, 8(3): 649-657.
http://dx.doi.org/10.5370/JEET.2013.8.3.649

Wang, G., Wang, B. and Gao, Y. (2010); Dynamic Spray and Wait Routing Algorithm with Quality of Node in Delay Tolerant Network. In International Conference on Communications and Mobile Computing (CMC), IEEE, 3: 452-456.
http://dx.doi.org/10.1109/CMC.2010.83

Nelson, S. C., Bakht, M. and Kravets, R. (2009); Encounter-Based Routing in DTNs. In IEEE INFOCOM 2009, IEEE, 846-854.
http://dx.doi.org/10.1109/INFCOM.2009.5061994

Elwhishi, Ahmed, Pin-Han Ho, Sagar Naik, and Basem Shihada (2011); Contention aware routing for intermittently connected mobile networks, In AFIN 2011, the third international conference on advances in future internet, 8-15.

Jathar, R. and Gupta, A. (2010); Probabilistic Routing using Contact Sequencing in Delay Tolerant Networks. In 2010 Second International Conference on Communication Systems and Networks (COMSNETS), IEEE, 1-10.
http://dx.doi.org/10.1109/COMSNETS.2010.5432013

Wang, Y., Li, X., & Wu, J. (2010); Multicasting in delay tolerant networks: delegation forwarding. In Global Telecommunications Conference (GLOBECOM 2010), IEEE, 1-5.
http://dx.doi.org/10.1109/GLOCOM.2010.5684272

Keranen, A., Ott, J. and Karkkainen, T. (2009); The ONE Simulator for DTN Protocol Evaluation. Proc. of the 2nd International Conference on Simulation Tools and Techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 1-10.
http://dx.doi.org/10.4108/ICST.SIMUTOOLS2009.5674




DOI: https://doi.org/10.15837/ijccc.2015.3.225



Copyright (c) 2017 Qaisar Ayub, Soperi Mohd Zahid, Sulma Rashid, Abdul Hanan Abdullah

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC-BY-NC  License for Website User

Articles published in IJCCC user license are protected by copyright.

Users can access, download, copy, translate the IJCCC articles for non-commercial purposes provided that users, but cannot redistribute, display or adapt:

  • Cite the article using an appropriate bibliographic citation: author(s), article title, journal, volume, issue, page numbers, year of publication, DOI, and the link to the definitive published version on IJCCC website;
  • Maintain the integrity of the IJCCC article;
  • Retain the copyright notices and links to these terms and conditions so it is clear to other users what can and what cannot be done with the  article;
  • Ensure that, for any content in the IJCCC article that is identified as belonging to a third party, any re-use complies with the copyright policies of that third party;
  • Any translations must prominently display the statement: "This is an unofficial translation of an article that appeared in IJCCC. Agora University  has not endorsed this translation."

This is a non commercial license where the use of published articles for commercial purposes is forbiden. 

Commercial purposes include: 

  • Copying or downloading IJCCC articles, or linking to such postings, for further redistribution, sale or licensing, for a fee;
  • Copying, downloading or posting by a site or service that incorporates advertising with such content;
  • The inclusion or incorporation of article content in other works or services (other than normal quotations with an appropriate citation) that is then available for sale or licensing, for a fee;
  • Use of IJCCC articles or article content (other than normal quotations with appropriate citation) by for-profit organizations for promotional purposes, whether for a fee or otherwise;
  • Use for the purposes of monetary reward by means of sale, resale, license, loan, transfer or other form of commercial exploitation;

    The licensor cannot revoke these freedoms as long as you follow the license terms.

[End of CC-BY-NC  License for Website User]


INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL (IJCCC), With Emphasis on the Integration of Three Technologies (C & C & C),  ISSN 1841-9836.

IJCCC was founded in 2006,  at Agora University, by  Ioan DZITAC (Editor-in-Chief),  Florin Gheorghe FILIP (Editor-in-Chief), and  Misu-Jan MANOLESCU (Managing Editor).

Ethics: This journal is a member of, and subscribes to the principles of, the Committee on Publication Ethics (COPE).

Ioan  DZITAC (Editor-in-Chief) at COPE European Seminar, Bruxelles, 2015:

IJCCC is covered/indexed/abstracted in Science Citation Index Expanded (since vol.1(S),  2006); JCR2018: IF=1.585..

IJCCC is indexed in Scopus from 2008 (CiteScore2018 = 1.56):

Nomination by Elsevier for Journal Excellence Award Romania 2015 (SNIP2014 = 1.029): Elsevier/ Scopus

IJCCC was nominated by Elsevier for Journal Excellence Award - "Scopus Awards Romania 2015" (SNIP2014 = 1.029).

IJCCC is in Top 3 of 157 Romanian journals indexed by Scopus (in all fields) and No.1 in Computer Science field by Elsevier/ Scopus.

 

 Impact Factor in JCR2018 (Clarivate Analytics/SCI Expanded/ISI Web of Science): IF=1.585 (Q3). Scopus: CiteScore2018=1.56 (Q2); Editors-in-Chief: Ioan DZITAC & Florin Gheorghe FILIP.