2020, 37th NATIONAL RADIO SCIENCE CONFERENCE

(NRSC 2020), September 8-10, 2020

German University in Cairo (GUC), Cairo, Egypt

AN ENERGY EFFICIENT CONSTRAINT RRH TO BBU ASSOCIATION IN CLOUD RADIO ACCESS

NETWORKS
Hadil Hesham1, Mohamed Ashour2, Tallal el-Shabrawy3
1
Networks Department, German University in Cairo, Cairo, Egypt, hadil.hesham@guc.edu.eg
2
Networks Department, German University in Cairo, Cairo, Egypt, mohamed.ashour@guc.edu.eg
3
Networks Department, German University in Cairo, Cairo, Egypt, tallal.el-shabrawy@guc.edu.eg

ABSTRACT
With the evolution of 5G and the motivation to provide high demand rates to users anywhere anytime, Cloud
Radio Access Network (C-RAN) has become one of the most attractive research fields in the development of
wireless communication. Alongside the many benefits of C-RAN including cost-effectiveness, dynamic resource
allocation, and high rate provisioning comes the challenge of how to allocate the resources and optimize the energy
utilization in the centralized cloud. This paper formulates an energy efficient constraint Base Band Unit to Remote
Radio Head association according to user rate demands through minimizing the power consumption by deactivating
Base Band Units in the Data Center. The formulation is dependent on both the processing capability of the servers
in the cloud, and the user rate requirement. These two attributes introduce a challenge when allocating resources in
a C-RAN system. Dual constraint bin packing approach is proposed to solve the energy problem. Results were tested
with a varying user load showing a drop in the power consumption in the Data Center while successfully maintaining
the total rate requirement of the system with a given bandwidth allocation based on Base Band Unit to Base Band
Unit interference and frame processing deadline.
Keywords: C-RAN, Energy, Processing, Resource Allocation, Bin-packing
I. INTRODUCTION
Cloud Radio-Access Network is a centralized solution to provide cost-effective flexible radio services for high
user rate demands. This accommodates the evolution of 5G providing [1] on-demand high quality of service for
radio users. C-RAN offloads the baseband processing of the signal to a virtualized Base Band Units (BBUs) running
in the cloud. This allows for physically deployment of lighter and cheaper Remote Radio Heads (RRHs) across the
coverage area. The C-RAN technology imposes many challenges such as BBU to RRH association, handling the
data traffic over the networks, and most importantly meeting the 5G strict frame transmission deadlines while
maintaining an optimized, energy efficient and cost-effective Data Center cloud deployment. This paper formulates
an energy efficient BBU-RRH association according to user rate demands by minimizing the number of active
BBUs in the Data Center and thus minimizing the power consumption. The paper addresses the challenge of
activating/deactivating BBUs as a function of the processing capability of the server, the user service level
agreement in terms of delay and the rate received along with the BBU bandwidth allocation. The motivation behind
the formulation is that any decision taken in the Data Center must take into consideration both the computational
side and the radio side in order to maintain a good Quality of Service (QoS) measured as the user rate recived while
optimally allocating the available resources. Given the flexible RRH to BBU association, RRHs can be mapped and
re-mapped to a BBU without service interruption as all BBUs are centrally located in the same Data Center. The
cloud architecture of the BBUs and the connectivity of all RRHs to this cloud allows for mapping multiple RRH to
one BBU to improve the energy efficiency. This is referred to as “one to many “mapping. A dual constraint bin
packing approach is used to solve the energy problem. Results show a substantial decrease in power usage in the
one to many scenario, as oppose to the one to one mapping at the Data Center while marinating the processing
deadline constraint by the subscribed user.
The Research paper is organized as follows. Section II covers a brief analysis of the previous work in this research
divided into two parts covering the power consumption models and the resource allocation problem, followed by
section III proposing the problem formulation of the energy efficient optimization problem . Section IV presents the
dual –bin packing heuristic algorithm presented to find a near optimum solution. Finally section V and VI presents
the results and conclusion.

A. Centralized C-RAN Environment

Centralizing the radio services in cloud Data Center where most of the heavy weight processing occurs provides
many benefits including cost reduction, easy allocation and reallocation of resources. To accomplish an efficient C-

C9 155
978-1-7281-6819-7/20/$31.00 ©2020 IEEE

