Game theoretic approach for end-to-end resource allocation in multihop cognitive radio networks
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909466686914560 |
|---|---|
| author | Canales, Maria Ortin, Jorge Gallego, Jose Ramon |
| author_facet | Canales, Maria Ortin, Jorge Gallego, Jose Ramon |
| contents | This paper presents a game theoretic solution for end-to-end channel and power allocation in multihop cognitive radio networks analyzed under the physical interference model. The objective is to find a distributed solution that maximizes the number of flows that can be established in the network. The problem is addressed through three different games: a local flow game which uses complete information about the links of the flow, a potential flow game requiring global network knowledge and a cooperative link game based on partial information regarding the links of the flow. Results show that the proposed link game highly decreases the complexity of the channel and power allocation problem in terms of computational load, reducing the information shared between the links forming each flow with a performance similar to that of the more complex flow games. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_15855 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Game theoretic approach for end-to-end resource allocation in multihop cognitive radio networks Canales, Maria Ortin, Jorge Gallego, Jose Ramon Networking and Internet Architecture This paper presents a game theoretic solution for end-to-end channel and power allocation in multihop cognitive radio networks analyzed under the physical interference model. The objective is to find a distributed solution that maximizes the number of flows that can be established in the network. The problem is addressed through three different games: a local flow game which uses complete information about the links of the flow, a potential flow game requiring global network knowledge and a cooperative link game based on partial information regarding the links of the flow. Results show that the proposed link game highly decreases the complexity of the channel and power allocation problem in terms of computational load, reducing the information shared between the links forming each flow with a performance similar to that of the more complex flow games. |
| title | Game theoretic approach for end-to-end resource allocation in multihop cognitive radio networks |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2501.15855 |