Analysis of Hungarian-Based Algorithms Utilization

for Ant Colony Theory for Resource Allocation in

Cognitive Radio Network

Supervisor Co-supervisor
Dr. Nachwan Mufti Adriansyah, S.T., MT. Vinsensius Sigit Prabowo, S.T,. MT.
NIP. 99750182-1 NIP : 18930092-3

Ade Nugroho 1101164561

 INTRODUCTION

BASIC THEORY

SISTEM MODEL

SIMULATION AND RESULT

CONCLUSION

www.telkomuniversity.ac.id | www.apkit.co.id 2
 INTRODUCTION

www.telkomuniversity.ac.id | www.apkit.co.id 3
 Introduction

Background
BACKGROUND

• Increasing demand for Cognitive Radio Network

applications makes frequency spectrum very difficult to
manage
• How to increase the utilization of the spectrum frequency
using Cognitive Radio Network
• Resource allocation algorithms are an important way of
cultivating cognitive radio systems

www.telkomuniversity.ac.id | 4
 Introduction

RESEARCH PURPOSE

• Optimizes the allocation resource of Ant Colony algorithm

by looking at the parameters who compared with
Hungarian and Greedy algorithms.
• Knowing how Ant Colony algorithm works in general.

www.telkomuniversity.ac.id | 5
 Previous Research

Previous Research Why Ant Colony Algorithm?

In some of the previous

research, Ant Colony
Algorithm using fitness
function after the ants
finding the right path to
choose.
Unique ways to find the
best value, using intensity
of pheromone.

www.telkomuniversity.ac.id | www.apkit.co.id 6
 Introduction

SCOPE OF PROBLEMS
1. The research focuses on the CRN communication system and frequency spectrum
channels according to the system designed, the research is only in the form of a
program simulation on Matlab, does not discuss direct implementation.
2. The method used is the Ant Colony algorithm and Hungarian Algorithm in
optimizing resource allocation with certain parameters.
3. This study explain the Primary User and Secondary User on one channel, with
good performance and QoS results for each user and minimizing the interference
that occurs.
4. One cell has 2 types of users, there are Primary User (PU) and Secondary User
(SU).
5. The results of performance parameters to be analyzed are sum rate, spectral
efficiency, energy efficiency, and fairness
www.telkomuniversity.ac.id | 7
BASIC THEORY
 Basic Theory

Cognitive Radio Network

Cognitive Radio Network (CRN) is

communication system that changes
its transmission parameters
according to the environment where
it operates. Apart from adjusting the
frequency and bandwidth
parameters, CRN communication
can adjust the power and modulation
parameters

www.telkomuniversity.ac.id | 9
 Cognitive Radio Network

Primary User Secondary User

Primary User (PU) is a user who Secondary User (SU) is a user

already has a license to operate who does not have a license to
in a certain spectrum band that operate in the desired spectrum
has been determined by the band.
government. PU operation cannot
be interrupted by the activity of
secondary user

www.telkomuniversity.ac.id | www.apkit.co.id 10
RESEARCH METHODOLOGY
& SYSTEM MODEL
 Research Methodology & System Model

Research Methodology Flowchart

www.telkomuniversity.ac.id | 12
 Research Methodology & System Model
Design System

• The simulaton process begins with the modeling of

the system modeled with a random user deployment
on cells with a 300 meters with 10-50 Primary
Users (PU) and 10-50 Secondary Users (SU)

• The system works when Primary User allocates

Resource Block(RB) to Secondary User that is
randomly distributed.

• (Primary user and secondary user )are considered

not moving (fixed user).

Figure: Model system in a single cell OFDMA

www.telkomuniversity.ac.id | 13
 Ant Colony
Algorithm

www.telkomuniversity.ac.id | www.apkit.co.id 14
 Basic Theory

Ant Colony Algorithm

Steps Devided by 2

Step 1 Finding Path

Ant Colony Algorithm is a technique of
taking the best path by using pheromone
intensity who produced by ants.

