A Novel Replica Allocation Approach Depth-First Iterative-Deepening for Handling Selfishness in MANETs

Abstract: In mobile unexpected networks (MANET), nodes move freely and therefore the distribution of access requests changes dynamically. Duplicate allocation in such a dynamic atmosphere may be a important challenge. The communication price has become an outstanding issue influencing the performance of duplicate allocation within the MANET environment. In reality, however, some nodes might egotistically decide solely to work part, or not in the least, with alternative nodes. These selfish nodes may then scale back the knowledge accessibility within the network. In this paper, the impact of selfish nodes in a very mobile unexpected network from the angle of duplicate allocation is examined. This can be termed as selfish duplicate allocation. Especially, a selfish node detection formula is developed during this research work that considers partial selfishness and novel replica allocation technique to properly deal with selfish replica allocation. Depth-First Iterative-Deepening formula is used during this in this work for higher performance.

Keywords: MANET, Replica Allocation, Mobility, Selfish node detection, Depth-First Iterative-Deepening