ACO-GA Combined Algorithm for Solving Spectrum Allocation Problem in D2D Communications

被引：1

作者：

He, Chenguang ^{[1
]}

Liang, Tingting ^{[1
]}

Wei, Shouming ^{[1
]}

Meng, Weixiao ^{[1
]}

机构：

[1] Harbin Inst Technol, Commun Res Ctr, Harbin, Heilongjiang, Peoples R China

来源：

COMMUNICATIONS, SIGNAL PROCESSING, AND SYSTEMS | 2018年 / 423卷

关键词：

D2D communication; Spectrum allocation; Ant colony algorithm; Genetic algorithm;

D O I：

10.1007/978-981-10-3229-5_13

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

D2D communication is considered to be one of the key technologies in LTE-A network even in 5G communication system. Spectrum allocation problem is an important part in the study of D2D communication. Considering the spectrum allocation problem under D2D communication scenario, this paper proposes a system model with graph theory and adopt the concept of interference weights. A novel spectrum allocation algorithm ACO-GA combined algorithm is proposed. This algorithm combines ant colony algorithm and modified genetic algorithm based on the theory of graph coloring. Simulation results show that ACO-GA combined algorithm performs superior than traditional ant colony algorithm and genetic algorithm on spectrum efficiency and interference cost.

引用

页码：117 / 125

页数：9

共 13 条

[1] A new grouping genetic algorithm for clustering problems [J].

Agustin-Blas, L. E. ;

Salcedo-Sanz, S. ;

Jimenez-Fernandez, S. ;

Carro-Calvo, L. ;

Del Ser, J. ;

Portilla-Figueras, J. A. .

EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (10) :9695-9703

[2]

[Anonymous], 2009, VTC SPRING 2009 IEEE

[3]

Asadi A., 2014, IEEE COMMUN SURV TUT

[4] On a parallel genetic-tabu search based algorithm for solving the graph colouring problem [J].

Ben Mabrouk, Bchira ;

Hasni, Hamadi ;

Mahjoub, Zaher .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 197 (03) :1192-1201

[5] Clustering and selecting suppliers based on simulated annealing algorithms [J].

Che, Z. H. .

COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2012, 63 (01) :228-238

[6] Complexity issues in vertex-colored graph pattern matching [J].

Dondi, Riccardo ;

Fertin, Guillaume ;

Vialette, Stephane .

JOURNAL OF DISCRETE ALGORITHMS, 2011, 9 (01) :82-99

[7]

Liotou E, 2014, IEEE INT WORKSH COMP, P360, DOI 10.1109/CAMAD.2014.7033266

[8]

Liu J, 2014, INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND MANAGEMENT ENGINEERING (ITME 2014), P1

[9]

Ouerfelli L., 2011, INT C COMM COMP CONT

[10] Graph Coloring Approach for Hiding of Information [J].

Pal, Sanjay Kumar ;

Sen Sarma, Samar .

2ND INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATION, CONTROL AND INFORMATION TECHNOLOGY (C3IT-2012), 2012, 4 :272-277

← 1 2 →