www.telkomuniversity.ac.id | 15
 Basic Theory

Ant Colony Algorithm

Step 2 Update Local Pheromone
After the ants determine the path and arrive at
their destination, the process of returning the
ants to the starting point and updating the
pheromone value occurs, with the equation

Where Tijl is the pheromone concentration parameter and

ρ is the pheromone evaporation coefficient where ρ has a
value (o <ρ <1).
www.telkomuniversity.ac.id | 16
 Hungarian
Algorithm

www.telkomuniversity.ac.id | www.apkit.co.id 17
 Research Methodology & System Model

Simulation Parameters
Parameter Nilai

Radius Cell 300 meter

Frekuensi Carrier 1.8 GHz

Bandiwdth 180KHz

Daya Transmit PU 0.1

Daya Transmit SU 0.1

Fading Rayleigh dan Lognormal Random

Jumlah TTI per pengamatan 1500

Jumlah user PU 10-50 User dengan kenaikan 5 user persimulasi

Jumlah user SU 10-50 user dengan kenaikan 5 user persimulasi

www.telkomuniversity.ac.id | 18
 Research Methodology & System Model

Performance Parameters
  Data Rate = B )

  SE =

  EE =

  Fairness =

www.telkomuniversity.ac.id | 19
SIMULATION RESULTS & ANALYSIS
 Simulation Result & Analysis

Scenario
  Parameter

PU User SU User SU Distance

Scenario 1 50 10 – 50 with 5 30 meter

times
increments

Scenario 2 10-50 with 5 50 30 meter

times
increments

www.telkomuniversity.ac.id | 21
 Simulation Result & Analysis

Result for Sum Rate Scenario 1

Sumrate x 108(b/s) ∆Ant ∆Ant
Colony- Colony-
Greedy Hungari
Jumlah an
SU
Ant Ant Greedy Hungaria    
Colony Colony n
Max Min

10 1,0404 1,0682 1,0586 1.0595 -0.0186 -0.0190

15 1,0651 1,0532 1,0803 1.0392 -0.0152 0.02586
20 1,3370 1,3453 1,3447 1.3887 -0.0767 -0.051
25 1,1943 1,1700 1,2058 1.1735 -0.0115 0.0208
30 1,2707 1,1743 1,2885 1.2317 -0.0178 0.03904
35 1,2196 1,1309 1,2233 1.1631 -0.0372 0.05649
40 1,4810 1,3614 1,4894 1.4873 -0.0840 -0.0628
45 1,3751 1,1779 1,3917 1.3270 -0.0165 0.04805
50 1,7248 1,4870 1,7369 1.7189 -0.0121 0.05896

Figure of Sum rate Rata- 1.300 1.218 1.313 1.287 -0.013 0.013
rata

www.telkomuniversity.ac.id | 22
 Simulation Result & Analysis

Result for Average value data rate Scenario 1

Data rate x 106(b/s) ∆Ant ∆Ant
Colony Colony
Max- Max-
Greedy Hungari
Jumlah an
SU
Ant Ant Greedy Hungaria    
Colony Colony n
Max Min

10 1.7341 1.7804 1.7644 1.7659 -0.0303 -0.0318

15 1.6386 1.6203 1.6621 1.5988 -0.0235 0.0976
20 1.9101 1.9219 1.9210 1.9838 -0.0109 -0.0737
25 1.5924 1.5601 1.6078 1.5646 -0.0154 0.0278
30 1.5884 1.4679 1.6107 1.5396 -0.0377 0.0488
35 1.4348 1.3305 1.4392 1.3683 -0.0084 0.0665
40 1.6455 1.5126 1.6549 1.6525 -0.0094 0.007
45 1.4475 1.2399 1.4649 1.3969 -0.0174 0.0506
50 1.7248 1.4870 1.7369 1.7189 -0.0121 0.0059
Rata- 1.635 1.546 1.651 1.621 -0.013 0.013
rata
Figure of data rate average value

www.telkomuniversity.ac.id | 23
 Simulation Result & Analysis

