Efficient File Search for Social Ad-Hoc Networks with Self Replica Allocation Reduction Algorithm

Abstract: In this paper analysis Social Ad hoc networks (SANETs) have attracted a lot of attention due to the popularity of mobile devices and the advances in wireless communication technologies. A SANET is a peer-to-peer multi-hop social wireless network that has neither a fixed infrastructure nor a central server. Each node in a SANET acts as a router, and communicates with each other. A large variety of SANET applications have been developed. For example, a SANET can be used in special situations, where installing infrastructure may be difficult, or even infeasible, such as a battlefield or a disaster area. A mobile peer-to-peer file sharing system is another interesting SANET application. In reality, however, some nodes may selfishly decide only to co-operate partially, or not at all, with other nodes. These selfish nodes could then reduce the overall data accessibility in the network. This paper examines the impact of selfish nodes in a social ad hoc network from the perspective of replica allocation. This is termed as selfish replica allocation. In particular, a selfish node detection algorithm is developed that considers partial selfishness and novel replica allocation techniques to properly cope with selfish replica allocation. The conducted simulations demonstrate the proposed approach outperforms traditional cooperative replica allocation techniques in terms of data accessibility, communication cost, and average query delay.

Keywords: Social Ad-hoc Network, Social Content, Replication Allocation, Reduction Model, SCF-T