An Adaptive Caching Technique Using Learning Automata in Disruption Tolerant Networks

In Disruption Tolerant Network(DTN), determining the exact location of data and amount of delay to query the data by a requester is a major concern. It is costly for a node to maintain information of opportunistic paths to every other node in a DTN. Identifying appropriate caching locations is a difficult task. In this paper, we propose a technique for selecting the nodes for caching data based on the past performance of the respective nodes so that data queries can be fulfilled with less delay. In the proposed scheme, initially a Connected Dominating Set(CDS) is selected which serves as virtual backbone for the network. The CDS serves as the initial probable set of caching nodes. Further, an accurate caching set has been determined using a learning method called Learning Automata(LA). A Least Recently Used cache replacement method is used for replacing the data from the buffer of caching nodes, once the buffer is filled. The caching nodes cache the data generated by source node and forwards the data to other caching nodes. A requester node broadcasts the data query to the neighbors and the query is replied by a caching node. Simulation results show the efficacy of the proposed approach in terms of data delivery ratio and packet delay.

[1]  Rahim Tafazolli,et al.  Delay-/Disruption-Tolerant Networking State of the Art and Future Challenges , 2009 .

[2]  P. Pardalos,et al.  Handbook of Combinatorial Optimization , 1998 .

[3]  Vinton G. Cerf,et al.  Delay-tolerant networking: an approach to interplanetary Internet , 2003, IEEE Commun. Mag..

[4]  Li-hua Zhang,et al.  DTN earliest-delivery routing algorithm based on routing reliability , 2012, 2012 IEEE 14th International Conference on Communication Technology.

[5]  Peng-Jun Wan,et al.  New distributed algorithm for connected dominating set in wireless ad hoc networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.

[6]  Mohammad S. Obaidat,et al.  Adaptive wireless networks using learning automata , 2011, IEEE Wireless Communications.

[7]  Donghyun Kim,et al.  Constructing Minimum Connected Dominating Sets with Bounded Diameters in Wireless Networks , 2009, IEEE Transactions on Parallel and Distributed Systems.

[8]  Mandayam A. L. Thathachar,et al.  Parallel algorithms for modules of learning automata , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[9]  Chadi Assi,et al.  Disruption-Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges , 2012, IEEE Communications Surveys & Tutorials.

[10]  Mohammad S. Obaidat,et al.  On the use of learning automata in the control of broadcast networks: a methodology , 2002, IEEE Trans. Syst. Man Cybern. Part B.

[11]  N. Benamar,et al.  Routing protocols for DTN in vehicular environment , 2012, 2012 International Conference on Multimedia Computing and Systems.

[12]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[13]  Guohong Cao,et al.  Cooperative Caching for Efficient Data Access in Disruption Tolerant Networks , 2014, IEEE Transactions on Mobile Computing.

[14]  P. Venkata Krishna,et al.  Learning automata as a utility for power management in smart grids , 2013, IEEE Communications Magazine.

[15]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[16]  Jun Liu,et al.  Adaptive Spray and Wait Routing Based on Relay-Probability of Node in DTN , 2012, 2012 International Conference on Computer Science and Service System.

[17]  Jeong-Hun Jang,et al.  Position-Based DTN Routing in metropolitan bus network , 2012, 2012 International Conference on Systems and Informatics (ICSAI2012).

[18]  P. Pardalos,et al.  The Maximum Clique Problem , 1999, Handbook of Combinatorial Optimization.

[19]  Ming-Jer Tsai,et al.  Distributed Algorithm for Efficient Construction and Maintenance of Connected k-Hop Dominating Sets in Mobile Ad Hoc Networks , 2008, IEEE Transactions on Mobile Computing.

[20]  Gunnar Karlsson,et al.  Wireless Ad Hoc Podcasting , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[21]  Jie Wu,et al.  On Maximizing the Lifetime of Wireless Sensor Networks Using Virtual Backbone Scheduling , 2012, IEEE Transactions on Parallel and Distributed Systems.

[22]  Jörg Ott,et al.  Simulating Mobility and DTNs with the ONE (Invited Paper) , 2010, J. Commun..

[23]  Kumpati S. Narendra,et al.  Learning Automata - A Survey , 1974, IEEE Trans. Syst. Man Cybern..

[24]  Augustin Chaintreau,et al.  The age of impatience: optimal replication schemes for opportunistic networks , 2009, CoNEXT '09.

[25]  Jie Wu,et al.  Predict and relay: an efficient routing in disruption-tolerant networks , 2009, MobiHoc '09.

[26]  Young-Bae Ko,et al.  FFRDV: Fastest-Ferry Routing in DTN-enabled Vehicular Ad Hoc Networks , 2009, 2009 11th International Conference on Advanced Communication Technology.

[27]  J. Ott,et al.  Simulating Mobility and DTNs with the ONE , 2010 .

[28]  Weili Wu,et al.  Minimum connected dominating sets and maximal independent sets in unit disk graphs , 2006, Theor. Comput. Sci..

[29]  Georgios I. Papadimitriou,et al.  Learning automata-based receiver conflict avoidance algorithms for WDM broadcast-and-select star networks , 1996, TNET.

[30]  Vivek Tiwari,et al.  Lacas: learning automata-based congestion avoidance scheme for healthcare wireless sensor networks , 2009, IEEE Journal on Selected Areas in Communications.