Result for Spectral Efficiency Scenario 1

Efesiensi Spektral (b/s) ∆Ant ∆Ant
Colony Colony
Max- Max-
Greedy Hungaria
Jumlah
n
SU
Ant Ant Greedy Hungarian    
Colony Colony
Max Min
10
11.56076 11.86937 11.76267 11.772821 -0.2019 -0.21206
15
11.83465 11.70247 12.00424 11.547312 -0.16958 0.287342
20
14.85637 14.94827 14.94167 15.43003 -0.0853 -0.57366
25
13.2702 13.00109 13.39865 13.039071 -0.12845 0.231131
30
14.11946 13.04886 14.31768 13.68558 -0.19822 0.43388
35
13.55132 12.56666 13.59266 12.923567 -0.04134 0.627753
40
16.45596 15.1269 16.54939 16.525767 -0.09343 -0.06981
45
15.27941 13.08823 15.46351 14.745456 -0.1841 0.533959
50
19.16448 16.52234 19.29947 19.098958 -0.13499 0.065521

Figure of Spectral Efficiency Rata-rata 14.454 13.541 14.592 14.307 -1.2373 1.32406

www.telkomuniversity.ac.id | 24
 Simulation Result & Analysis

Result for Energy Efficiency Scenario 1

Efesiensi Energi x 106(b/s) ∆Ant ∆Ant
Colony Colony
Max- Max-
Greedy Hungari
Jumlah an
SU
Ant Ant Greedy Hungaria    
Colony Colony n
Max Min

10 1.4863 1.52606 1.5123 1.5136 -0.0259 -0.0272

15 1.4201 1.40429 1.4405 1.3856 -0.0203 0.03448
20 1.6713 1.68168 1.6809 1.7358 -0.0959 -0.0645
25 1.4050 1.37658 1.4186 1.3806 -0.0136 0.0244
30 1.4119 1.30488 14317 1.3685 -0.0198 0.0433
35 1.2838 1.19052 1.2877 1.2243 -0.03916 0.0594
40 1.4810 1.36142 1.3524 1.4873 -0.0840 -0.0628
45 1.3096 1.12184 1.4894 1.2638 -0.0157 0.0457
50 1.5680 1.35182 1.5790 1.5626 -0.0110 0.0536
Rata- 1.448 1.368 1.462 1.435 -0.014 -0.013
Figure of Fairness rata

www.telkomuniversity.ac.id | 25
 Simulation Result & Analysis

Result for Fairness Scenario 1

Efesiensi Energi x 106(b/s) ∆Ant ∆Ant
Colony Colony
Max- Max-
Greedy Hungaria n
Jumlah SU

Ant Colony Ant Greedy Hungarian    

Max Colony
Min

10
0.818913 0.740702 0.816046 0.807521 0.002867 0.011391
15
0.853459 0.777415 0.845217 0.814322 0.008242 0.039137
20
0.727919 0.636088 0.744294 0.708809 -0.01637 0.01911
25
0.83183 0.729419 0.830805 0.826021 0.001025 0.00581
30
0.735657 0.663233 0.743027 0.749662 -0.00737 -0.01401
35
0.770438 0.715877 0.776025 0.792674 -0.00559 -0.02224
40
0.772762 0.717621 0.787993 0.778861 -0.01523 -0.0061
45
0.698891 0.639995 0.705714 0.73032 -0.00682 -0.03143
50
0.735259 0.626891 0.741371 0.746816 -0.00611 -0.01156

Figure of Fairness Rata-rata 0.7716 0.6941 0.7767 0.7727 -0.0051 -0.0011

www.telkomuniversity.ac.id | 26
 Simulation Result & Analysis

Result for Sum Rate Scenario 2

Sumrate x 107(b/s) ∆Ant ∆Ant
Colony Colony
Max- Max-
Greedy Hungari
Jumlah an
SU
Ant Ant Greedy Hungaria    
Colony Colony n
Max Min

10 3.0948 2.9496 3.1034 3.2026 -0.0086 -0.1078

