Professional Documents
Culture Documents
fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. XX, NO. XX, XXXX 2015
I. I NTRODUCTION
Demand for higher data rates in future cellular networks is
being witnessed globally. Data hungry applications on mobile
devices such as multimedia downloading, video streaming, online gaming and large file sharing among users are forcing
cellular operators to adopt new technologies. These technologies allow the operators to satisfy customers demand of
enhanced data rates and increase their revenues. The policy
formulating entities and regulators around the globe are also
Manuscript received November 07, 2014; revised April 06, 2015 and July
04, 2015; accepted September 12, 2015.
Copyright (c) 2015 IEEE. Personal use of this material is permitted.
However, permission to use this material for any other purposes must be
obtained from the IEEE by sending a request to pubspermissions@ieee.org.
M. Azam, is with Foundation University Institute of Engineering and
Management Sciences, Islamabad, Pakistan.
M. Ahmad and M. Iqbal are with Department of Electrical Engineering,
COMSATS Institute of Information Technology, Wah Campus, Pakistan.
M. Naeem is with the Department of Electrical Engineering, COMSATS
Institute of Institute of Information Technology, Wah Campus, Pakistan
and with the Department of Electrical and Computer Engineering, Ryerson
University, ON, Canada. (email:mnaeem@rnet.ryerson.ca)
A. S. Khwaja and A. Anpalagan are with the Department of Electrical and Computer Engineering, Ryerson University, ON, Canada.
(email:alagan@ee.ryerson.ca)
S. Qaiser is with School of Electrical Engineering and Computer Science
(SEECS), NUST, Pakistan
This work was supported in part by NSERC Discovery Grants.
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
2
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. XX, NO. XX, XXXX 2015
TABLE I
C OMPARISON O F D IFFERENT R EFERENCES . AC = A DMISSION C ONTROL , MS = M ODE S ELECTION , PA = P OWER A LLOCATION
Ref
Admission
Control
[7]
[10]
[11]
Mode Selection
X
X
X
Power Allocation
[12]
[14]
[15]
[16]
JACMSPA
Algorithm
Remarks
Heuristic
Heuristic
Greedy
[17]
[18]
[19]
[20]
[22]
Adaptive
Approximation
Algorithms
Robust
optimization
algorithm
Linear Programming
Convex Approximation
Heuristic
Greedy
Heuristic
Evolutionary Algorithm
[23]
[25]
[28]
[30]
[32]
[34]
[36]
X
X
X
X
X
X
Heuristic
Heuristic
Heuristic
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
SHELL et. al:M. NAEEM
TABLE II
N OTATIONS
Symbol
K
c
d
R
Ckul
Ckdl
Ckc
Ckd
max
PeNB
max
Pc,k
min
Pd,k
pdk
pul
k
pdl
k
xk
Ckmin
hk
fk
gk
c
d
do
d
k
h
U
US
UT
pc
pm
ps
Definition
Set of user pairs
Cellular mode
D2D mode
Radius of D2D transmission
Capacity of the kth cellular user in uplink
Capacity of the kth cellular user in downlink
Capacity of the kth cellular user pair-i.e.,
1
min(Ckul , Ckdl )
2
Capacity of the kth D2D users
Maximum power of eNB
Maximum power of the kth user in cellular mode
Minimum power threshold of the kth user in D2D mode
outside radius R
Power of the kth in D2D mode
Power of the kth in uplink cellular mode
Power of the kth in downlink cellular mode
Binary indicator for D2D or cellular mode
Minimum rate requirement of the kth user
Channel gain between the kth user and eNB link
(uplink)
Channel gain between the kth receiver and eNB link
(downlink)
Channel gain between the kth D2D user pair
Set of selected users in cellular mode
Set of selected users in D2D Mode
Set of all selected Users-i.e.,c d
Reference distance for the antenna far field
Distance between secondary transmitter and receiver
Rayleigh random variable associated with the kth SU
Log normal shadowing
A utility function to maximize the joint user admission
and throughput
A utility function to maximize the admitted users
A utility function to maximize the throughput
Probability of cross over
Probability of mutation
Probability of selection
an open area of research. There are some papers in the literature that claim joint admission control and power allocation but
they always try to solve the user selection and power allocation
separately. Since the user selection and power allocation are
not separable and in addition to joint user selection and power
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
4
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. XX, NO. XX, XXXX 2015
,
(1)
hk = hk Go
d
where do and d are the antenna far field reference distance and
distance between the receiver and transmitter, respectively. The
k is the Rayleigh
path loss exponent is denoted by and h
random variable. The channel capacity of the kth user is
k hk
defined as Ck = log(1 + pN
). A summary of symbol
0
notations is shown in Table II. In cellular mode, the eNB will
act like a relay and the communication between the cellular
user pair needs two time slots. The possible rate
of the kth
user in cellular mode is Ckc = 12 min Ckul , Ckdl . The rate for
pd g
k k
). For
kth pair in D2D communication is Ckd = log(1 + N
0
mode selection, we define a binary mode selection indicator
as:
1, Cellular mode
xk =
0, D2D mode.
To meet the QoS of the kth user pair, the pair must satisfy
its minimum rate Ckmin . For any power constraint, wireless
network satisfying every users rate requirement is not always
possible3 . Traditional admission control schemes generally
select the users that can give higher aggregate throughput. In
this paper, we propose a framework for joint admission control
and mode selection that not only maximizes the throughput
but also maximizes the number of admitted users under the
minimum rate and power constraints. Let be the set of
admitted users. One admitted user can only be served either
in cellular or D2D mode and the set of admitted users is
the union of admitted cellular and D2D users. Mathematically,
this is written as:
= c d
c d =
(2)
||
dl
and UT xk , pdk , pul
= xk Ckc +
where US = |K|
k , pk
(1 xk ) Ckd . The utility function U , x, pd , pul , pdl ensures that if cellular mode is selected for any admitted user,
3 There are a number of reasons for this-e.g., channel may be bad, battery
is low, increase in power may increase interference to others etc.
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
SHELL et. al:M. NAEEM
subject to
min
dl
, k
C1 : UT xk , pdk , pul
k , pk Ck
min
C2 : pdk (1 xk )R Pd,k
, k
max
C3 : pul
k xk Pc,k , k
X
max
C4 :
xk pdl
k PeN B
(4)
C5 : = c d
C6 : c d =
C7 : xk {0, 1}, k K
TO A
S OLUTION
0
,
k
K
C8 : pdk 0, pul
0,
p
ger
domain, with the continuous domain and non-linearities in
k
k
the problem make the class of problem mentioned in (5) very
The objective function in (4) is a max-min problem. By
challenging. As the integer variables (user admission and mode
introducing a new variable tk , k K, we can rewrite an
selection in our case) increase, the complexity analysis results
equivalent maximization problem as
tend towards NP-completeness. Despite all these challenges,
d
ul
dl
the optimization problem in (5) has a very special structure. By
max
Ut t, , x, p , p , p
t,,x,pd ,pul ,pdl
exploiting this special structure, in this section we will present
an OAA method to solve (5). The OAA solves (5) in a finite
subject to
sequence of alternately nonlinear programming sub-problems
(5)
C1-C8 of (4)
(by fixing the discrete variables and x) and relaxation of a
C9 : Ckul tk , k c
mixed integer linear program based master problem (MILPC10 : Ckdl tk , k c
MP). The solution of the sub-problem provides a point that
will generate supporting hyperplanes of the objective and
where
constraint functions. The OAA method adds one linearization
X
d
ul
dl
d ul dl
for each constraint and the objective function for every subUt t, , x, p , p , p
= US ()
UT,t t, xk , pk , pk , pk
problem. These linearizations of the problem are collected in
k
(6) a MILP-MP. The solution of the master program determines a
and
new set of discrete variables that will be used for next iteration
[40].
d
dl
(7)
UT,t t, xk , pdk , pul
k , pk = xk tk + (1 xk ) Ck
The utility function in the above optimization problem maximizes the admitted users and total throughput. Constraint
C1 is the minimum rate constraint of each user. If any user
can not meet the rate constraint condition, then that user is
not selected for transmission. Constraints C2, C3 and C4
are power constraints for D2D, cellular uplink and cellular
downlink mode respectively. Constraint C2 ensures that in
case of D2D communication, the power experienced by any
other cellular or D2D user beyond radius R should be less
min
than a threshold power Pd,k
. Constraint C3 is the uplink
power constraint and C4 is the downlink sum power constraint.
Constraints C2, C3 and C4 also ensure that the respective
power should be zero if respective mode is not selected.
Constraints C5 and C6 ensure that D2D and cellular users
are mutually exclusive.
The formulation in (5) is a non-convex mixed integer nonlinear programming problem. To prove the hardness of (5), we
can reduce the multiple-choice multiple-dimensional knapsack
problem to the JACMSPA optimization problem.
A. Algorithm description
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
6
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. XX, NO. XX, XXXX 2015
Algorithm 1 : OAA
1: j 1
2: Initialize j
3: 103
4: Convergence F ALSE
5: while Convergence
== F ALSE do
(
arg min
Ut j , P
j
P
6:
P
subject to U j , P 0;
7:
UpperBound
Ut j , P
arg min
,P,
subject to
j
j
,
P
t
8:
( , P , )
j
Ut j ,P j PP
U j , P j
j
0
U j , P j PP
0
9:
LowerBound
10:
if UpperBound LowerBound then
11:
Convergence T RU E
12:
else
13:
j j+1
14:
j
15:
end if
16: end while
as:
min min Ut j , P
P
subject to:
U j , P 0;
min ()
(10)
where
() = min Ut j , P
P
subject to
U j , P 0
(11)
P
j
subject to
(12)
j
P P
0
U j , P j U j , P j
j
min
(8)
,P,
subject to
P Pj
Ut j , P j Ut j , P j
j
P Pj
0
U j , P j U j , P j
j
(13)
10
OAA
ESA
10
Sum Rate (b/s)
(9)
7.09
10
6
10
7.08
10
10
5
Number of users
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
SHELL et. al:M. NAEEM
10
10
10
6
7
Number of users
max =
(a) Performance of OAA for different number of users with PeNB
max = 0.5W .
4W, Pc,k
35
10
10
10
15
GA
OAA
Rate Req
= 25kb/s
Spectral Efficiency(b/s/Hz)
25
20
15
10
30
OAA K = 4
GA K = 4
OAA K = 8
GA K = 8
12
10
Spectral Efficiency(b/s/Hz)
25
max =
(b) Performance of OAA for different number of users with PeNB
max = 2W .
20W, Pc,k
30
Rate Req
= 50kb/s
Rate Req
= 100kb/s
Rate Req
= 150kb/s
Rate Req
= 200kb/s
20
Number of users
10
15
Number of Users
20
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
8
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. XX, NO. XX, XXXX 2015
TABLE III
S IMULATION PARAMETERS
10
Parameter
max
PeNB
max
Pc,k
min
Pd,k
Ckmin
do
eNB coverage
d
o
Go
ps
pm
pc
UT
10
10
10
10
10
10
Value
{2,4}Watts
{0.5,0.75}Watts
100mW
{100,200}kbs
20
1000m
Uniformly distributed distance
10dB
50
0.90
0.10
0.50
10
3
4
Users Index
V. S IMULATION R ESULTS
10
U
UT
6
10
10
10
10
10
10
10
5
6
Users Index
10
10
U
UT
6
10
10
10
10
10
10
10
5
6
Users Index
10
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
SHELL et. al:M. NAEEM
10
10
K=5
K = 10
K = 15
K = 20
U
UT
6
10
10
Sum Rate (b/s)
10
10
10
10
10
10
10
10
15
Users Index
20
25
30
10
100
200
300
400
500
600
700
Coverage Distance (m)
800
900
1000
10
U
UT
6
10
10
10
10
10
10
10
10
15
Users Index
20
25
30
10
U
7
UT
10
10
10
10
10
10
10
10
10
12
Users Index
14
16
18
20
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
10
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. XX, NO. XX, XXXX 2015
max
max
eters as PeN
= 0.75W, Ckmin = 100kbps,
B = 4W, Pc,k
max
max
max
PeN B = 4W, Pc,k = 0.5W, Ckmin = 200kbps and PeN
B =
max
min
20W, Pc,k = 2W, Ck = 1Mbps, respectively. Fig. 6 shows
the effect of eNB coverage area the throughput. In Fig. 5(a),
21 users are admitted with U utility while only 18 users are
admitted with UT utility. With the increase in rate requirement
for Fig. 5(b), 17 users are admitted with U utility while only
13 users are admitted with UT utility. We can conclude from
the results that for cellular system with D2D capability, joint
admission control and mode selection add more fairness as
compared to sum-rate maximization.
VI. C ONCLUSION
In this paper, we presented a computationally viable solution
for solving the joint admission control, mode selection and
power allocation problem in D2D communication. We made
use of the special structure of this problem to propose a
solution based on branch and bound outer approximation
approach. The proposed OAA method gives guaranteed optimal results and has a reasonable computational complexity.
We verify the effectiveness of the proposed approach method
by simulations that demonstrated the effect of number of users
on the total throughput and also analyzed the effectiveness of
joint admission control and mode selection utility.
R EFERENCES
[1] K. Doppler, M. Rinne, C. Wijting, C. B. Ribeiro and K. Hugl, Deviceto-device communication as an underlay to LTE-advanced networks,
IEEE Communications Magazine, vol. 47, no. 12, pp. 42-49, Dec. 2009.
[2] N. Dan, B. Li, B. Lan and C. JunRen, Resource allocation over cooperation for cross-cell D2D communication underlaying LTE network,
In Proc. of IEEE TENCON 2013, Oct. 2013.
[3] Y.-S. Chen and J.-S. Hong, Intelligent Device-to-Device Communication in the Internet of Things, IEEE Systems Journal, vol. 7, no. 1, pp.
77-91, March 2013.
[4] S.-H. Lu, L.-C. Wang, T.-T. Chiang and C.-H.Chou, Cooperative Hierarchical Cellular Systems in LTE-A Networks, IEEE Systems Journal,
2014.
[5] K. Akkarajitsakul, P. Phunchongharn, E. Hossain and V. K. Bhargava,
Mode selection for energy-efficient D2D communications in LTEadvanced networks: A coalitional game approach, In Proc. of IEEE
Communication Systems (ICCS), Nov. 2012.
[6] O. Bello and S. Zeadally, Intelligent Device-to-Device Communication
in the Internet of Things, IEEE Systems Journal, 2014.
[7] J. Gao, X. Liao, J. Deng and P. Ren, A Mode Shifting Resource Allocation Scheme for Device-to-Device Underlaying Cellular Network, in
Proc. AASRI on Parallel and Distributed Computing and Systems, vol.
5, pp. 40-47, 2013.
[8] B. Peng, C. Hu, T. Peng and W. Wang, Optimal Resource Allocation
for Multi-D2D Links Underlying OFDMA-Based Communications, In
Proc. of Wireless Communications, Networking and Mobile Computing
(WiCOM), Sept. 2012.
[9] L. Bao Le, Fair Resource Allocation for Device-to-Device Communications in Wireless Cellular Networks, In Proc. of IEEE Global
Communications Conference (GLOBECOM), Dec. 2012.
[10] H. Zhang, T. Wang, L. Song and Z. Han, Graph-based resource
allocation for D2D communications underlaying cellular networks, In
proc. of Communications in China - Workshops (CIC/ICCC), pp. 187192, Aug. 2013.
[11] Y. Tao, J. Sun and S. Shao, Radio resource allocation based on greedy
algorithm and successive interference cancellation in Device-to-Device
(D2D) communication, In Proc. of IET International on Information
and Communications Technologies (IETICT), April 2013.
[12] B. Wang, L. Chen, X. Chen, X. Zhang and D. Yang, Resource Allocation Optimization for Device-to-Device Communication Underlaying
Cellular Networks, In Proc. of IEEE on Vehicular Technology , May
2011.
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
SHELL et. al:M. NAEEM
11
A PPENDIX A
P ROOF OF T HEOREM 1
We prove that even with known uplink and downlink powers
the joint admission control, network mode selection, and
power allocation is a NP-complete problem. One example
of known power is equal power distribution among selected
users. We first show that the JACMSPA is equivalent to the
0-1 multiple-choice multiple-dimensional knapsack problem
(MCMDKP). We will start by describing the input, output formal description of decision problem associated with
MCMDKP and JACMSPA.
Problem 1. The MCMDKP problem is to select the items
xj,q in disjoint classes to maximize the total profit such that
an item can only be selected by at most one class subject to
satisfaction of W resource constraints.
Instance: J disjoint classes,Q items and W resource constraints (capacity of knapsack with W dimensions). The qth
item of class j has profit fj,q and weight wj,q [44].
Output: A selection of items X.
Decision problem associated with MCMDKP: The
MCMDKP decision problem is to determine, for a given
profit F , whether it is possible to load the multidimensional
knapsack so as to keep the total weight in each dimension no
greater than W , while making the total profit at least equal to
F.
Problem 2. The JACMSPA problem is to select the disjoint
subsets of users that are either using D2D or eNB for
communication such that: 1) the total data rate (sum-capacity)
of the system is maximized and 2) Data rate of each selected
user must be more than or equal to a predefined threshold.
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/TVT.2015.2487220, IEEE Transactions on Vehicular Technology
12
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL. XX, NO. XX, XXXX 2015
Mushtaq Ahmad received the BSc , MS in Electrical Engineering and Masters of Telecommunication
Management from University of Engineering and
Technology Lahore, University of Michigan Ann Arbor, USA and Institut National Des Telecom France
in 1990, 1994 and 1999 respectively. Possessing
double Masters degree both in the field of Electrical Engineering and Telecom Management from
renowned universities of the world , the author has
diverse working experience with Incumbent operator
PTCL, regulator PTA, policy formulation experience
in the capacity of Member Telecom at Ministry of Information Technology and
experience in the capacity of Chief Executive Officer of reputable public and
private institutions. The author is currently working as a Principal Engineer
at Comsats Institute of Information Technology Wah, Pakistan and pursuing
his PhD degree from same institution . His main research areas are Resource
Allocation in next generation networks.
Saad Qaisar received his Masters and Ph.D. degrees in Electrical Engineering from Michigan State
University, USA in 2005 and 2009, respectively,
under supervision of Dr. Hayder Radha (Fellow,
IEEE). He is currently serving as an Assistant Professor at School of Electrical Engineering Computer
Science (SEECS), National University of Sciences
Technology (NUST), Pakistan. He is the lead researcher and founding director of CoNNekT Lab:
Research Laboratory of Communications, Networks
and Multimedia at National University of Sciences
Technology (NUST), Pakistan. As of September 2011, he is the Principal
Investigator or Joint Principal Investigator of multiple research projects
spanning cyber physical systems, applications of wireless sensor networks,
network virtualization, communication and network protocol design, wireless
and video communication, internet measurements analysis, multimedia coding
and communication. He has published over 50 papers at reputed international
venues. He is also serving as the chair for Mobile-Computing, Sensing and
Actuation for Cyber Physical Systems (MSA4CPS) workshop in conjunction
with International Conference on Computational Science and Its Applications
(ICCSA). He is the lead researcher on a joint internet performance measurements study in Pakistan with Georgia Institute of Technology, current head of
a core working group for establishment of Pakistan IXP, technical consultant
to United Nations Food and Agriculture Organization (UNFAO), lead architect
for Pakistan Laboratory Information Management System project and actively
engaged with projects funded by King Abdullah City of Science Technology
(KACST).
0018-9545 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See
http://www.ieee.org/publications_standards/publications/rights/index.html for more information.