Cluster resource assignment algorithm for Device-to-Device networks based on graph coloring
| Affiliation auteurs | !!!! Error affiliation !!!! |
| Titre | Cluster resource assignment algorithm for Device-to-Device networks based on graph coloring |
| Type de publication | Conference Paper |
| Year of Publication | 2017 |
| Auteurs | Guo J, Moalic L, Martin J-N, Caminada A |
| Conference Name | 2017 13TH INTERNATIONAL WIRELESS COMMUNICATIONS AND MOBILE COMPUTING CONFERENCE (IWCMC) |
| Publisher | IEEE; IEEE Spain Sect; Polytechn Univ Valencia |
| Conference Location | 345 E 47TH ST, NEW YORK, NY 10017 USA |
| ISBN Number | 978-1-5090-4372-9 |
| Mots-clés | clustering, Device-to-Device, dynamic resource assignment, Graph coloring, Scalability |
| Résumé | Device-to-Device (D2D) is a promising technique for the future mobile networks and the resource allocation is one of the most crucial problems for its application. In order to efficiently allocate radio resource, the D2D network is organized with clusters such that the adjacent devices are assembled as an one-hop cluster. The cluster resource assignment problem is formulated as a dynamic graph coloring problem, and a graph coloring algorithm is designed from the graph structure point of view. This algorithm is able to allocate radio resource to clusters while they are dynamically generated and deleted. The numerical analysis results show that our algorithm has good performance in resource utilization, runtime and scalability. |