Efficient File Search in Delay Tolerant Networks with Social Content and Contact Awareness

International Journal of Research and Scientific Innovation (IJRSI) | Volume V, Issue V, May 2018 | ISSN 2321–2705

Efficient File Search in Delay Tolerant Networks with Social Content and Contact Awareness

Shweta Jadhav¹, Shruti Andurkar², Hemant Sharma³, Dinesh Pore⁴, Ketaki Bhoyar⁵

^1,2,3,4Department of Computer Engineering, D.Y. Patil Institute of Engineering Management & Research, Akurdi, Pune, Maharashtra, India
⁵Assistant Professor, Department of Computer Engineering, D.Y.Patil Institute of Engineering Management & Research, Akurdi, Pune, Maharashtra, India

Abstract — Proficient document inquiry is imperative to the general execution of distributed (P2P) record sharing frameworks. Grouping peers by their basic advantages can fundamentally improve the effectiveness of document question. Bunching peers by their physical vicinity can likewise enhance document question execution. Be that as it may, couple of current works can group peers in light of both companion intrigue and physical nearness. Albeit organized P2Ps give higher document inquiry proficiency than unstructured P2Ps, it is hard to acknowledge it because of their entirely characterized topologies. In this work, we present a Proximity-Aware and Interest bunched P2P document sharing System (PAIS) in view of an organized P2P, which frames physically-close hubs into a bunch and further gatherings physically-close and normal intrigue hubs into a sub-group in light of a various leveled topology. PAIS utilizes a savvy document replication calculation to further upgrade record question proficiency.

I. INTRODUCTION

The wide usage of portable digital devices (e.g., laptops and smart phones) has stimulated significant researches on distributed le search in mobile environments. In this paper, we envision DTNs as a backup network for infrastructure intensive areas or a low-cost communication structure in severe environments, e.g., mountain/rural areas and battle field. For example, even with no network connection, students can acquire course materials from other students mobile devices and drivers can acquire weather and traffic conditions from passing by vehicles. Besides, people or vehicles moving in mountain areas can help forward data, e.g., emails, between villages at a very low cost, i.e., without the need of infrastructures. Thus, in this paper, we focus on distributed peer-to-peer le search in a delay tolerant network (DTN) formed by mobile devices, the holders of which exhibit certain social network properties. However, due to sparse node distribution and non-stop node mobility, DTNs are featured through common community partition and intermittent connections.

Read More