Replica Allocation in MANET’s by Handling Selfish Nodes

2014 ◽  
Vol 15 (1) ◽  
pp. 41-47
Author(s):  
Sravanthi Nanumasa ◽  
◽  
Ravi Mathey
Keyword(s):  
Selfish Nodes ◽  
Replica Allocation

scholarly journals Selfish Caching and Facsimile Allocation over a Mobile Ad Hoc Network

2019 ◽  
Vol 8 (6S3) ◽  
pp. 1953-1958
Keyword(s):  
Mobile Devices ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Peer To Peer ◽  
Selfish Nodes ◽  
Replica Allocation ◽  
Adhoc Networks ◽  
Mobile Ad Hoc ◽  
Few Vertices

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.

An Emotion-driven Negotiation Mechanism of Selfish Nodes in the MANETs

2011 ◽  
Vol 33 (6) ◽  
pp. 1294-1300
Author(s):  
Yang Yang ◽  
Xue-song Qiu ◽  
Luo-ming Meng ◽  
Zhi-peng Gao
Keyword(s):  
Selfish Nodes ◽  
Negotiation Mechanism

Detection of Selfish Nodes in Networks Using CoopMAC Protocol with ARQ

2010 ◽  
Vol 9 (7) ◽  
pp. 2328-2337 ◽  
Author(s):  
Sintayehu Dehnie ◽  
Stefano Tomasin
Keyword(s):  
Selfish Nodes

A Game Theoretic Approach to Thwart Selfishness Attack in MANET

2012 ◽  
Vol 433-440 ◽  
pp. 3944-3948
Author(s):  
Prasenjit Choudhury ◽  
Anita Pal ◽  
Anjali Gupchup ◽  
Krati Budholiya ◽  
Alokparna Banerjee
Keyword(s):  
Ad Hoc ◽  
Theoretic Approach ◽  
Selfish Nodes ◽  
Selfish Behavior ◽  
Mutual Cooperation ◽  
Game Theoretic ◽  
Hoc Networks ◽  
High Level ◽  
The Impact ◽  
Game Theoretic Approach

Ad-hoc networks are attractive, since they can provide a high level of connectivity without the need of a fixed infrastructure. Nodes that are not within the same transmission range communicate through multi-hops, where intermediate nodes act as relays. Mutual cooperation of all the participating nodes is necessary for proper operation of MANET. However, nodes in MANET being battery-constrained, they tend to behave selfishly while forwarding packets. In this paper, we have investigated the security of MANET AODV routing protocol by identifying the impact of selfish nodes on it. It was observed that due to the presence of selfish nodes, packet loss in the network increases and the performance of MANET degrades significantly. Finally a game theoretic approach is used to mitigate the selfishness attack. All the nodes in MANET should cooperate among themselves to thwart the selfish behavior of attacker nodes.

Sign in / Sign up

Export Citation Format

Share Document