Performance Evaluation System of Spectrum Allocation Protocols Based on Probability Distribution Vector

Shi Wang; Hao Lan; Xiaoying Zhu; Min Zhang; Zhishan Zeng

doi:10.3788/LOP202259.1306001

Journals >Laser & Optoelectronics Progress >Volume 59 >Issue 13 >Page 1306001 > Article

Laser & Optoelectronics Progress
Vol. 59, Issue 13, 1306001 (2022)

Performance Evaluation System of Spectrum Allocation Protocols Based on Probability Distribution Vector

Shi Wang¹, Hao Lan^1、2、*, Xiaoying Zhu¹, Min Zhang¹, and Zhishan Zeng¹

Author Affiliations

¹School of Electronic and Information Engineering, Liaoning Technical University, Huludao 125100, Liaoning , China

²Institute of graduate, Liaoning Technical University, Huludao 125100, Liaoning , China

show less

DOI: 10.3788/LOP202259.1306001 Cite this Article Set citation alerts

Shi Wang, Hao Lan, Xiaoying Zhu, Min Zhang, Zhishan Zeng. Performance Evaluation System of Spectrum Allocation Protocols Based on Probability Distribution Vector[J]. Laser & Optoelectronics Progress, 2022, 59(13): 1306001 Copy Citation Text

show less

Fig. 1. Structure of the system

Download full size

Fig. 2. Allocation tree of 3 channels for 2 users under two allocation protocols. (a) RAP; (b) ERAP

Download full size

Fig. 3. Transmission process of SU data packets

Download full size

Fig. 4. Simulation process

Download full size

Fig. 5. Average delay for different SU cache sizes

Download full size

Fig. 6. Average length SU under different numbers of arriving packets

Download full size

Fig. 7. Throughput of SU under different total number of arriving packets

Download full size

Fig. 8. Rejection rate of SU under different total number of arriving packets

Download full size

Algorithm 1：random allocation protocol
Input： $N$ ，M
Output：distribution result matrix $D$
1：set $D = 0$ （ $d_{j, i} = 0$ ，for all $i$ and $j$ ）
2：for $j = 1$ to $M$ do
3：set $a$ from $\{1, \dots, N\}$ with equal probabilities
4：set $d_{j, a} \leftarrow 1$
5：end for

Table 1. Flow of the RAP algorithm

Algorithm 2：equitable and random allocation protocol
Input： $N$ ，M
Output：distribution result matrix $D$
1：set $D = 0$ （ $d_{j, i} = 0$ ，for all $i$ and $j$ ）
2：set priority user list： $l = \{1, \dots, N\}$
3：for $j = 1$ to $M$ do
4：set $a$ from $l$ with equal probabilities
5：set $d_{j, a} \leftarrow 1$
6：remove $a$ from $l$
7：if $l$ is empty then
8：set $l \leftarrow \{1, \dots, N\}$
9：end if
10：end for

Table 2. Flow of the ERAP algorithm

Parameter	Value setting
PU occupation $P_{P U}$	$[\begin{matrix} 0.5 & 0.5 \\ 0.5 & 0.5 \end{matrix}]$
Number of channel states $C$	4
Channel state transition matrix $M_{t}$	$[\begin{matrix} 0.25 & 0.25 & 0.25 & 0.25 \\ 0.25 & 0.25 & 0.25 & 0.25 \\ 0.25 & 0.25 & 0.25 & 0.25 \\ 0.25 & 0.25 & 0.25 & 0.25 \end{matrix}]$
Modulation scheme $M_{k}$	$\{\begin{array}{l} M_{0} = [0.5,0.5,0, 0] \\ M_{1} = [0.2,0.5,0.3,0] \\ M_{2} = [0.2,0.3,0.3,0.2] \\ M_{3} = [0.1,0.2,0.3,0.4] \end{array}$
Simulation time $S_{T}$	$1000$ time slots
Maximum number of packets arriving per time slot $m$	$1$

Table 3. Setting of environmental parameters

Simulation code	User number	Buffer size $K_{i}$	Total number of packets arrived $S_{P}$	SU arrival process probability vector $α_{i}$
Simulation 1	U1	10‒35	600	$(0.4,0.6)$
Simulation 1	U2	10‒35	400	$(0.6,0.4)$
Simulation 2	U1	7	370‒610	$(0.63,0.37) ‒ (0.39,0.61)$
	U2	10
	U3	7
	U4	10
Simulation 3	U1	7	670‒1000	$(0.33,0.67) ‒ (0,1)$
	U2	10
	U3	10
	U4	10

Table 4. Setting of SU parameters

Download Citation

Set citation alerts for the article

Tools

Set citation alerts for the article

Save the article for my favorites

Paper Information