Authorized licensed use limited to: Indian Institute of Technology Hyderabad. Downloaded on April 21,2021 at 13:27:37 UTC from IEEE Xplore. Restrictions apply.
 2020, 37th NATIONAL RADIO SCIENCE CONFERENCE
(NRSC 2020), September 8-10, 2020
German University in Cairo (GUC), Cairo, Egypt

RAN system each component that builds it has to be optimally deployed and associated with the other components
of the system to optimize resources and provide a good Quality of Service (QoS)
Components of the environment include the following [2] :In this research the C-RAN architecture has one
centralized BBU Pool located in Data Center ,were all RRHs forwards requests to this BBU Pool.

B. Resource Allocation
In this paper, a user is allocated resources in order to receive a specific rate. These resources may be physical
resources such as the RRH allocation, computational and power resources such as the processing at the BBU and
bandwidth resources referred to as the Resource Blocks (RBs). A user is assigned a combination of these resources.
The assignment is dependent on the user rate requirement, the coding scheme, the user location and the processing
capability of the Data Center. Keeping in mind these resources are scarce it is crucial to optimize the assignment.
The assignment of the resources is dependent on each other, as for example users assigned to RRHs further away
from them tend to need more RBs and more processing delay in the data centre. According to this these resources
must be granted as a whole monitoring the affect they have on each other.

II. RELATED WORK

A. Power-Model in C-RAN
Previous research formulates the energy -efficiency as a function of the power saving at the Data Center, however,
the quality of radio service is not always considered. In [3,4] the authors discuss the challenges of a centralized and
cloudified LTE-FFD Radio Access Networks, the paper uses OpenAir-Interface to simulate the C-RAN formulating
a generalized equation relating the CPU - frequency with the frame processing. This paper was referenced by [5],
the authors simulate different configurations for the cloudified radio access network. Results show that the
processing time increases as a function of the Resource Blocks (RBs) and the MCS scheme used, given this the
authors derives a model that estimates the baseband processing as a function of the RBs and MCS. The round-trip
time of the LTE frame is adapted to the new centralized RAN solution in [6] focusing on the scheduling of a job in
software-based BBU. Authors in [6] conclude that the research studied the exact traffic threshold that will give the
optimal power saving. Improving the decoding scheme decreases the processing leading to a performance gain.
Modeling the power consumption of the C-RAN was adopted in [7], the paper derives a power equation for every
component in the C-RAN developing an equation between the Resource Blocks and their power consumption on
their assigned BBU. Impact of packetization and scheduling of the requests on the C-RAN was discussed in [8]
adding that the front haul imposes high latency on the system. The authors in [8] apply different packetization
algorithms to decrease the delay at the front haul.The previously mentioned related work supports the importance
of including the effect of user rate demand, coding scheme, and processing capability in a C-RAN environment
when taking any decisions concerning resource allocation. Upon so, this paper formulates energy - efficient model
to minimize the power consumption in the Data Center as a function of the bandwidth, processing and framing in
the aim to achieve a more realistic model that includes all constraints.

B. RRH-BBU association.
Paper [9] divides the BBU into two groups a busy overloaded group and a helper less loaded group all connected
together in a borrow and lending network. The busy group then borrows the required resources from the helper
group through building a tree of all combinations of BBUs. The BBU resources are grouped and therefore the RRHs
are grouped. The paper focuses on resource sharing but does not include a case in which A BBU group is deactivated.
In addition, the network of borrow and lending between the BBUs must be known which is not always possible
especially in the dynamic case. The problem formulation does not include the RRH-BBU assignment constraints
and how the physical resource blocks are assigned to the BBU/RRH is not covered. Authors in paper [10] focuses
on minimizing the network power consumption in C-RAN given a delay constraint, by formulating a problem that
presents the power function expressing the BBU power and computation and the RRH power model. The measure
of the power consumption on the BBU is expressed by the number of tasks assigned to a user’s connected to this
C9 156

Authorized licensed use limited to: Indian Institute of Technology Hyderabad. Downloaded on April 21,2021 at 13:27:37 UTC from IEEE Xplore. Restrictions apply.
 2020, 37th NATIONAL RADIO SCIENCE CONFERENCE
(NRSC 2020), September 8-10, 2020
German University in Cairo (GUC), Cairo, Egypt

