Resource Allocation With Frequency Reuse Using Matlab
Resource Allocation With Frequency Reuse Using Matlab
Resource Allocation With Frequency Reuse Using Matlab
MATLAB
by
Ahmed Abdelhadi
Virginia Tech
Table of Contents
List of Figures iv
Chapter 1. Introduction 1
1.1 Motivation, Background, and Related Work . . . . . . . . . . . 1
1.2 Sample of Users’ Applications Utilities . . . . . . . . . . . . . 2
Bibliography 15
ii
List of Tables
iii
List of Figures
iv
Chapter 1
Introduction
This review article provides steps for plotting the figures provided in the pub-
lished paper [3]. This article starts with a brief background on the problem
of resource allocation. A literature review is included for readers interested
in further reading on the topic. The utilities used in the MATLAB code for
our resource allocation with frequency reuse algorithm is mentioned. Finally,
a step by step MATLAB guide for implementing the algorithm in [1] is pre-
sented.
1
battery life and embedded-based QoS improvement were discussed.
Elastic traffic, i.e. delay tolerant traffic, [24, 55] was the focus of resource
allocation optimization problem, e.g. proportional fairness [56–58], and max-
min fairness [59–62]. Optimal solution for resource allocation with elastic
traffic was presented in [63–66] and approximate solutions were presented in
[67–69]. Optimal solution using convex optimization [70] for inelastic traffic,
i.e. real-time applications, was introduced in [71]. This work was extended
with many applications per user in [72–78].
Non-convex optimization methods for carrier aggregation scenarios were pre-
sented in [79–83]. The resource allocation optimal solution with carrier aggre-
gation was introduced for this problem in [84–88]. Per the President Council
of Advisers on Science and Technology (PCAST) recommendations [89], car-
rier aggregation between underutilized spectrum and over crowded spectrum is
crucial for future spectrum sharing [90–92]. The sharing of radar band [93,94]
with cellular band [95,96] was suggested by the Federal Communications Com-
mission (FCC). In [97–99], the interference effects of radar and communications
coexistence was studied by the National Telecommunications and Information
Administration (NTIA). A particular study on radar/comm coexistence prob-
lem [100–103] with optimal allocation was presented in [104–106].
The simulation tools provided in this article can be extended to the prob-
lem in [107–109] for machine to machine communications (M2M), in [110] for
multi-cast network, in [111–114] for ad-hoc network, and in [115–118] for other
wireless networks.
2
Figure 1.1: A sample of Applications’ Utilities [2]
2 d = 1./(1+exp(a.*b));
3 y(i) = c(i).*(1./(1+exp(-a(i).*(x-b(i))))-d(i));
3
Table 1.1: Users and their utilities [1]
Sector 1 eNodeB A
A1 Sig a = 3, b = 10.0 A4 Log k = 1.1, rmax = 100
A2 Sig a = 3, b = 10.3 A5 Log k = 1.2, rmax = 100
A3 Sig a = 1, b = 10.6 A6 Log k = 1.3, rmax = 100
Sector 2 eNodeB A
A7 Sig a = 3, b = 10 A10 Log k = 1, rmax = 100
A8 Sig a = 3, b = 11 A11 Log k = 2, rmax = 100
A9 Sig a = 1, b = 12 A12 Log k = 3, rmax = 100
Sector 3 eNodeB A
A13 Sig a = 3, b = 15.1 A16 Log k = 10, rmax = 100
A14 Sig a = 3, b = 15.3 A17 Log k = 11, rmax = 100
A15 Sig a = 3, b = 15.5 A18 Log k = 12, rmax = 100
Sector 1 eNodeB B
B1 Sig a = 3, b = 10.9 B4 Log k = 1.4, rmax = 100
B2 Sig a = 3, b = 11.2 B5 Log k = 1.5, rmax = 100
B3 Sig a = 1, b = 11.5 B6 Log k = 1.6, rmax = 100
Sector 2 eNodeB B
B7 Sig a = 3, b = 13 B10 Log k = 4, rmax = 100
B8 Sig a = 3, b = 14 B11 Log k = 5, rmax = 100
B9 Sig a = 1, b = 15 B12 Log k = 6, rmax = 100
Sector 3 eNodeB B
B13 Sig a = 3, b = 15.7 B16 Log k = 13, rmax = 100
B14 Sig a = 3, b = 15.9 B17 Log k = 14, rmax = 100
B15 Sig a = 3, b = 17.3 B18 Log k = 15, rmax = 100
Sector 1 eNodeB C
C1 Sig a = 3, b = 11.8 C4 Log k = 1.7, rmax = 100
C2 Sig a = 3, b = 12.1 C5 Log k = 1.8, rmax = 100
C3 Sig a = 1, b = 12.4 C6 Log k = 1.9, rmax = 100
Sector 2 eNodeB C
C7 Sig a = 3, b = 16 C10 Log k = 7, rmax = 100
C8 Sig a = 3, b = 17 C11 Log k = 8, rmax = 100
C9 Sig a = 1, b = 18 C12 Log k = 9, rmax = 100
Sector 3 eNodeB C
C13 Sig a = 3, b = 17.5 C16 Log k = 16, rmax = 100
C14 Sig a = 3, b = 17.7 C17 Log k = 17, rmax = 100
C15 Sig a = 3, b = 17.9 C18 Log k = 18, rmax = 100
4
3 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
4 k11 = [ 1.1 1.2 1.3]’;
5 a11 = [ 3 3 1 ]’;
6 b11 = [ 10.0 10.3 10.6 ]’;
7 %%%%% Sector 1 eNodeB 2 %%%%%%%%%%%%%%%
8 k21 = [ 1.4 1.5 1.6]’;
9 a21 = [ 3 3 1 ]’;
10 b21 = [ 10.9 11.2 11.5 ]’;
11 %%%%% Sector 1 eNodeB 3 %%%%%%%%%%%%%%%
12 k31 = [ 1.7 1.8 1.9]’;
13 a31 = [ 3 3 1 ]’;
14 b31 = [ 11.8 12.1 12.4 ]’;
15 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
16 %%%%% Sector 2 eNodeB 1 %%%%%%%%%%%%%%%
17 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
18 k12 = [ 1 2 3 ]’;
19 a12 = [ 3 3 1 ]’;
20 b12 = [ 10 11 12 ]’;
21 %%%%% Sector 2 eNodeB 2 %%%%%%%%%%%%%%%
22 k22 = [ 4 5 6 ]’;
23 a22 = [ 3 3 1 ]’;
24 b22 = [ 13 14 15 ]’;
25 %%%%% Sector 2 eNodeB 3 %%%%%%%%%%%%%%%
26 k32 = [ 7 8 9 ]’;
27 a32 = [ 3 3 1 ]’;
28 b32 = [ 16 17 18 ]’;
29 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
30 %%%%% Sector 3 eNodeB 1 %%%%%%%%%%%%%%%
31 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
32 k13 = [ 10 11 12 ]’;
33 a13 = [ 3 3 3 ]’;
34 b13 = [ 15.1 15.3 15.5 ]’;
35 %%%%% Sector 3 eNodeB 2 %%%%%%%%%%%%%%%
36 k23 = [ 13 14 15 ]’;
37 a23 = [ 3 3 3 ]’;
38 b23 = [ 15.7 15.9 17.3 ]’;
39 %%%%% Sector 3 eNodeB 3 %%%%%%%%%%%%%%%
5
40 k33 = [ 16 17 18 ]’;
41 a33 = [ 3 3 3 ]’;
42 b33 = [ 17.5 17.7 17.9 ]’;
43 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
44 k = [ k11 k12 k13;
45 k21 k22 k23;
46 k31 k32 k33]
47 a = [ a11 a12 a13;
48 a21 a22 a23;
49 a31 a32 a33]
50 b = [ b11 b12 b13;
51 b21 b22 b23;
52 b31 b32 b33]
53 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
6
Chapter 2
• The ith UE with a cell starts with an initial bid wli (1) which is sent to
the lth carrier eNodeB.
In MATLAB:
1 % Initial Bids w[sector1; sector2; sector3]
2 w = [10 10 10 10 10 10 10 10 10 10 10 10 10 10 10
10 10 10; 10 10 10 10 10 10 10 10 10 10 10 10 10
10 10 10 10 10; 10 10 10 10 10 10 10 10 10 10
10 10 10 10 10 10 10 10]’;
• The lth eNodeB sector evaluates the difference between the received bid
wli (n) and the previously received bid wli (n − 1) and exits if and only if
it is less than a provided threshold δ.
7
Figure 2.1: System Model of Frequency Reuse [3]
In MATLAB:
1 while (delta > 0.001)
2 :
3 :
4 :
5 :
6 delta = max(max(abs(w-w_old)))
7 end % (while) end of the time iteration
8
• The lth sector sends the aggregated bids from all UEs under its coverage
∑
W l (n) = M l
i=1 wi (n) to MME.
In MATLAB:
1 function [p, R_sector] = sector(w)
2 L = 3; % number of sectors
3 W = sum(w); % sum of columns
4 [R_sector] = MME(W); % calculate the sector rate
5 for isector = 1:L
6 p(isector) = W(isector)./R_sector(isector); %
calculate the shadow price
7 end
W l (n)
• MME calculates the sector rates Rl (n) = ∑L l
R and sends it to the
l=1 W (n)
corresponding sectors.
In MATLAB:
1 function [R_sector] = MME(W)
2 R_MME = 450; % the total MME
rate
3 for iMME = 1:length(W)
4 R_sector(iMME) = W(iMME)./sum(W).*R_MME; %
allocated sector rate
5 end
• Each user receives the shadow price to solve for the rate ri that maximizes
objective function.
In MATLAB
1 dy(i,j) = diff(y(i,j),x); % diff of utility
function
9
2 :
3 :
4 S(i,j) = dy(i,j)-p(time,j);
5
6 soln(i,j,:) = double(solve(S(i,j)));
7
8 r_opt(i,j) = soln(i,j,2);
9 :
10 :
• Each user sends the value of its new bid wi (n) to corresponding sector.
This process is repeated until |wi (n) − wi (n − 1)| is less than the pre-
specified threshold δ.
In MATLAB
1 while (delta > 0.001)
2 :
3 :
4 :
5 :
6 delta = max(max(abs(w-w_old)))
7 end % (while) end of the time iteration
10
Figure 2.2: UE Algorithm of Frequency Reuse
11
Figure 2.3: Sector Algorithm
12 of Frequency Reuse
Figure 2.4: MME Algorithm of Frequency Reuse [4]
13
Figure 2.5: Transmission of Frequency Reuse Algorithm [1]
14
Bibliography
[5] I. Research, “Mobile VoIP subscribers will near 410 million by 2015;
VoLTE still a long way off,” 2010.
[9] H. Ekstrom, “QoS control in the 3GPP evolved packet system,” 2009.
15
[11] M. Ghorbanzadeh, A. Abdelhadi, and C. Clancy, “Quality of service in
communication systems,” in Cellular Communications Systems in Con-
gested Environments, pp. 1–20, Springer, 2017.
[12] S. Qaiyum, I. A. Aziz, and J. B. Jaafar, “Analysis of big data and quality-
of-experience in high-density wireless network,” in 2016 3rd Interna-
tional Conference on Computer and Information Sciences (ICCOINS),
pp. 287–292, Aug 2016.
[13] A. Ghosh and R. Ratasuk, “Essentials of LTE and LTE-A,” 2011.
[14] W. Stallings, “Data and computer communications,” in William Stallings
Books on Computer and Data Communications, 2013.
[15] G. Piro, L. Grieco, G. Boggia, and P. Camarda, “A two-level scheduling
algorithm for QoS support in the downlink of LTE cellular networks,”
in Wireless Conference (EW), 2010.
[16] G. Monghal, K. Pedersen, I. Kovacs, and P. Mogensen, “QoS Oriented
Time and Frequency Domain Packet Schedulers for The UTRAN Long
Term Evolution,” in IEEE Vehicular Technology Conference (VTC),
2008.
[17] D. Soldani, H. X. Jun, and B. Luck, “Strategies for Mobile Broad-
band Growth: Traffic Segmentation for Better Customer Experience,”
in IEEE Vehicular Technology Conference (VTC), 2011.
[18] H. Y. and S. Alamouti, “OFDMA: A Broadband Wireless Access Tech-
nology,” in IEEE Sarnoff Symposium, 2006.
[19] A. Larmo, M. Lindstrom, M. Meyer, G. Pelletier, J. Torsner, and H. Wie-
mann, “The LTE link-layer design,” 2009.
[20] C. Ciochina and H. Sari, “A review of OFDMA and single-carrier FDMA,”
in Wireless Conference (EW), 2010.
[21] Z. Kbah and A. Abdelhadi, “Resource allocation in cellular systems for
applications with random parameters,” in 2016 International Conference
on Computing, Networking and Communications (ICNC), pp. 1–5, Feb
2016.
16
[22] T. Erpek, A. Abdelhadi, and T. C. Clancy, “Application-aware resource
block and power allocation for LTE,” in 2016 Annual IEEE Systems
Conference (SysCon), pp. 1–5, April 2016.
[25] P. Ranjan, K. Sokol, and H. Pan, “Settling for Less - a QoS Compro-
mise Mechanism for Opportunistic Mobile Networks,” in SIGMETRICS
Performance Evaluation, 2011.
17
[33] M. Alasti, B. Neekzad, J. H., and R. Vannithamby, “Quality of service
in WiMAX and LTE networks [Topics in Wireless Communications],”
2010.
18
[44] R. Braden, “Resource ReSerVation Protocol (RSVP) - Version 1 Func-
tional Specification,” 1997.
[50] I. Jung, I. J., Y. Y., H. E., and H. Yeom, “Enhancing QoS and En-
ergy Efficiency of Realtime Network Application on Smartphone Using
Cloud Computing,” in IEEE Asia-Pacific Services Computing Confer-
ence (APSCC), 2011.
[52] N. Ahmed and H. Yan, “Access control for MPEG video applications us-
ing neural network and simulated annealing,” in Mathematical Problems
in Engineering, 2004.
[54] G. Gorbil and I. Korpeoglu, “Supporting QoS traffic at the network layer
in multi-hop wireless mobile networks,” in Wireless Communications and
Mobile Computing Conference (IWCMC), 2011.
19
[56] H. Kushner and P. Whiting, “Convergence of proportional-fair sharing
algorithms under general conditions,” 2004.
20
[66] A. Demers, S. Keshav, and S. Shenker, “Analysis and simulation of a
fair queueing algorithm,” 1989.
21
[77] M. Ghorbanzadeh, A. Abdelhadi, and C. Clancy, “Delay-based backhaul
modeling,” in Cellular Communications Systems in Congested Environ-
ments, pp. 179–240, Springer, 2017.
22
[86] A. Abdelhadi and C. Clancy, “An optimal resource allocation with joint
carrier aggregation in 4G-LTE,” in Computing, Networking and Com-
munications (ICNC), 2015 International Conference on, pp. 138–142,
Feb 2015.
23
[95] Federal Communications Commission, “Proposal to Create a Citizen’s
Broadband Service in the 3550-3650 MHz band,” 2012.
24
[105] A. Abdelhadi and T. C. Clancy, “Network MIMO with partial coopera-
tion between radar and cellular systems,” in 2016 International Confer-
ence on Computing, Networking and Communications (ICNC), pp. 1–5,
Feb 2016.
25
[114] S. Gao and M. Tao, “Energy-efficient resource allocation for multiple
description coding based multicast services in ofdma networks,” in 2016
IEEE/CIC International Conference on Communications in China (ICCC),
pp. 1–6, July 2016.
[122] S. Shenker, “Fundamental design issues for the future internet,” 1995.
26
on Computing, Networking, and Communications (ICNC), CNC Work-
shop, 2014.
27