Affiliations M.Tech (CSE), Department of Computer Science & Engineering, NRI Institute of TechnologyAssociatet Professor, Department of Computer Science & Engineering, NRI Institute of Technology
- Disruption tolerant networks are described by low node stupidity, erratic node versatility, and absence of worldwide
system data. The vast majority of flow examination deliberations in DTNs concentrate on information sending, however just
restricted work have been carried out on giving effective information access to Mobile clients. In this paper, we propose a novel
methodology to help cooperative caching in Disruption tolerant networks, which empowers the offering and coordination of
stored information among different nodes and diminishes information access delay. Our essential thought is to deliberately
reserve information at a set of network central locations (NCLs),), which can be effectively gotten to by different nodes in the
system. We propose an effective plan that guarantees proper NCL choice focused around a probabilistic determination metric
and directions numerous reserving hubs to upgrade the trade-off between information availability and storing overhead.
Y.KANAKADURGARAO,BABURAO KOPURI [M.Tech, MISTE,(MBA)]."Efficient Data Access in Disruption Tolerant Network using bolster Catching". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 10,pp.842-846, October - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I1009.pdf,
 A. Balasubramanian, B. Levine, and A. Venkataramani, â€œDTN Routing as a Resource Allocation Problem,â€ Proc. ACM SIGCOMM Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm, pp. 373-384, 2007
 P. Cao and S. Irani, â€œCost-Aware WWW Proxy Caching Algorithms,â€ Proc. USENIX Symp. Internet Technologies and Systems, 1997.
 A. Chaintreau, P. Hui, J. Crowcroft, C. Diot, R. Gass, and J. Scott,â€œImpact of Human Mobility on Opportunistic Forwarding Algorithms,â€ IEEE Trans. Mobile Computing, vol. 6, no. 6,pp. 606-620, June 2007.
 P. Costa, C. Mascolo, M. Musolesi, and G. Picco, â€œSocially Aware Routing for Publish-Subscribe in DelayTolerant Mobile Ad Hoc Networks,â€ IEEE J. Selected Areas in Comm., vol. 26, no. 5, pp. 748-760, June 2008.
 E. Daly and M. Haahr, â€œSocial Network Analysis for Routing in Disconnected Delay-Tolerant MANETs,â€ Proc. ACM MobiHoc,2007.
 H. Dubois-Ferriere, M. Grossglauser, and M. Vetterli, â€œAge Surface Monitoring,â€ Proc. ACM Sixth Ann.Intâ€™l Conf. Mobile Systems, Applications and Services (MobiSys), 2008.
 V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, â€œDiversity of Forwarding Paths in Pocket Routered Networks,â€ Proc. Seventh ACM SIGCOMM Conf. Internet Measurement (IMC), pp. 161-174,2007.
 V. Erramilli, A. Chaintreau, M. Crovella, and C. Diot, â€œDelegation Forwarding,â€ Proc. ACM MobiHoc, 2008.
 K. Fall, â€œA Delay-Tolerant Network Architecture for Challenged Internets,â€ Proc. ACM SIGCOMM Conf. Applications, Technologies, Architectures, and Protocols for Computer Comm., pp. 27-34, 2003.
 L. Fan, P. Cao, J. Almeida, and A. Broder, â€œSummary Cache: A Scalable Wide-Area Web Cache Sharing Protocol,â€ IEEE/ACM Trans. Networking, vol. 8, no. 3, pp. 281-293, June 2000.
 M. Fiore, F. Mininni, C. Casetti, and C.F. Chiasserini, â€œTo Cache or Not to Cache?â€ Proc. IEEE INFOCOM, pp. 235-243, 2009.
 W. Gao and G. Cao, â€œOn Exploiting Transient Contact Patterns for Data Forwarding in Delay Tolerant Networks,â€ Proc. IEEE Intâ€™l Conf. Network Protocols (ICNP), pp. 193-202, 2010.Matters: Efficient Route Discovery in Mobile Ad Hoc Networks Using Encounter Ages,â€ Proc. ACM MobiHoc, pp. 257-266, 2003.
 J. Eriksson, L. Girod, B. Hull, R. Newton, S. Madden, and H.Balakrishnan, â€œThe Pothole Patrol: Using a Mobile Sensor Network for Road
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.