15 3.9724 3.307 3.969 3.7939 0.0034 0.1785
20 4.8163 4.5597 4.8892 4.6769 -0.0729 0.1394
25 5.3205 5.4088 5.3504 5.1619 -0.0299 0.1586
30 6.5694 6.2304 6.3633 6.338 0.2061 0.2314
35 8.4056 8.2905 8.5118 8.5721 -0.1062 -0.1665
40 8.5288 8.3975 8.1203 7.5448 0.4085 0.984
45 9.0476 9.1613 9.0172 8.9467 0.0304 0.1009
50 1.078 1.0983 1.0938 1.1062 -0.0158 -0.0282
Rata- 5.648 5.489 5.602 5.482 -0.0051 -0.0011
Figure of Total Datarate rata

www.telkomuniversity.ac.id | 27
 Simulation Result & Analysis

Result for Average value of data rate Scenario 2 Data rate x 106(b/s) ∆Ant ∆Ant
Colony Colony
Max- Max-
Greedy Hungari
Jumlah an
SU
Ant Ant Greedy Hungaria    
Colony Colony n
Max Min

10 1.547 1.4748 1.5517 1.6013 -0.0047 -0.0543

15 1.5889 1.3228 1.5876 1.5175 0.0013 0.0714
20 1.6054 1.5199 1.6297 1.5589 -0.0243 0.0465
25 1.5201 1.5453 1.5287 1.4748 -0.0086 0.0453
30 1.6423 1.5576 1.5908 1.5845 0.0515 0.0578
35 1.8679 1.8423 1.8915 1.9049 -0.0236 -0.037
40 1.7057 1.6795 1.624 1.5089 0.0817 0.1968
45 1.645 1.6657 1.6395 1.6266 0.0055 0.0184
50 1.7967 1.8305 1.8231 1.8437 -0.0264 -0.047
Rata- 1.657 1.6042 1.6518 1.5425 -0.00524
Figure of average value of data rate rata 0.2979

www.telkomuniversity.ac.id | 28
 Simulation Result & Analysis

Result for Spectral Efficiency Scenario 2

Efesiensi Spektral (b) ∆Ant Colony ∆Ant Colony
Max-Greedy Max-
Hungaria n

Jumlah SU

Ant Colony Ant Greedy Hungarian    

Max Colony
Min

10
17.19348 16.38704 17.241 17.79237 -0.04752 -0.59889
15
14.71276 12.24823 14.70006 14.05158 0.012699 0.661182
20
13.37869 12.66644 13.58128 12.99146 -0.20259 0.387237
25
11.82352 12.01967 11.88993 11.47109 -0.06641 0.352425
30
12.16571 11.53788 11.78398 11.73704 0.381735 0.428671
35
13.34232 13.15966 13.51084 13.60661 -0.16852 -0.2643
40
11.84569 11.66326 11.27828 10.47898 0.567412 1.366715
45
11.16991 11.31035 11.13245 11.04541 0.037456 0.124495
50
11.9782 12.20384 12.15414 12.29156 -0.17594 -0.31336
Figure of Spectral Efficiency Rata-rata 13.0678 12.5773 13.0302 12.8295 0.0376
0.2383

www.telkomuniversity.ac.id | 29
 Simulation Result & Analysis

Result for Energy Efficiency Scenario 2 Efesiensi Energi x 107 (b/s) ∆Ant ∆Ant
Colony Colony
Max- Max-
Greedy Hungari
Jumlah an
SU
Ant Ant Greedy Hungaria    
Colony Colony n
Max Min

10 1.0316 0.9832 1.0344 1.0675 -0.0028 -0.0359

