Graph-based D2D communication resource allocation algorithm in full duplex network
For full duplex cellular communication scenario,a resource allocation algorithm based on graph coloring was proposed in order to maximize the throughput of the system.Firstly,the Hungarian algorithm was used to pair the upstream cellular users with the downstream cellular users.The pair of cellular...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2018-10-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2018249/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | For full duplex cellular communication scenario,a resource allocation algorithm based on graph coloring was proposed in order to maximize the throughput of the system.Firstly,the Hungarian algorithm was used to pair the upstream cellular users with the downstream cellular users.The pair of cellular users simultaneously used a resource block for uplink and downlink communication; then,under the premise of guaranteeing the quality of service of cellular users,channels were assigned for D2D (device-to-device) users based on graph theory coloring theory.Simulation results show that the algorithm can improve the system throughput and obtain higher spectral efficiency. |
|---|---|
| ISSN: | 1000-0801 |