Performance Analysis of Selfish Nodes in Mobile Ad-hoc Networks
|Sheethal Sunny1, Dr.C.D.Suriyakala2
|Related article at Pubmed, Scholar Google|
Mobile Ad-hoc Networks is a collection of wireless network that can dynamically form a network to exchange information. Dynamic topology of MANETs may result in network partition. Network partition of mobile nodes in one network may not be able to access data hosted by nodes in other network. Due to the node’s non cooperative action, such node’s refuses to cooperate fully in sharing its memory space with other nodes. But some of the nodes may decide not to co-operate with other nodes. Such behavior of these nodes considered as selfish may degrade the performance the network or in data accessibility. MANETs performance is mostly dependent on collaboration of all nodes, detection of selfish node is essential task in MANETs in order to improve the performance. This paper highlights novel methods to detect selfish nodes through selfish node detection algorithm that considers partial selfishness and replica allocation techniques to cope with selfish replica allocation. The proposed approach outperforms cooperative replica allocation in terms of improves the data accessibility, reduces the communication cost.