Abstract

Generally In a network you will find selfish nodes , which don‟t want to forward other‟s information, Because of these nodes network performance will decrease drastically, sometimes even it get disconnected. From last few years research is going on this problem, and there are so many solutions were proposed , which are related to some incentive approaches, and some Game theory approaches. But in case of a large social networks implementing these methods are difficult and also becomes more complicated. So Instead of implementing methods on single node, it is better to divide the network into communities. If we divide the social network into some communities we can define some standard method over the communities to improve the network performance against the selfish nodes.

Highlights

  • A day everyone is carrying mobile devices

  • As we know the mobile nodes will not stay in a particular location they will move in random motion

  • Delay Tolerant Network is a network in which the link between any two nodes will not exist always, as the mobile nodes are moving we can‟t assume there exist a path between any two nodes always.In case of mobile nodes there are two constraints that we need to look at: 1.Energy

Read more

Summary

INTRODUCTION

A day everyone is carrying mobile devices. As we know the mobile nodes will not stay in a particular location they will move in random motion. There are several other routing protocols were proposed like Epedemic routing ,simBet routing, Prophet routing. Most of these protocols assumed that there exist a relay node, which will store the information of other nodes, which are in more contact with that relay node in past. It is very likely that there exist a nodes, which don‟t want to spent their resources like energy and memory space for others information. These nodes will degrade the network performance , and the solutions for DTN may not work properly. We need to develop an approach that makes the network perform well under consideration of selfish nodes

COMMUNITY
RELATED WORK
PROBLEM STATE
COMMUNITY DETECTION
Node Centric
Network centric
Agglomerative Approach
Divisive Approach
METHOD BASED ON NODE CENTRALITY
FRIENDSHIP BASE APPROACH
CONLCUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call