BBU. The mixed integer non-linear formulation is solved using an iterative coordinate descent algorithm and a
branch and bound algorithm. The paper mentions that the energy efficiency is challenging due to the mixed
timescale characteristic of C-RAN. Results expressed as a function of the delay constraint proving as the delay
increased the power consumption as expected would decrease through this will lead to a decrease in QoS. Ref [11]
aims to minimize the total system power excluding the power on the front-haul. Minimization is done through the
deactivation of RRH and the BBU aggregation. However, the paper argues that in order to reach an optimum
threshold of how many RRHs to place in sleep mode and how many BBUs to aggregate we must look at the traffic.
As deactivating an RRH means overloading another thus increasing processing and therefore increasing power
which negates the objective of the paper. So, it is a trade-off. The problem can be solved through bin packing
however because it is NP-hard they assign an aggregation pattern according to the traffic. The proposed algorithm
is tested according to specific traffic threshold proposed by them. All the previously mentioned work optimizes the
C-RAN environment through multiple objectives including power saving and resource allocation.In this paper, the
energy efficiency problem is formulated while trying to combine all the previously mentioned work to build a system
that takes into consideration all aspects affecting the activation of the BBU in terms of computational resources and
bandwidth resources.

III. PROBLEM FORMULATION

This section proposes and discusses the formulation of the energy efficient BBU-RRH association according to user
rate demands through minimizing power consumption in the Data Center. The formulation takes into consideration
1) the processing side in the Data Center in terms of CPU frequency, server specifications and power consumption
2) the bandwidth and the rate requirement of the user equipment. A relationship between these two considerations
is derived.

The objective function is a model of the dynamic power consumption in the system is divided into two parts the
processing power of the Resource Blocks computed per BBU. The second part is the power consumption activating
a BBU in the Data Center. This model is dynamic in the sense that the power consumption changes as a function of
the environment and the number of users in the system.

Objective

(1)
, ∗ , ∗

Where is the power consummation of activating a BBU b, and , is the power consumption due to the RB
processing r on BBU b.

1
• ,
0 .
1
•
0 .

Subject to:

Resource blocks cannot be assigned to a non-active BBU

, (2)

A user u requires a minimum Rate

C9 157

Authorized licensed use limited to: Indian Institute of Technology Hyderabad. Downloaded on April 21,2021 at 13:27:37 UTC from IEEE Xplore. Restrictions apply.
 2020, 37th NATIONAL RADIO SCIENCE CONFERENCE
(NRSC 2020), September 8-10, 2020
German University in Cairo (GUC), Cairo, Egypt

(3)

Where is the total arte received calculated in equation 6

A user u can be connected to one RRH h for all resource blocks r at most

(4)
∅ , , 1 for every user u

1
• ∅ , ,
0 .

The total number of RBs r consumed by all RRHs h must be equal to the total number of RBs processed by all
BBUs

(5)
∅ , , ,

A user u receives rate/Hz from an RRH h using r resource blocks

(6)
1 , , ∗∅ , ,

According to [8] user u requires , , resource blocks from RRH h connected to BBU b

(7)
, , ∅ , ,

A BBU b has a maximum number of resource blocks according to bandwidth limit

(8)
∅ , , ∗ ,

A BBU b has maximum processing time of one sub frame (two Resource Blocks) according to the HARQ
method given the BBU and RRH are within 100km from each other derived in [3].

<= for every downlink sub frame (9)

, the processing time, a CPU with a given CPU frequency X [1] for an MCS=16

/X (10)

Cost of power processing RBs r in one BBU b in one server

∑ ∗ .
, * , W for every BBU b (11)

Looking at the problem formulation the problem is non-convex and is non-linear due to the logarithmic property in
equation 6 and the quadratic format in equation (8) therefore is very difficult to obtain an optimal solution.

C9 158

Authorized licensed use limited to: Indian Institute of Technology Hyderabad. Downloaded on April 21,2021 at 13:27:37 UTC from IEEE Xplore. Restrictions apply.
 2020, 37th NATIONAL RADIO SCIENCE CONFERENCE
(NRSC 2020), September 8-10, 2020
German University in Cairo (GUC), Cairo, Egypt

According to this a heuristic algorithm is introduced in the next section to try and reach a near optimum valid
solution.

IV. CONSTRAINT DUAL BIN PACKING ALGORITHM

