Selfish Caching and Facsimile Allocation over a Mobile Ad Hoc Network

Mobile adhoc networks (MANETs) have drawn attention to multitudinous consideration because of the univerality of mobile devices as well as the developments in wireless era. MANET is a peer-to-peer multi hop cellular wireless era community which does not have both difficult and speedy infrastructure and a relevant server. Every vertex of a MANET performs like a router and communicates with every unique. There exist numerous information duplication strategies which were presented to reduce the execution squalor. All are concluded that everyone cell vertices cooperate completely from the perspective of sharing their memory vicinity. But, via a few methods few vertices might additionally behave selfishly and determine simplest to cooperate in part or never with different vertices. The selfish vertices ought to then lessen the overall information approachability within the network. From this work, we try to take a look at the influence of selfish vertices in a mobile ad hoc community in terms of reproduction issuance i.e Selfish nodes are dealt with in replica allocation.

Data replication techniques in the mobile ad hoc networks

Purpose A mobile ad hoc network (MANET) enables providers and customers to communicate without a fixed infrastructure. Databases are extended on MANETs to have easy data access and update. As the energy and mobility limitations of both servers and clients affect the availability of data in MANETs, these data are replicated. The purpose of this paper is to provide a literature review of data replication issues and classify the available strategies based on the issues they addressed. Design/methodology/approach The selected articles are reviewed based on the defined criteria. Also, the differences, the advantages and disadvantages of these techniques are described. The methods in the literature can be categorized into three groups, including cluster-based, location-based and group-based mechanisms. Findings High flexibility and data consistency are the features of cluster-based mechanisms. The location-based mechanisms are also appropriate for replica allocation, and they mostly have low network traffic and delay. Also, the group-based mechanism has high data accessibility compared to other mechanisms. Data accessibility and time have got more attention to data replication techniques. Scalability as an important parameter must be considered more in the future. The reduction of storage cost in MANETs is the main goal of data replication. Researchers have to consider the cost parameter when another parameter will be influenced. Research limitations/implications Data replication in MANETs has been covered in different available sources such as Web pages, technical reports, academic publications and editorial notes. The articles published in national journals and conferences are ignored in this study. This study includes articles from academic main international journals to get the best capability. Originality/value The paper reviews the past and the state-of-the-art mechanisms in data replication in MANET. Exclusively, data replication’s main goal, existing challenges, research terminologies and mechanisms in MANET are summarized using the answers to the research questions. This method will help researchers in the future to develop more effective data replication method in MANET.

Secure Data Replication Management Scheme with Better Data Accessibility

Cloud computing technology has gained substantial research interest, due to its remarkable range of services. The major concerns of cloud computing are availability and security. Several security algorithms are presented in the literature for achieving better security and the data availability is increased by utilizing data replicas. However, creation of replicas for all the data is unnecessary and consumes more storage space. Considering this issue, this article presents a Secure Data Replication Management Scheme (SDRMS), which creates replicas by considering the access frequency of the data and the replicas are loaded onto the cloud server by considering the current load of it. This idea balances the load of the cloud server. All the replicas are organized in a tree like structure and the replicas with maximum hit ratio are placed on the first level of the tree to ensure better data accessibility. The performance of the work is satisfactory in terms of data accessibility, storage exploitation, replica allocation and retrieval time.