IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference 2008
DOI: 10.1109/glocom.2008.ecp.37
|View full text |Cite
|
Sign up to set email alerts
|

Bilateral Shapley Value Based Cooperative Gateway Selection in Congested Wireless Mesh Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2009
2009
2023
2023

Publication Types

Select...
3
2
1

Relationship

2
4

Authors

Journals

citations
Cited by 9 publications
(9 citation statements)
references
References 5 publications
0
9
0
Order By: Relevance
“…For example, calculation numbers have reached to 2 10 − 1 = 1023 as coalition has prosuemrs |N | = 10. In order to solve the problem, bilateral Shapley value (BSV) is proposed by Ketchpel, which solves combinatorial explosion via bilateral-marginalization of coalition [33]. Primarily, bilateral coalition is defined as: assume that S = S 1 ∪ S 2 ⊆ N and S 1 ∩ S 2 = ∅, then S 1 and S 2 are called S's bilateral coalition.…”
Section: Distribution Mechanism Of Energy Costmentioning
confidence: 99%
“…For example, calculation numbers have reached to 2 10 − 1 = 1023 as coalition has prosuemrs |N | = 10. In order to solve the problem, bilateral Shapley value (BSV) is proposed by Ketchpel, which solves combinatorial explosion via bilateral-marginalization of coalition [33]. Primarily, bilateral coalition is defined as: assume that S = S 1 ∪ S 2 ⊆ N and S 1 ∩ S 2 = ∅, then S 1 and S 2 are called S's bilateral coalition.…”
Section: Distribution Mechanism Of Energy Costmentioning
confidence: 99%
“…As the selected paths must satisfy the reliability level required by the client (R r ), thereby among the set of available paths from the gateways to the client, those which can not satisfy the client reliability requirement level are excluded from the set (i.e., selected paths should satisfy R p ≥ R r ). Thereafter, the Game Theory technique used in [5] is utilized to select a set of paths from the remaining available paths. This technique can be implemented in a decentralized fashion which reduces the process complexity.…”
Section: B Deciding Cycle (Dc)mentioning
confidence: 99%
“…Here, utility refers to the relative gain of a path in participating in a coalition and is related to the end-to-end throughput. Note that in [5] instead of normal Shapley Value, Bilateral Shapley Value (BSV) is used to avoid the exponential increase in complexity. Since the data rate contribution of each path must be allocated in a fair manner, a bargaining game theory is incorporated to offer a Pareto efficient equilibrium solution for data rate contribution among the participating paths.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…In the DC, a decision is taken, which results in the satisfaction of the aforementioned goals based on perceived information in the PC and LC. The utilized technique in the DC is an optimization mechanism based on the Game Theory from one of our previous works [4], which facilitates cooperation among neighboring MAPs and MPs for routing. It concurrently selects the best set from the available paths and allocates their data rate contributions.…”
Section: Introductionmentioning
confidence: 99%