This section proposes an algorithm to find the near optimum BBU to RRH assignment solution for the formulation
of the previous section aimed to minimize the power consumption in the Data Center constrained with system
requirements.

A. Constraint bin packing

The C-RAN environment can be simplified into a dual constrained bin packing problem were the BBUs are
considered the bins and the RRHs are packed to these bins according to their Resource Block requirement (load).
Each BBU is limited to a certain number of RRHs it can pack according to the constraints in equation (8) and (9)
whichever is met first. According to this a BBU can handle more RRHs in terms of bandwidth however the
processing deadline might be violated thus the RRH should be assigned to another BBU and vice versa as shown in
Fig 1. The BBUs are considered to be Virtual Machines (VMs) deployed in a physical server S. Each physical server
according to the number of cores and processing capability can handle a maximum number of VMs B (equation
11).

Fig.1 Dual bin packing problem

B. User to RRH association

In order to calculate the total required load of each RRH consisting of the total number of Resource Blocks at a
given instant of time per RRH, the user to RRH assignment must be generated. This association is considered a
linear problem. A user must receive a rate form one RRH , equation (7) this rate has to be greater than or equal
minimum rate . The rate is provided through RBs assignment dependent on the location of the user and coding
scheme used. In this system, the user connects to the closest RRH in Euclidian distance in the sense that this RRH
will provide it with the required rate with the minimum number of Resource Blocks , , equation (8), guaranteeing
the minimum processing delay for each user at the BBU. By doing so, the total load per RRHs being packed into
the BBU is optimized. Before bin packing each RRH reports to one BBU therefore |B|=|H|. For a high load scenario,
some users may not be able to connect to closest RRH as it might be overloaded, thus offloading it to a neighbouring
RRH if possible.

C. RRH to BBU association

At given point in time, the total load of each RRH requires to serve the users connected to it is computed using
equation (12), the RRH needs to request the Resource Blocks from a BBU in the closest Data Center. Here the
challenge is which RRH should report to which BBU. The bins are considered to be the virtual BBUs and the RRHs’

C9 159

Authorized licensed use limited to: Indian Institute of Technology Hyderabad. Downloaded on April 21,2021 at 13:27:37 UTC from IEEE Xplore. Restrictions apply.
 2020, 37th NATIONAL RADIO SCIENCE CONFERENCE
(NRSC 2020), September 8-10, 2020
German University in Cairo (GUC), Cairo, Egypt

total Resource Blocks are now packed into these mentioned bins. The RRH packing is constrained by both the
bandwidth allocation equation (8) given to the service provider and the processing deadline equation (9)
that should be met according to the user agreement and this is where the “dual bin packing comes from”. It should
be mentioned that the independent physical location of the RRHs and BBUs makes the bin packing valid as any
RRH can connect to any BBU through the front haul connection.

∑ 1∑ 1∅ , , for each RRH h (12)

Where ∅ , , is explained in equation 4

1) Calculating the processing deadline.

According to the user framing of the LTE standards the user requests must be framed within a frame time of 1ms
[4] so assuming the downlink frame in fig 2 and assuming that the processing time in the RRH and the propagation
delay is small and identical per frame due to the high speed front haul in an error free system. The BBU has to
process a frame and serve all users before receiving another frame. In other words, the processing rate should be
greater than or equal the arrival rate of the frames. According to this 1 . The processing time of the
resource blocks computed in a BBU is dependent on the CPU frequency and coding scheme, mentioned in equation
(10) .To calculate the processing time of a frame at a given snapshot, the total BBU Load, number of RBs, that
should be processed must me known .The total processing time of one BBU b is calculated using equation 13.
Assuming the total processing time is the total user delay ignoring the effect of propagation time, the average user
delay is calculated using equation 14 was used.

∑ ,
∗ for each BBU (13)

∑ )/K where K is the total number of UEs in the system (14)

2) Calculating the bandwidth constraint

Following the LTE standards, the maximum bandwidth that can be allocated per one BBU is 100 Resource blocks
or 20MHZ.Assuming reuse of one theoretically each BBU is allocated 100 Resource blocks (is able to reuse the
whole band), thus the 100 resource blocks are allocated to the RRHs connecting to a given BBU depending on their
user equipment rate demands. According to this there is a level of interference that should be considered between
users connected to different BBUs through different RRHs using the same Resource Blocks. Given so each
BBU/RRH has a percentage of its resource blocks that is cannot reuse. As shown in the Fig 3 below the area
experiencing interference cannot reuse the same RBs of the neighboring interfering area. To simplify the problem,
it is assumed that not all Resource Blocks R is reusable thus decreasing the total RBs per BBU calculated in
equation 15

