Selfish Less Replica Allocation in MANET

Provided by: International Journal of Computer Applications
Topic: Mobility
Format: PDF
Most of the protocols and algorithms used in MANET, are assuming that all mobile nodes cooperate fully with the functionalities of the network. But some nodes are cooperate partially or not at all cooperating. Network performance and data accessibility, accessing time, query delay are affected by these selfish nodes. The discussion of this paper is about, representing a Replica server which solves the selfishness. The Replica server monitors and maintains the status of all mobile nodes in the network. If it finds any selfish node in the shortest path between source and destination, the replica server will analyze the reason for selfishness and it finds solution.

Find By Topic