LAMPIRAN 1 LIST PROGRAM FEA

import java.text.NumberFormat; import java.util.Random; import java.util.Vector; /* * To change this license header, choose License Headers in Project Properties.

LAMPIRAN 1

LIST PROGRAM FEA

To change this template file, choose Tools | Templates * and open the template in the editor.
/ /**
@author Bevan */ public class FAP{ public static void main (String args []){ int space = 6; int jumlah_kanal=64; int number_cell = 17; double []traf = new double [number_cell]; Vector vect = new Vector(); int [][] distance = new int [17][17]; distance [0] [0] =

6 ; distance [0] [1] = 2 ; distance [0] [2] = 1 ; distance [0] [3] = 2 ; distance [0] [4] = 2 ; distance [0] [5] = 1 ; distance [0] [6] = ; distance [0] [7] = ; distance [0] [8] = ; distance [0] [9] = ; distance [0] [10] = ; distance [0] [11] = ; distance [0] [12] = ; distance [0] [13] = ; distance [0] [14] = ; distance [0] [15] = ; distance [0] [16] = ; distance [1] [0] = 2 ; distance [1] [1] =

6 ; distance [1] [2] = 2 ; distance [1] [3] = 1 ; distance [1] [4] = 2 ; distance [1] [5] = 2 ; distance [1] [6] = 1 ; distance [1] [7] = ; distance [1] [8] = ; distance [1] [9] = ; distance [1] [10] = ; distance [1] [11] = ; distance [1] [12] = ; distance [1] [13] = ; distance [1] [14] = ; distance [1] [15] = ; distance [1] [16] = ; distance [2] [0] = 1 ; distance [2] [1] =

2 ; distance [2] [2] = 6 ; distance [2] [3] = ; distance [2] [4] = 1 ; distance [2] [5] =

2 ; distance [2] [6] = 2 ; distance [2] [7] = 1 ; distance [2] [8] = ; distance [2] [9] = ; distance [2] [10] = ; distance [2] [11] = ; distance [2] [12] = ; distance [2] [13] = ; distance [2] [14] = ; distance [2] [15] = ; distance [2] [16] = ; distance [3] [0] = 2 ; distance [3] [1] =

1 ; distance [3] [2] = ; distance [3] [3] = 6 ; distance [3] [4] =

2 ; distance [3] [5] = 1 ; distance [3] [6] = ; distance [3] [7] = ; distance [3] [8] = ; distance [3] [9] = 2 ; distance [3] [10] =

1 ; distance [3] [11] = ; distance [3] [12] = ; distance [3] [13] = ; distance [3] [14] = ; distance [3] [15] = ; distance [3] [16] = ; distance [4] [0] =

2 ; distance [4] [1] = 2 ; distance [4] [2] = 1 ; distance [4] [3] = 2 ; distance [4] [4] = 6 ; distance [4] [5] = 1 ; distance [4] [6] = ; distance [4] [7] = ; distance [4] [8] =

2 ; distance [4] [9] = 2 ; distance [4] [10] = 1 ; distance [4] [11] = ; distance [4] [12] = ; distance [4] [13] = ; distance [4] [14] = ; distance [4] [15] = ; distance [4] [16] = ; distance [5] [0] = 1 ; distance [5] [1] =

2 ; distance [5] [2] = 2 ; distance [5] [3] = 1 ; distance [5] [4] = 2 ; distance [5] [5] = 6 ; distance [5] [6] = 2 ; distance [5] [7] = 1 ; distance [5] [8] = ; distance [5] [9] = 1 ; distance [5] [10] =

2 ; distance [5] [11] = 2 ; distance [5] [12] = 1 ; distance [5] [13] = ; distance [5] [14] = ; distance [5] [15] = ; distance [5] [16] = ; distance [6] [0] = ; distance [6] [1] = 1 ; distance [6] [2] =

2 ; distance [6] [3] = ; distance [6] [4] = 1 ; distance [6] [5] =

2 ; distance [6] [6] = 6 ; distance [6] [7] = 2 ; distance [6] [8] = 1 ; distance [6] [9] = ; distance [6] [10] = ; distance [6] [11] =

2 ; distance [6] [12] = 2 ; distance [6] [13] = 1 ; distance [6] [14] = ; distance [6] [15] = ; distance [6] [16] = ; distance [7] [0] = ; distance [7] [1] = ; distance [7] [2] = 1 ; distance [7] [3] = ; distance [7] [4] = ; distance [7] [5] =

1 ; distance [7] [6] = 2 ; distance [7] [7] = 6 ; distance [7] [8] = 2 ; distance [7] [9] = ; distance [7] [10] = ; distance [7] [11] =

1 ; distance [7] [12] = 2 ; distance [7] [13] = 2 ; distance [7] [14] = 1 ; distance [7] [15] = ; distance [7] [16] = ; distance [8] [0] = ; distance [8] [1] = ; distance [8] [2] = ; distance [8] [3] = ; distance [8] [4] = ; distance [8] [5] = ; distance [8] [6] = 1 ; distance [8] [7] =

2 ; distance [8] [8] = 6 ; distance [8] [9] = ; distance [8] [10] = ; distance [8] [11] = ; distance [8] [12] = 1 ; distance [8] [13] =

2 ; distance [8] [14] = 2 ; distance [8] [15] = ; distance [8] [16] = ; distance [9] [0] = ; distance [9] [1] = ; distance [9] [2] = ; distance [9] [3] = 2 ; distance [9] [4] =

2 ; distance [9] [5] = 1 ; distance [9] [6] = ; distance [9] [7] = ; distance [9] [8] = ; distance [9] [9] = 6 ; distance [9] [10] =

2 ; distance [9] [11] = 1 ; distance [9] [12] = ; distance [9] [13] = ; distance [9] [14] = ; distance [9] [15] = 2 ; distance [9] [16] =

1 ; distance [10] [0] = ; distance [10] [1] = ; distance [10] [2] = ; distance [10] [3] = 1 ; distance [10] [4] =

2 ; distance [10] [5] = 2 ; distance [10] [6] = 1 ; distance [10] [7] = ; distance [10] [8] = ; distance [10] [9] =

2 ; distance [10] [10] = 6 ; distance [10] [11] = 2 ; distance [10] [12] = 1 ; distance [10] [13] = ; distance [10] [14] = ; distance [10] [15] =

2 ; distance [10] [16] = 2 ; distance [11] [0] = ; distance [11] [1] = ; distance [11] [2] = ; distance [11] [3] = ; distance [11] [4] = 1 ; distance [11] [5] = 2 ; distance [11] [6] = 2 ; distance [11] [7] = 1 ; distance [11] [8] = ; distance [11] [9] = 1 ; distance [11] [10] =

2 ; distance [11] [11] = 6 ; distance [11] [12] = 2 ; distance [11] [13] = 1 ; distance [11] [14] = ; distance [11] [15] = 1 ; distance [11] [16] =

2 ; distance [12] [0] = ; distance [12] [1] = ; distance [12] [2] = ; distance [12] [3] = ; distance [12] [4] = ; distance [12] [5] = 1 ; distance [12] [6] =

2 ; distance [12] [7] = 2 ; distance [12] [8] = 1 ; distance [12] [9] = ; distance [12] [10] = 1 ; distance [12] [11] =

2 ; distance [12] [12] = 6 ; distance [12] [13] = 2 ; distance [12] [14] = 1 ; distance [12] [15] = ; distance [12] [16] = 1 ; distance [13] [0] = ; distance [13] [1] = ; distance [13] [2] = ; distance [13] [3] = ; distance [13] [4] = ; distance [13] [5] = ; distance [13] [6] =

1 ; distance [13] [7] = 2 ; distance [13] [8] = 2 ; distance [13] [9] = ; distance [13] [10] = ; distance [13] [11] =

1 ; distance [13] [12] = 2 ; distance [13] [13] = 6 ; distance [13] [14] = 2 ; distance [13] [15] = ; distance [13] [16] = ; distance [14] [0] = ; distance [14] [1] = ; distance [14] [2] = ; distance [14] [3] = ; distance [14] [4] = ; distance [14] [5] = ; distance [14] [6] = ; distance [14] [7] = 1 ; distance [14] [8] = 2 ; distance [14] [9] = ; distance [14] [10] = ; distance [14] [11] = ; distance [14] [12] = 1 ; distance [14] [13] =

1 ; distance [14] [14] = 6 ; distance [14] [15] = ; distance [14] [16] = ; distance [15] [0] = ; distance [15] [1] = ; distance [15] [2] = ; distance [15] [3] = ; distance [15] [4] = ; distance [15] [5] = ; distance [15] [6] = ; distance [15] [7] = ; distance [15] [8] = ; distance [15] [9] = 2 ; distance [15] [10] =

2 ; distance [15] [11] = 1 ; distance [15] [12] = ; distance [15] [13] = ; distance [15] [14] = ; distance [15] [15] = 6 ; distance [15] [16] =

2 ; distance [16] [0] = ; distance [16] [1] = ; distance [16] [2] = ; distance [16] [3] = ; distance [16] [4] = ; distance [16] [5] = ; distance [16] [6] = ; distance [16] [7] = ; distance [16] [8] = ; distance [16] [9] = 1 ; distance [16] [10] =

2 ; distance [16] [11] = 2 ; distance [16] [12] = 1 ; distance [16] [13] = ; distance [16] [14] = ; distance [16] [15] =

2 ; distance [16] [16] = 6 ; for(int aa=0;aa<1000;aa++){ double[] traffics = { 5, 10, 15, 20, 17, 18, 12, 6, 9, 11, 4, 6, 5, 2, 10, 3, 1, 7, 8, 13}; Allocation [] cell_user = new Allocation [number_cell]; //initialisasi for (int i=0; i <number_cell ; i ++) { cell_user [i] = new Allocation (); Random r = new Random (); int index = r.nextInt(16); cell_user[i].setTraffic(traffics [index]); // Set which cell user belongs to. cell_user[i].setCell(i); cell_user[i].setAllocation(false); cell_user[i].setBeginner(false); if(i==0){ cell_user[i].addAdj(1);cell_user[i].addAdj(3);cell_user[i].addAdj(4); }else if(i==1){ cell_user[i].addAdj(0);cell_user[i].addAdj(2);cell_user[i].addAdj(4);cell_user[i].addAdj(5); }else if(i==2){ cell_user[i].addAdj(1);cell_user[i].addAdj(6);cell_user[i].addAdj(7); }else if(i==3){ cell_user[i].addAdj(1);cell_user[i].addAdj(4);cell_user[i].addAdj(10); }else if(i==4){ cell_user[i].addAdj(0);cell_user[i].addAdj(1);cell_user[i].addAdj(5);cell_user[i].addAdj(11);cell_user [i].addAdj(10); }else if(i==5){ cell_user[i].addAdj(1);cell_user[i].addAdj(2);cell_user[i].addAdj(6);cell_user[i].addAdj(11);cell_user [i].addAdj(10);cell_user[i].addAdj(4); }else if(i==6){ cell_user[i].addAdj(2);cell_user[i].addAdj(7);cell_user[i].addAdj(12);cell_user[i].addAdj(11);cell_us er[i].addAdj(5); }else if(i==7){ cell_user[i].addAdj(6);cell_user[i].addAdj(8);cell_user[i].addAdj(13);cell_user[i].addAdj(12); }else if(i==8){ cell_user[i].addAdj(7);cell_user[i].addAdj(14);cell_user[i].addAdj(13); }else if(i==9){ cell_user[i].addAdj(3);cell_user[i].addAdj(4);cell_user[i].addAdj(10);cell_user[i].addAdj(15); }else if(i==10){ cell_user[i].addAdj(4);cell_user[i].addAdj(5);cell_user[i].addAdj(11);cell_user[i].addAdj(16);cell_us er[i].addAdj(15);cell_user[i].addAdj(9); }else if(i==11){ cell_user[i].addAdj(5);cell_user[i].addAdj(6);cell_user[i].addAdj(12);cell_user[i].addAdj(16);cell_us er[i].addAdj(10); }else if(i==12){ cell_user[i].addAdj(6);cell_user[i].addAdj(7);cell_user[i].addAdj(13);cell_user[i].addAdj(11); }else if(i==13){ cell_user[i].addAdj(7);cell_user[i].addAdj(8);cell_user[i].addAdj(14);cell_user[i].addAdj(12); }else if(i==14){ cell_user[i].addAdj(8);cell_user[i].addAdj(13); }else if(i==15){ cell_user[i].addAdj(9);cell_user[i].addAdj(10);cell_user[i].addAdj(16); }else if(i==16){ cell_user[i].addAdj(10);cell_user[i].addAdj(11);cell_user[i].addAdj(15); } } //alokasi

//Initial allocation, the biggest pheromon //cek sorting, s menyimpan urutan besar ke kecil int s[]=Sort(cell_user); // for(int u=0;u<s.length;u++){ // System.out.println(cell_user[s[u]].getTraffic()); // } for (int i=0;i<number_cell;i++){ int newch=0; int count=0; int x=s[i]; //mencari chanel awal for(int y=0;y<jumlah_kanal;y++){ //cek interferensi if(checkInterference(cell_user,x,newch)){ newch++; }else{ break; } } int z=jumlah_kanal/space+1; for(int y=0;y<jumlah_kanal;y++){ //cek interferensi if(count<cell_user[x].getTraffic() && newch<jumlah_kanal){ cell_user[x].addChannel(newch); count++; newch=newch+space; }else{ cell_user[x].setBlocking(((cell_user[x].getTraffic()- count)/cell_user[x].getTraffic())*100); break; } } } /* if(checkInterference(cell_user, 1, 6)){ System.out.println("Interference"); }else{ System.out.println("Tidak Interference"); }*/ // boolean solution =false; // int n = largestNumbers(cell_user); /*while(solution==false){ n = largestNumbers(cell_user); //alokasi sel awal cell_user[n].getTraffic(); for(int i=0;i<number_cell;i++){ } }*/

//Cek kanal sel n for(int i=0;i<number_cell;i++){ System.out.print( "Sel :"+i + " Trafik: "+cell_user[i].getTraffic()+" kanal :"); for(int c=0;c<cell_user[i].getChannel().size();c++){ System.out.print(" " +(int)cell_user[i].getChannel().get(c)); } System.out.println("---------------"+cell_user[i].getBlocking()+"%"); } double avBlock=0; for(int i=0;i<number_cell;i++){ avBlock=avBlock+cell_user[i].getBlocking(); } System.out.println("Blocking rata-rata:----------"+avBlock/number_cell+"%"); /* //cek status user for (int i=0; i <number_cell;i++){ System.out.print ("Sel no :"+cell_user[i].getCell()+" jumlah Traffic:"+ cell_user[i].getTraffic()); if (cell_user[i].getAllocation()==false){ System.out.println (" belum teralokasi"); }else{ System.out.println (" telah teralokasikan"); } }*/ vect.add(avBlock/number_cell); } for(int ii=0;ii<vect.size();ii++){ System.out.println("Iterasi: "+ii+" blocking: "+(double)vect.get(ii)); } } private static int largestNumbers(Allocation[] cell_user) { double [] traf = new double[cell_user.length]; for (int i = 0 ; i <cell_user.length; i ++){ if(cell_user[i].getBenginner()==true); traf [i] = 0; traf [i] = cell_user[i].getTraffic(); } int in=0; double largeNumber = traf[0]; for (int i = 0; i < traf.length; i++) { if (traf[i] > largeNumber) { largeNumber = traf[i]; } } boolean c=false; for (int j = 0; j < traf.length; j++) { if(largeNumber == traf[j] && c==false){ in=j; c=true; //System.out.println("largest number index "+j); } } return in; } //Sorting private static int[] Sort(Allocation[] v1){ double[] num=new double[v1.length]; int[] num1=new int[v1.length]; for(int x=0;x<v1.length;x++){ num[x]=v1[x].getTraffic(); num1[x]=x; } int n = v1.length; int k; for (int m = n; m >= 0; m--) { for (int i = 0; i < n - 1; i++) { k = i + 1; if (num[i] < num[k]) { double temp = num[i]; num[i] = num[k]; num[k] = temp; int temp1 = num1[i]; num1[i] = num1[k]; num1[k] = temp1; } } } return num1; } // metode chek interferensi kanal private static Boolean checkInterference (Allocation []a, int in_cell,int kanal){ Boolean interference = false; Vector adj = a [in_cell].getAdj(); for (int i=0;i<adj.size();i++){ Vector ch=a[(int)adj.get(i)].getChannel(); if (ch.size()>0){ for (int j=0;j<ch.size();j++){ // System.out.println(kanal+":"+(int)ch.get(j)); if(Math.abs(kanal-(int)ch.get(j))<2){ interference = true; } } } } return interference; } }

import java.text.NumberFormat; import java.util.Random; import java.util.Vector; /* * To change this license header, choose License Headers in Project Properties.

LAMPIRAN 2

LIST PROGRAM FEA

To change this template file, choose Tools | Templates * and open the template in the editor.
/ /**
@author Bevan */ public class ParticleSwarm{ public static void main (String args []){ int space =6; Vector vect=null; int jumlah_kanal=64; int number_cell = 17; double []traf = new double [number_cell]; int [][] distance = new int [17][17]; distance [0] [0] =