2010 Proceedings IEEE INFOCOM 2010
DOI: 10.1109/infcom.2010.5462261
|View full text |Cite
|
Sign up to set email alerts
|

PeopleRank: Social Opportunistic Forwarding

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
176
0
3

Year Published

2011
2011
2021
2021

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 236 publications
(179 citation statements)
references
References 13 publications
0
176
0
3
Order By: Relevance
“…Initial work started at Intel Research Laboratory in Cambridge, and led to the first prototype of the Haggle architecture [19]. This line of research has been advanced in the European Framework Program, which has developed a wide range of routing algorithms that can naturally deal with mobility and exploit social relationships [31,30,20]. Service discovery [13] and opportunistic routing [17] for low duty-cycle lossy wireless sensor networks have been recently studied.…”
Section: Related Workmentioning
confidence: 99%
“…Initial work started at Intel Research Laboratory in Cambridge, and led to the first prototype of the Haggle architecture [19]. This line of research has been advanced in the European Framework Program, which has developed a wide range of routing algorithms that can naturally deal with mobility and exploit social relationships [31,30,20]. Service discovery [13] and opportunistic routing [17] for low duty-cycle lossy wireless sensor networks have been recently studied.…”
Section: Related Workmentioning
confidence: 99%
“…Routing algorithms have been put forward that make use of centrality calculation and community detection to identify better relays for messages [29][30][31].…”
Section: Community Detection and Modularitymentioning
confidence: 99%
“…PeopleRank uses a graph representing user declared social relationships in conjunction with opportunistic contacts to identify central nodes in the network [31]. The centrality metric (PeopleRank) is inspired by the PageRank algorithm used to rank webpages on the Internet [35].…”
Section: Peoplerank Routingmentioning
confidence: 99%
“…However, a centralized credit management system which can be a single point of failure is typically required, as it is challenging to perform distributed credit management in a DTN in the presence of selfish or malicious nodes. On the other hand, there have been several social network based approaches [10][11][12][13][14] to select the best message carrier in DTNs. They considered social relationship and social networking as criteria to select message carriers in DTNs.…”
Section: Introductionmentioning
confidence: 99%
“…Unlike prior work cited above [4][5][6][7][8][9][10][11][12][13][14], we integrate social trust and Quality of Service (QoS) trust into a composite trust metric for determining the best message carrier among new encounters for message forwarding. In this work, we propose the design notion of trust thresholds for determining the trustworthiness of a node acting as a recommender or as the next message carrier, and analyze the best thresholds under which trust-threshold based routing (TTBR) in DTNs would perform the best.…”
Section: Introductionmentioning
confidence: 99%