15 1.1349 0.9448 1.134 1.0839 0.0009 0.051
20 1.2041 1.1399 1.2223 1.1692 -0.0182 0.0349
25 1.1823 1.2019 1.1889 1.1471 -0.0066 0.0352
30 1.3138 1.246 1.2726 1.2676 0.0412 0.0462
35 1.5283 1.5073 1.5476 1.5585 -0.0193 -0.0302
40 1.4214 1.3995 1.3533 1.2574 0.0681 0.164
45 1.3919 1.4094 1.3872 1.3764 0.0047 0.0155
50 1.54005 1.569 1.5626 1.5803 -0.02255 -0.04025
Figure of Efeciency Energy Rata-
rata 1.3053 1.266 1.3003 1.2786 0.005 0.0267

www.telkomuniversity.ac.id | 30
 Simulation Result & Analysis

Result for fairness Scenario 2 Efesiensi Energi x 107 (b/s) ∆Ant ∆Ant
Colony Colony
Max- Max-
Greedy Hungaria
Jumlah n
SU
Ant Ant Greedy Hungarian    
Colony Colony
Max Min

10 0.75601 0.7035 0.758119 0.749241 -0.00211 0.006769

15
0.676371 0.668152 0.688579 0.754751 -0.01221 -0.07838
20
0.758388 0.711888 0.755278 0.713098 0.00311 0.045291
25
0.856693 0.775642 0.865953 0.874026 -0.00926 -0.01733
30
0.735197 0.718172 0.7645 0.796514 -0.0293 -0.06132
35
0.793404 0.734765 0.783882 0.78023 0.009522 0.013174
40
0.643915 0.59974 0.665444 0.715923 -0.02153 -0.07201
45
0.812034 0.753204 0.814949 0.795371 -0.00291 0.016663
Figure of Efeciency Energy 50
0.807734 0.712474 0.82788 0.79682 -0.02015 0.010914
Rata-rata
0.7599 0.70861 0.7693 0.7751 -0.0094 -0.0152

www.telkomuniversity.ac.id | 31
 Simulation Result & Analysis
Comparison Scenario & Analysis

Algoritma
Skenario Performansi
Ant Colony Ant Colony Min Greedy Hungarian

Sumrate (x 108
1.300 1.218 1.313 1.287
b/s)
SU
E. Spectral (b) 14.454 13.541 14.592 14.307 Algoritma Ant Colony having
10-50
user E. Energy (x 10
1.448 1.368 1.462 1.435
the best performance system
7
b/sWatt)
for the scenario 2 which is
Fairness 0.7716 0.6491 0.7767 0.7727
variety of the PU users, and
Sumrate (x 107
b/s)
5.648 5.489 5.602 5.482 having less performance in
PU
E. Spectral (b) 13.0678 12.5773 13.0303 12.8295 scenario 1.
10-50
User E. Energy(x 107
1.3053 1.266 1.3003 1.2786
b/sWatt)

Fairness 0.7599 0.70861 0.7693 0.7751

www.telkomuniversity.ac.id | 32
CONCLUSIONS & SUGGESTION
 Conclusion and Suggestion

Conclusion
• The Ant Colony algorithm with the maximum value is the main algorithm with the comparison algorithm
Greedy, Hungarian, Ant Colony taking the minimum value.
• Perhitungan CSI merupakan perhitungan total sistem yang nantinya akan menjadi inputan bagi algoritma
alokasi, dan menjadi output dari perhitungan pathloss, SINR, SNR, Jarak pada nodes, dll.
• The Ant Colony algorithm has the highest value on the increase sumrate of PU users with an average
sumrate value of 5,658 x 107 b/ s, has the highest value on the average data rate with a value of 1,657 x 10 7
b/s, has a Spectral Efficiency value The highest increase in PU users with an average value of 12.0678 b, has
an Energy Efficiency value in the increase in PU with an average value of 1.3053 x 10 7 b/s, and has an
average fairness value of -0.0015 from the Hungarian algorithm.

www.telkomuniversity.ac.id | 34
 Conclusion and Suggestion

Suggestion
• Using other algorithms to improve the performance of the Cognitive
Radio Network system.
• Modify the simulation using other scenarios so that the results obtained
are more varied.

www.telkomuniversity.ac.id | 35
 THANK YOU 

www.telkomuniversity.ac.id | www.apkit.co.id 36