Advanced SearchSearch Tips
Connection Frequency Buffer Aware Routing Protocol for Delay Tolerant Network
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Connection Frequency Buffer Aware Routing Protocol for Delay Tolerant Network
Ayub, Qaisar; Mohd Zahid, M. Soperi; Abdullah, Abdul Hanan; Rashid, Sulma;
  PDF(new window)
DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.
Store-carry-forward;Routing protocols;Delay Tolerant Network;Algorithm;
 Cited by
Contact quality based forwarding strategy for delay tolerant network, Journal of Network and Computer Applications, 2014, 39, 302  crossref(new windwow)
Kevin Fall, Stephen Farrell.DTN: an architectural retrospective, IEEE Journal on Selected Areas in Communications, Vol. 5, No. 56, pp. 828-836, 2008.

Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra, Single- Copy Routing in Intermittently Connected Mobile Networks. SECON'04. pp. 235-244, 2004.

Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra, Efficient routing in intermittently connected mobile networks: the multiplecopy case, IEEE/ACM Transactions on Networking, Vol. 16, No. 1, pp. 77-90, 2008. crossref(new window)

Vahdat, A., & Becker, D., Epidemic routing for partially connected ad hoc networks. Duke University, Tech. Rep, 2008.

Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra, Spray and wait: an efficient routing scheme for intermittently connected mobile networks. WDTN '05, 2005.

Thrasyvoulos Spyropoulos, Konstantinos Psounis, Cauligi S. Raghavendra, Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility. PERCOMW '07, pp. 79-85, 2007.

Guizhu Wang, Bingting Wang, Yongzhi Gao, Dynamic Spray and Wait Routing algorithm with Quality of Node in Delay Tolerant Network. CMC'10, pp. 452- 456, 2010.

A.Lindgren, A. Doria, and O. Schelen, Probabilistic routing in intermittently connected networks, SIGMOBILE Mobile Computing and Communication Review, 2003.

Sunil Srinivasa and Sudha Krishnamurthi, CREAST: An opportunistic forwarding protocol based on conditional residual time. SECON'09. pp. 1-9, 2009.

Wei Gao, Guohong Cao, On exploiting transient contact patterns for data forwarding in Delay Tolerant Networks. ICNP'10, pp.193-202, 2010.

Jathar Rugved,Arobinda Gupta, Probabilistic Routing using Contact Sequencing in Delay Tolerant Networks,COMSNETS'10, pp. 1-10, 2010.

Etienne C. R. de Oliveira and C' elio V. N. de Albuquerque, NECTAR: A DTN Routing Protocol Based on Neighborhood Contact History, SAC '09. pp. 8-12, 2008.

Keranen, A., J. Ott, and T. Karkkainen. The ONE simulator for DTN protocol evaluation,ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering), 2009.

N. Banerjee, M. D. Corner, and B. N. Levine. An Energy-Efficient Architecture for DTN Throwboxes. In Proc. IEEE Infocom, Amherst May 2007.

Shouyi Yin,Xiaokang Lin. Traffic self-similarity in mobile ad hoc networks. Second IFIP International Conference on Wireless and Optical Communications Networks, June 2005.