Abstract
In non-dedicated cooperative relay networks, each node is autonomous and selfish in nature, and thus, spontaneous cooperation among nodes is challenged. A pricing-based cooperation bandwidth allocations (CBAs) algorithm using non-cooperative game is proposed to stimulate the selfish node to cooperate. Firstly, we theoretically analyze the feasible region of charge price and reimbursement price by using geometrical interpretation. Furthermore, we discuss the Nash equilibrium of CBAs under different cases. Meanwhile, the amount of bandwidth that source node forwards data through relay node, and the amount of bandwidth that relay node helps source node to relay data are obtained. Finally, we propose an algorithm by using non-cooperative game theory to realize the pricing-based CBAs. Simulation results show that, compared with no pricing-based incentive, the proposed algorithm can improve source node's energy efficiency measured by bit per Joule, and increase the revenue of relay node.
| Original language | English |
|---|---|
| Pages | 2379-2384 |
| Number of pages | 6 |
| DOIs | |
| State | Published - 2014 |
| Event | 2014 12th IEEE International Conference on Signal Processing, ICSP 2014 - Hangzhou, China Duration: 19 Oct 2014 → 23 Oct 2014 |
Conference
| Conference | 2014 12th IEEE International Conference on Signal Processing, ICSP 2014 |
|---|---|
| Country/Territory | China |
| City | Hangzhou |
| Period | 19/10/14 → 23/10/14 |
UN SDGs
This output contributes to the following UN Sustainable Development Goals (SDGs)
-
SDG 7 Affordable and Clean Energy
Keywords
- Cooperation bandwidth allocations (CBAs)
- Non-cooperative game
- Pricing-based
- Selfish node
Fingerprint
Dive into the research topics of 'A pricing-based cooperation bandwidth allocations algorithm using non-cooperative game theory'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver