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!
|