g wieL (us),
Ru Zu Var € Us (16)
afc (O1} Yu eU,¥n ew an
P20 Yu eUpVne
The constant n (10) indicate thatthe resource block can't
be assigned to more than one wet (ase can take mote than
one RB). Constraint (11) entures thatthe tansited power in
thefts hop (aser to rely) can't exceed the mximun power
limit and constaat (12) do the sane in the second hop
‘he concept of reference wse is used to compute the
interference on each resource block /), where the reference
Users the most fected user rom the uses associated to ober
relays as sho in Rigor (te interference condi is
Saisie forthe most affected use it will be satisfied forall
Temaining uses the most affected user (ference Ue) is the
user associated with the highest interference gain g,) and
can be given by uf = arBman€,¥j #1. Constant (1), (14)
tnoures the intercrence don't elas the Uyesel is he tw
hope (12) (131
SSP; is the survival probability [11], as discussed in section
IY, which is used to classify relays as ON (have the ability to
support transmissions ) or OFF (can't support transmissions
anymore), constraint(IS)ensures that the used relay have high,
probability to support transmission, constraint (16) ensures that,
data rte of each user don't go below specific quality of service
threshold, constraint (17) indicate that ai" isa binary variable,
428 finally the constraint (18) to indicate that the transmitted power
can't be negative
The optimization problem in (P1) is nonconvex, in fact its
Mixed Integer Nonlinear Program (MINLP) with nonconvex
feasible set this type of problems are NP hard and need
high complexity methods to be solved, approximation methods
must be used to simplify this problem
A. Time-Sharing Relaxation of the problem (PL)
‘The problem PI is (MINLP) due to the binary (integer)
nature of the variable indicator ait” as seen in the constraint
(1D), optimal sotution of problem (PI) can be obtained by
using exhaustive search method which has a very high com-
patalional complexity. This complenity can he reduced by
using time sharing strategy (14],[15] where ayy) is assumed
to be continues in the range (0, 1) to represent the fraction of
time the resource block » is assigned to user ty during one
twansmission frame.
2)
1
max, DS Raslosn(1+P2.7%,,) (19)
Subject to
{(10),(11) , 02), (13), (149, 5), 16), (18)
Osa <1 Yu eU.VneN (20)
P2 is the relaxed version of the problem PI where the
objective function in (P2) is concave [16], the constraint 16 is
convex and the remaining constraints is affine. The optimiza-
tion problem is nonlinear convex optimization problem that
can be solved by any standard algorithms such as interior point
algorithm (17] and unigue optimal solution can be obtained
VI. DISTRIBUTED RESOURCE ALLOCATION APPROACH.
‘As mentioned above, problem (P2) can be solved using
any standard algorithm and optimal solution can be obtained,
however, such centralized method has very high computational
complexity which is not suitable in practical neworks. Auction
approach can be used as distributed method to solve the above
optimization problem with low complexity. First, tae concept
of Auction is presented here
A. Concept of Auction
Before the economic concepts (such as auction and stable
matching) inserted in the field of resource managements
static resource allocation was used to assign resources 10
users, which is inefficient method. Efficient resource allocation
method can be obtained by giving prices to the resource and
amake market competition between user equipments. Auction
is one of metching methods which depend on pricing, it is
applied in real world in many applications. However in the
auctions occurs in real world the organizers and bidders take
atime to prepare and take decisions while wireless resource
allocation is real time auction. There is different types of
auctions depend on the design of the auction process and the
mechanisms used, for details of this types refer to [18]. To
understand the concept of auction consider set of objects and
set of agents which need te be matched in one to one basis
‘The benefit of assign object j to agent iis denoted by Bi)
but the agent who receive the object j must pay a price ¢
“The matching objective is maximizing the net benefit which
is given by equation (21).
Buy) ~ 6 = MAX(Buy,
“) en
Equation (21) called equilibrium condition and when it is
saistied, there is no motivation for uny agent to bid for another
object and change its assignment. When several agents com-
pete for smaller number of equally desizable objects without
raising their prices, this cause unterminated cycles. To avoid
this cycles each bid for an object must raise the objects price
bby minimum increment, The new condition will be
Bay) ~ 6) = MAX(Buy) — 6) ~€
(22)
Where € is a positive number represent the minimum
inerement and this called the ¢-complementary slackness [19]
B. Auction as resource allocation method
In wireless communication the concept of auetion can be
applied by make transmitters bid for the resources (resource
blocks and power levels), the bene‘it of using the resource
is the data rate given by this resource, and the cost is the
interference introduced to the other users. Bij) in equation
(22) replaced by
Baum) = Rar 23)
where R{ is the achievable data rate when user wm use
resousce block n, and the price ¢ in equation (22) replaced
by cy which isthe interference cased by user mon the Users
associated to other relays when using resoutce block n. This
cost given by
en = 0 = Hy (ay
where 1") is the aggregated interference when using resource
block n which is given by:
1m = YY alti 9,
2s)
428 The utility function for underlay ter user is given by
Uy, = (RP) — wall — 1) 26)
Whete [.]* is operator equal to max(0,.) and ww, are the
biasing factors selected to adjust the elfct of interfecence
fiom underlay tier on the resource allocation. ‘The fist term
represent the benefit andthe second tem represent the cost ex-
pressed in interference, where (1-1) equal Oi 1") > 1”
Which mean there is no cot paid for erng this reroute
VIL. USER ASSOCIATION AND RESOURCE ALLOCATION
Atcoritis
Survival probability is used to associate the users to relays
where the relay is considered as tumed off if its survival
probability is lower than certain threshold. This work achieved
by the eNB. After the users association is done, each relay
solves the resource allocation problem locally. The main
algorithm below explain the procedure which calls the user
association algorithm (algorithm 2) and resource block allo-
cation algorithm (algorithm 3). To accomplish algorithm 2
“Algorithas 1 Main algorithm (User Avsociation, Resource —
Block and Power Allocation)
Phase I: Initialization
Fach relay I estimates the channel state information
values from previous time slot
Initialize t= 0, PS) = (Pm™)/N
Phase Tl: Update
Run Algorithm 2 to associate users to relays
repeat
for each relay 1€ gy do
Update tt 4 1
Build the wilty matux forall resource block and
‘users based on equation (26)
Run Algorithm 3 to assign users to resource
‘blocks
Update the wansmission power using equation
(27) for Vj and update the uility mataix
Inform the allocation variables ay and P, to other
relays and calculate the achievable data rate
based on current allocation (0) = Syreu Ru)
end
lund data rate is maximized or t > Tax
Phase Hf: Allocation
Allocate resource blocks and power levels tothe U
the macrocell is divided into 1000 zones, and 1000 sectors
as shown in figure (2) and the users are inserted as uniform
random distribution, so when the square where the user is
placed is determined, the distance to the base station and all,
the relays can be calculated using the radiuses of the small
squares, for more detail about calculating the distances refer
to [20). In step one, the survival probability for all relays
in the network is calculated using equation (8), then if its
greater than specific threshold (g) the relay is assumed to have
enough energy for transmission, else if the survival probability
is lower than (g) the relay is considered as tured off and
Algorithm 2: User Classification and Association
Tnpulz Energy harvesting model, distances caleulation
method
Output: Set of survived relays g,, Users associated to
each survived relay
Step 1:Users and Relays Classification
for each relay do
Caleulate SP! using equation (8)
ISP; > g
add 1 to the survive set of relays ge
else
adé 1 to the tured off set of relays gy
end
for each user u do
It dyn, > 2/3+ cell radius
add u to the set of users using relays U;
else
add u to the set of macro users Mf
end
Step 2:Users to Relays Association
for each relay do
for each user u in U; do
dy = distance between the user w and relay
Tpin= the relay for witch dy is minizmum,
end
Rj = sot of users where | is the closest relay
end
‘Algorithm 3: Resource Blocks Allocation Using Auction,
Input: Uility Mateix (G2)
Output: RB allocation veetor a
Initialize ay
for each resource block (n), etc” <0 and
owner! <0
initialize a queue Q to contain all users, set default value
of € = 100 (is the minimum bet increase)
while Q is not empty do
ty = The first unassigned user
find (a) that maximize the utility for w
if RED — cl”) > 0 then
conner = uy
remove curtent owner” from Q
Oe
end if
if New User uf give higher bid for (n) then
owner!™) = uf
Return previous owner u to queue
end if
end 1000
“i000 -#00 -800 400-200-0200 400 600 800 1000
Fig 2. Example of dividing the cell 15 zones and 15 sects.
it’s not a factor of the network performance, Also the users
rust be classified as either relay assisted users or cellular
users, where the users inside circle centered in the eNB with
radius (2/5%cell radius) is considered as cellular users. In the
second step the users are classified as relay assisted associated
to the survived relays, where the users are associated to the
nearest relay. Ifthe user is near & specific relay and this relay
is tumed off (survival probability Vous aimerez peut-être aussi