∗ (15)

3) Calculating the power consumption

The power consumption at the Data Center is a function of 1)a bulk static power consisting of the, cooling power
and cabling.2) a dynamic power consumption function ,equation (1), of the number of active virtual BBUs and the
number of resource blocks being processed on each BBU both of which have an increasing relationship with the
power consumption. This is referred to as dynamic as this part is largely dependent on the, the number of users,
processing deadlines and bandwidth allocation all of which is highly dynamic with time. To see the effect of the
C9 160

Authorized licensed use limited to: Indian Institute of Technology Hyderabad. Downloaded on April 21,2021 at 13:27:37 UTC from IEEE Xplore. Restrictions apply.
 2020, 37th NATIONAL RADIO SCIENCE CONFERENCE
(NRSC 2020), September 8-10, 2020
German University in Cairo (GUC), Cairo, Egypt

dual constraint bin packing on the system power at a given time, a comparison of the power in the Data Center
equation (1) is calculated if the RRH to BBU association was one to one then re calculated when the RRH are
packed into the BBUs turning the problem into one to many.

V. Results & Discussion

Results of the dual constraint bin packing were tested on MATLAB calculating the total system power at varying
loads. The system was tested in an area of 40m by 40m. Users were generated randomly with locations x and y
across the area with a fixed number of RRHs uniformly deployed based on best practice with the RRHs placed in a
symmetric patter on the floor. The objective of the proposed algorithm is to minimize the number of activated BBUs
by turning the problem from one to one mapping to one to many mappings between the RRHs and the BBUs using
the dual bin packing algorithm proposed in the previous section thus minimizing the power consumption at the Data
Center. Results where simulated in MAT LAB assuming users receive power function of the path loss and wall loss
model initially; there are 20 RRHs and thus 20 active BBUs (one-one mapping).

Fig. 2 Frame Delay Fig. 3 Resource Block usage according to

interference

All users in the system require the same rate of 2Mbps and each BBU has maximum of 75 RBs that is can use.
Below in Fig 4 are the results from the dual bin packing problem resultant in the deactivation of 80 percent of the
BBUs at high load of 400 users requiring specific rate obtained through equation (7) and (8).

Fig.5 The average user Delay (secs)

Fig.4 The number of active BBUs

Evaluating BBUs Power Consumption in the Data Center based on the previous section. In Fig 6 there is a substantial
drop in the BBUs power consumption which is maintained while increasing the number of users (one to many). In
the one to one scenario whenever an RRH is deployed a BBU is activated accordingly without taking into
consideration weather this BBU is fully utilized or not. By grouping multiple RRHs to one BBU (one- to-many) the
C9 161

Authorized licensed use limited to: Indian Institute of Technology Hyderabad. Downloaded on April 21,2021 at 13:27:37 UTC from IEEE Xplore. Restrictions apply.
 2020, 37th NATIONAL RADIO SCIENCE CONFERENCE
(NRSC 2020), September 8-10, 2020
German University in Cairo (GUC), Cairo, Egypt

power consumption drop is inevitable. The constant power consumption duration (example from 100 to 200 users)
found in the one to many scenario is due to that no BBUs needs to be activated thus no change in the power
consumption due to the BBUs. As the number of Resource Blocks increases the processing power of the resource
blocks increases, however, the rate of increase in the one to many is smaller than the one to one scenario shown in
Fig 7. The processing power is a function of the Resource Blocks only and does not take into account the effect of
the coding scheme on the processing power. As mentioned before, one of the most important aspects that affect the
quality of service is the delay that the user subscribed to the system experiences. Fig 5 shows the average user delay
calculated using equation 13 and 14 in the system is way below the framing deadline which is maintained
throughout all loads. As the number of users increases the average user delay increases however it later stabilizes
as when a BBU is activated the users is split amongst the BBU in order to maintain the user deadline. It should be
noted that throughout the simulation the bandwidth constraint was met before the processing deadline constraint.

Fig. 6
The power consumption in the Data Center as function of the number of
active BBUs Fig. 7 The power consumption in the Data Center as function of the
number of active RBs

