Proceedings of the 3nd ACM Workshop on Performance Monitoring and Measurement of Heterogeneous Wireless and Wired Networks 2008
DOI: 10.1145/1454630.1454651
|View full text |Cite
|
Sign up to set email alerts
|

Dynamic reputation-based incentive mechanism considering heterogeneous networks

Abstract: Selfish behavior by users significantly affects the overall performance and degrades the overall connectivity in heterogeneous networks such as Personal Networks (PNs). Incentives are considered one of the best solutions for this situation. This paper proposes a dynamic reputation-based incentive mechanism for cooperative relay in PNs. Based on reputation calculations for individual contributions of intermediate relay nodes in a cooperative relay service, the proposed scheme dynamically assigns incentives in t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2010
2010
2016
2016

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(9 citation statements)
references
References 18 publications
(13 reference statements)
0
4
0
Order By: Relevance
“…An obvious method for efficiently using the available cloud resources is to persuade cloud participants to cooperate among themselves. This cooperation can be enforced in several ways: through a common goal (Huerta-Canepa and Lee 2010), using monetary incentives (Charilas, et al 2011), social incentives (Tanase and Cristea 2011) or reputation incentives (Hwang, Shin and Yoon 2008) (Charilas, et al 2011). The major problem associated with the common goal method (Huerta-Canepa and Lee 2010) is that it does not work in the absence of a common activity among the potential collaborating entities.…”
Section: Cooperation In Cloud Computingmentioning
confidence: 99%
“…An obvious method for efficiently using the available cloud resources is to persuade cloud participants to cooperate among themselves. This cooperation can be enforced in several ways: through a common goal (Huerta-Canepa and Lee 2010), using monetary incentives (Charilas, et al 2011), social incentives (Tanase and Cristea 2011) or reputation incentives (Hwang, Shin and Yoon 2008) (Charilas, et al 2011). The major problem associated with the common goal method (Huerta-Canepa and Lee 2010) is that it does not work in the absence of a common activity among the potential collaborating entities.…”
Section: Cooperation In Cloud Computingmentioning
confidence: 99%
“…Recent work proposed dynamic reputation-based incentives for cooperative relays present in a network topology formed by heterogeneous networks (Hwang, 2008) (Skraparlis, 2009). The incentive for cooperation among nodes can be given either by additional throughput (Hwang, 2008) or by additional time-slots for transmission (Skraparlis, 2009).…”
Section: Operator1mentioning
confidence: 99%
“…These systems tackle different problems in different layers, starting from the networking and routing to the services and applications [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19][20][21]. In this Section, we discuss how the reputation information helps in decision making process; how it is used to implement a reward system and how it improves the quality of cooperation in these systems.…”
Section: Reputation In Various Scenariosmentioning
confidence: 99%
“…The reward implicitly can be considered as "having better connectivity". The reference [8] proposes a dynamic incentive mechanism to motivate the personal network nodes in participating in cooperative relaying. As a reward for cooperative behavior, the nodes receive additional throughput based on reputation calculations for individual contributions.…”
Section: A Encouraging Routing and Forwarding Behaviormentioning
confidence: 99%