VI. CONCLUSION & FUTURE WORK

The main contribution of the paper was to formulate an energy efficiency problem taking into consideration the
constraints that affect the system. These constraints may be computational constraints such as the processing
capability of the servers or radio constraints such as the bandwidth and rate requirements. A dual constraint bin
packing algorithm is suggested to solve the energy problem in C-RAN to minimize the power consumption in the
cloud Data Center. The problem is constraint by the processing capability in the cloud Data Center and the
bandwidth allocation provided by the service provider. Results were tested across varying loads in a given area
showing a substantial decrease in power while maintaining the mentioned system constraints stated in the problem
formulation. For future work, the effect of the coding scheme on the system power consumption must be investigated
as users with a better coding scheme may be given a better rate with the same resources however this may largely
affect the energy efficiency. The propagation delay between the Data Center and the RRHs must also be considered
in the delay experienced by the user.

REFERENCES
[1] Pompili, D., Hajisami, A., & Viswanathan, H. (2015). Dynamic provisioning and allocation in cloud radio access networks
(C-RANs). Ad Hoc Networks, 30, 128-143.
[2] Hadzialic, M., Dosenovic, B., Dzaferagic, M., & Musovic, J. (2013, September). Cloud-RAN: Innovative radio access
network architecture. In Proceedings ELMAR-2013 (pp. 115-120). IEEE..
[3] Bhaumik, S., Chandrabose, S. P., Jataprolu, M. K., Kumar, G., Muralidhar, A., Polakos, P., ... & Woo, T. (2012, August).
CloudIQ: A framework for processing base stations in a data center. In Proceedings of the 18th annual international
conference on Mobile computing and networking (pp. 125-136)..
[4] Alyafawi, I., Schiller, E., Braun, T., Dimitrova, D., Gomes, A., & Nikaein, N. (2015, June). Critical issues of centralized
and cloudified LTE-FDD radio access networks. In 2015 IEEE International Conference on Communications (ICC) (pp.
5523-5528). IEEE..

C9 162

Authorized licensed use limited to: Indian Institute of Technology Hyderabad. Downloaded on April 21,2021 at 13:27:37 UTC from IEEE Xplore. Restrictions apply.
 2020, 37th NATIONAL RADIO SCIENCE CONFERENCE
(NRSC 2020), September 8-10, 2020
German University in Cairo (GUC), Cairo, Egypt

[5] Nikaein, N. (2015, September). Processing radio access network functions in the cloud: Critical issues and modeling.
In Proceedings of the 6th International Workshop on Mobile Cloud Computing and Services (pp. 36-43).
[6] Rodriguez, V. Q., & Guillemin, F. (2017, June). Towards the deployment of a fully centralized Cloud-RAN architecture.
In 2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC) (pp. 1055-1060).
IEEE..
[7] Alhumaima, R. S., & Al-Raweshidy, H. S. (2017). Modelling the power consumption and trade-offs of virtualised cloud
radio access networks. IET Communications, 11(7), 1158-1164.
[8] Chang, C. Y., Nikaein, N., & Spyropoulos, T. (2016, December). Impact of packetization and scheduling on C-RAN
fronthaul performance. In 2016 IEEE Global Communications Conference (GLOBECOM) (pp. 1-7). IEEE.
[9] Chen, Y. S., Chiang, W. L., & Shih, M. C. (2017). A dynamic BBU–RRH mapping scheme using borrow-and-lend approach
in cloud radio access networks. IEEE Systems Journal, 12(2), 1632-1643.
[10] Xia, W., Zhang, J., Quek, T. Q., Jin, S., & Zhu, H. (2018). Power minimization-based joint task scheduling and resource
allocation in downlink C-RAN. IEEE Transactions on Wireless Communications, 17(11), 7268-7280.
[11] Lee, Y., Miyanabe, K., Nishiyama, H., Kato, N., & Yamada, T. (2019). Threshold-Based RRH Switching Scheme
Considering Baseband Unit Aggregation for Power Saving in a Cloud Radio Access Network. IEEE Systems Journal, 13(3),
2676-2687.

C9 163

Authorized licensed use limited to: Indian Institute of Technology Hyderabad. Downloaded on April 21,2021 at 13:27:37 UTC from IEEE Xplore. Restrictions apply.