Joint Millimeter Wave and Microwave Wave Resource Allocation Design for Dual-Mode Base Stations

02/05/2019 ∙ by Biqian Feng, et al. ∙ UNSW Shanghai Jiao Tong University University of Delaware 0

In this paper, we consider the design of joint resource blocks (RBs) and power allocation for dual-mode base stations operating over millimeter wave (mmW) band and microwave (μW) band. The resource allocation design aims to minimize the system energy consumption while taking into account the channel state information, maximum delay, load, and different types of user applications (UAs). To facilitate the design, we first propose a group-based algorithm to assign UAs to multiple groups. Within each group, low-power UAs, which often appear in short distance and experience less obstacles, are inclined to be served over mmW band. The allocation problem over mmW band can be solved by a greedy algorithm. Over μW band, we propose an estimation-optimal-descent algorithm. The rate of each UA at all RBs is estimated to initialize the allocation. Then, we keep altering RB's ownership until any altering makes power increases. Simulation results show that our proposed algorithm offers an excellent tradeoff between low energy consumption and fair transmission.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

The tremendous growth of wireless devices stimulates the development of the fifth-generation (5G) communication network. 5G network is expected to support a connection density up to [1], which is about 10 times higher than that of the fourth-generation (4G) network. In order to support the tremendously increased throughput requirement, 5G wireless network makes use of both microwave (W) band and millimeter wave (mmW) band. Therefore, resource blocks (RBs) allocation over these two bands have become a fundamentally important topic.

The conventional scheduling algorithms include round robin (RR), maximum carrier to interference ratio (MAX C/I), and proportional fair (PF) [2]. Besides, a number of novel scheduling algorithms have been proposed, such as context-aware algorithm [3], multiuser adaptive orthogonal frequency division multiplexing (MAO) scheme [4], and weighted sum power minimization (WSPmin) [5]. In particular, RR offers fairness among user applications (UAs) in radio resource assignment, but it degrades the whole system throughput considerably. Besides, MAX C/I takes full account of system throughput, but ignores the resource allocating fairness. PF makes a tradeoff between fairness and system throughput, but it does not involve the power allocation procedure. Context-aware algorithm considers that UAs with bad CSI wastes network resources and experiences a transmission delay. MAO only considers power allocation in one slot. WSPmin can only be used in orthogonal frequency division multiple access (OFDMA) efficiently [5]. With this in mind, we hope to design a power allocation algorithm which can achieve a good tradeoff between fairness and system performance in multiple time slots.

The main contribution of this paper is to take fairness and power allocation into consideration. Besides, the operating of allocation system is decomposed into three stage, including grouping, allocating in mmW, and allocating in W. More specifically, group-based (GB) algorithm is proposed to divide UAs into multiple time slots and reduce the competition among similar UAs sharing the same expectation for RBs. Then, we apply estimation-optimal-descent (EOD) algorithm to reduce power consumption in each group. GB algorithm and EOD algorithm cooperate with each other to complete power allocation effectively.

The rest of this paper is organized as follows. In Section II, system model and problem formulation are introduced. In Section III, we propose GB algorithm to assign UAs to multiple slots. Section IV provides EOD algorithm to allocate RBs over W and mmW in detail. Simulation results and discussion are given in Section V. Section VI concludes the paper.

Ii System Model And Problem Formulation

We consider a multiuser downlink dual-mode transmission system, where BS simultaneously operates over both W and mmW bands. Meanwhile, user equipments (UEs) are equipped with interfaces which can receive information from both frequency bands. Transceivers equipped with large antenna arrays achieve an overall beamforming gain to overcome path loss over mmW band [6][7][8][9][10]. Under this model, BS is located at the center of the cell and UEs are deployed randomly within a circular cell with radius . It is assumed that UE , located at , runs UAs. So, there are UAs needed to be served successfully.

Ii-a Channel Model

Over W band, we adopt OFDMA scheme. The duration time for each slot is in downlink transmission. We assume that there are RBs available to be allocated to all UAs. Then, the rate of UA at RB and time slot is given by

where denotes the bandwidth of each RB at W band; is the power allocated to UA ; represents the Rayleigh fading channel coefficient; denotes the large-scale path loss over W band.

For mmW, we adopt time division multiple access strategy due to its spectrum/bandwidth flexibility and low cost for small cells [11]. For TDMA scheme when the number of UAs is fixed, the transmission time is determined accordingly. Then, the rate of UA at RB and time slot is given by

where denotes the bandwidth of each RB at mmW band; represents the beamforming gain that UA achieves over mmW band; is the power allocated to UA ; denotes the Rician fading channel coefficient; denotes the large-scale path loss over mmW band.

As long as UA is assigned, it can obtain the entire RBs in the mmW. Therefore, the rate of UA at time slot is given by

The model of large-scale path loss has the following form [12]:

where is the distance in meters, and , related to frequency and distance, are determined with a least squares fit to the measured data. is the shadow fading term.

Ii-B QoS and Groups

Definition 1

The quality-of-service (QoS) class means a set of UAs that can tolerate maximum time slots. They will experience outage when the transmission is over slot. [13].

Definition 2

The Group is defined as a set of UAs in the QoS class that are assigned to the time slot under a certain demand. UAs in the same group are served simultaneously.

Due to the constraint of time and RBs, all UAs cannot be served simultaneously. Assume that the total number of QoS class is and each UA must be allocated to a certain QoS class and group, i.e., and . Each UA can only be scheduled at one slot, i.e., and .

In scheduling decision, we will take and to determine the allocation over both bands. is the binary indicator of allocation in W. if RB of W is allocated to UA at time slot , otherwise . is the binary indicator of allocation in mmW. Similarly, if UA is allocated to mmW at time slot , otherwise .

Ii-C Problem Formulation

Our goal is to design an effective scheme to minimize power for the whole QoS class in low SNR situation. Some notations are shown in TABLE I. The scheduling problem is formulated as:

(1a)
(1b)
(1c)
(1d)
(1e)
(1f)
(1g)
(1h)

The overall allocation scheme over both frequency bands is shown in Fig. 1.

Fig. 1: Different colors represent different UAs
Notations Description
Numbers of frequency band in W
Sets of frequency band in W
Numbers of frequency band in mmW
Sets of frequency band in mmW
Numbers of UAs needed to be allocated
Numbers of UAs allocated in mmW at each slot
Sets of UAs allocated in the QoS class
Sets of UAs allocated in the group t
Sets of UAs allocated in mmW of the group t
Sets of UAs allocated in W of the group t
Number of slots of the QoS class
Sets of slots of the QoS class
Sets of minimum power over W
TABLE I: Notations

Iii Group-based Algorithm

All UAs from the same UE have the same transmission channel and suitable RBs. If these UAs are not grouped, they will compete for possession of the same RB in the same slot. It degrades system performance. To solve this problem, our proposed GB algorithm assigns these UAs to different time slots. Uncertainty, including in large-scale pass loss, results from external factor are eliminated to ensure all UAs transmit in the same condition. Here, we take minimum power over W as a metric. Besides, the number of UAs in each group becomes an important factor that affects transmission when BS needs to serve great quantity of UAs.

Iii-a Problem and Algorithm

In this paper, the main goal of GB algorithm is to pursue the balance between overall power and the number of UAs for all time slots. Therefore, the problem can be formulated as:

(2a)
(2b)
(2c)
0:   in descending ordernumber of groups
0:  grouping situation
1:  Calculate the number of UAs expected in each group, and overall power, ;
2:  for  to  do
3:     if  then
4:        Add UA to group ;
5:     else
6:        for  to  do
7:           Calculate deviation between current number of UAs in group and , and the deviation is described as ;
8:           Calculate deviation between overall power of UAs in group and , and the deviation is described as ;
9:           Assume that group gains UA . Then deviation between current number of UAs in group and is calculated, and the deviation is described as ;
10:           Assume that group gains UA . Then deviation between current overall power in group and is calculated, and the deviation is described as ;
11:           Record D()=
12:        end for
13:        Compare all elements in D and add UA to the most suitable group.
14:     end if
15:  end for
Algorithm 1 Group-based (GB) Algorithm

Iii-B Parameter and Analysis

In Algorithm 1, and represent the degree of pursuit of the similar numbers and overall between groups, respectively. Algorithm 1 can adapt to various situations by adjusting the values of and . For instance, in the situation of small difference between and , it is necessary to increase properly to ensure all UAs are served effectively.

Iv Allocation Algorithm in dual-mode

To simplify the representations of , , and , we define

then the rate over both bands can be expressed as:

Assume that UA initially occupy RBs over W or RBs over mmW. To make sure (1c)-(1d) holds, we have

To satisfy the inequality of arithmetic and geometric means, we assume there are only

RBs over W or RBs over mmW available to transmit data for UA . Therefore, the required minimum energy can be expressed as

(3)

Considering MILP with high complexity in each group, decomposition the problem into dual frequency band can reduce the complexity. with several advantages of mmW, such as large bandwidth (for higher data transfer rates), low interference (systems with a high immunity to cramming), most UAs are inclined to be allocated over this band. UAs which are prone to be allocated to mmW have features of short-distance, less-obstacles, and low-power. At time slot , mmW allocation is performed firstly and the corresponding problem can be extracted from (1):

(4a)
(4b)
(4c)

where can be calculated by (3) directly. Now, there is only one variable left in the problem (4). Considering that UAs with low power are often more suitable for mmW, we use a greedy algorithm to solve the problem.

Next we schedule the rest of UAs in the group to W and the problem is formulated as

(5a)
(5b)
(5c)
(5d)

In the optimization problem (5), there exist two kinds of variables. is 0-1 variable and is continuous variable. It turns out that the problem is a mixed integer nonlinear programming problem (MINLP). For further analysis, determines whether UA obtains power in RB . Here, the problem is simplified with the product relationship between to replace (5a) (5c). Therefore, the optimization problem can be reformulated as:

(6a)
(6b)
(6c)

By using Lagrange multipliers [14], the Lagrangian is given by

where , and are the Lagrangian multipliers for the constraints (6a)-(6c), respectively. must be non-negative.

After differentiating with respect to , the necessary condition for optimal solution, and , is shown as follows:

Specially, if , we can get for all from (6b). The relationship between and is given by

(7)

We assume that RBs are allocated to UA . To guarantee UA satisfies (6a), we have

(8)

Unfortunately, is so hard to be solved that we cannot get the correct value of . Qualitatively, it is possible for long-distance UAs to require more RBs, owing to high . Therefore, the initial is proportional to distance. The first part is replaced by as an initial value, where represents the number of RBs allocated to UA ; For the second part, we take mean value of all RBs, , to replace .

Therefore, is initialized as:

(9)

Then, we substitute (9) into (7) and restrict to be greater than zero. Once

is determined, the problem in (5) becomes a 0-1 integer linear programming (0-1 ILP) problem, which can be formulated as:

(10a)
(10b)
(10c)

Increasing with the step of until feasible region of (10) is nonempty, we have

(11)

Suppose that UA and UA own sets of RBs and , respectively. Each RB cannot be allocated to different UAs, i.e., . According to (3), the minimum energy of both UAs over W is given by

Now, the ownership of RB transfers from UA to . UA owns sets of RBs . Then, the variation of power is given by

(12)

Similarly, UA owns sets of RBs . Normally, the inequality of arithmetic and geometric means holds and the variation of power is given by

(13)

Otherwise, we have

(14)

According to (12)-(14), it is easy to obtain the matrix recording gain and loss at each RB. So, any change of power at each RB, resulting from ownership transferring, can be obtained by adding elements in A. And the largest reduction at each RB is stored in matrix B. At every iterate, we choose which RB’s ownership should be transferred according to B.

0:  , , , ,
0:  Allocation in mmW and W;
1:  Calculate power of UAs need in mmW with (3) and sort them in ascending order;
2:  for  to  do
3:     Assign UA to mmW;
4:  end for
5:  Remove UAs already allocated in mmW and the rest of UAs are allocated to W;
6:  Initialize with (9) for all UAs;
7:  while Feasible region in (10) is empty do
8:     Increase in the step of ;
9:  end while
10:  Adjust power to reach minimization with (3);
11:  Calculate and by gaining and losing at all RBs;
12:  Transfer ownership the maximum element in ;
13:  repeat
14:     Step 10-12
15:  until Any RB’s ownership transferred leads to power increasing.
Algorithm 2 Allocation Scheme in Dual-mode Base Station, EOD algorithm

V Simulation Results

In this section, we evaluate the performance of our proposed GB-EOD algorithm scheme in a multiuser downlink dual-mode transmission system by comparing it with context-aware algorithm. As in [3], we assume BS is located at the center of the small cell as (0, 0). Besides,

UEs are assumed to be uniformly distributed within 5-200 meters away from BS. Each UE runs

UAs independently. Some simulation parameters are listed in TABLE II.

Parameters Value
Transmit bits for each UA, 10Kbits
Available bandwidth, 10MHz,1GHz
Bandwidth per RB, 180KHz,180KHz
Rician K-factor 2.4
large-scale channel effects, 38dB,70dB
large-scale channel effects, 3,2
large-scale channel effects, 10,5.2
Antenna gain, 18dBi
Time slot duration, 10ms
Beam-training overhead, 0.1ms
Number of UAs per UE, 3
Number of UAs in mmW at each slot, 20
Increasing step, 0.01
TABLE II: Some simulation parameters

V-a Power vs Number of UEs

Fig. 2 compares the performance of context-aware algorithm and GB-EOD algorithm. Under the premise of fixed power allocated to mmW in both algorithm, we compare the power required over W band. It shows that low power is required in GB-EOD algorithm. It is reasonable because GB-EOD scheme in the same power can serve more UAs with proper power allocation, thus reduce the transmitting pressure on the other band. It is similar with fixed power over W.

Fig. 2: Power comparison for two algorithm over both frequency bands

V-B Power vs Number of UAs allocated over mmW

Curves in Fig. 3 trace out effect of . It shows how changes in will affect the power consumption. As the number of UAs increases from 20 to 40, the average power first decrease and then increase. Downward power consumption curve results from more spectrum and beamforming technology over mmW band. Oppositely, upward power consumption curve implies the crowding over mmW. Therefore, we have reasons to believe that there exit a extreme point in each curve. The more UEs is, the smaller extreme point is.

Fig. 3: UAs allocated in mmW increasing from 20 to 40

Vi Conclusion

In this paper, multiuser downlink dual-mode system has been studied to minimize the power. Before allocated in dual-mode, UAs are divided into multiple groups for the propose of decreasing competition. In each group, all UAs must transmit successfully to ensure fairness. Over mmW band, we take a greedy algorithm to select short-distance and low-power UAs to perform efficiently. Over W band, we estimate by KKT conditions and take low-complexity algorithm to reduce power. Considering the performance of system, GB-EOD algorithm implements a pretty tradeoff between fairness and low power.

References

  • [1] S. Mumtaz, ”mmWave Massive MIMO: A Paradigm for 5G,” 2016
  • [2] S. Mumtaz and J. Rodriguez, ”Green Communication in 4G Wireless Systems,” 2013
  • [3] O. Semiari, W. Saad, and M. Bennis, “Joint Millimeter Wave and Microwave Resources Allocation in Cellular Networks with Dual-Mode Base Station,” IEEE Trans. Wireless Commun., vol. 16, pp. 4802–4816, Jul. 2017.
  • [4] C. Wong and R. Cheng, “Multiuser OFDM with Adaptive Subcarrier, Bit, and Power Allocation,” IEEE J. Sel. Areas Commun., vol. 17, pp. 1747–1757, Oct. 1999.
  • [5] K. Seong, M. Mohseni, and J. Cioffi “Optimal Resource Allocation for OFDMA Downlink Systems,” in Proc. IEEE Int. Symp. Inform. Theory (ISIT’2006), Seattle, USA Jul. 2006, pp. 1394–1398.
  • [6] M. Akdeniz, Y. Liu, and K. Samimi, “Millimeter Wave Channel Modeling and Cellular Capacity Evaluation,” IEEE J. Sel. Areas Commun., vol. 32, pp. 1164-–1178, Jun. 2014.
  • [7] Y. Wu, C. Xiao, Z. Ding, X. Gao, and S. Jin, ”MIMO transmission with discrete input signals: Technical challenges, advances, and future trends,” Proceeding of IEEE, vol. 106, pp.1799-1833, Oct. 2018.
  • [8] Y. Wu, J.-B. Wang, J. Wang, R. Schober, and C. Xiao, ”Secure transmission with large numbers of antennas and finite alphabet inputs,” IEEE Trans. Commun. vol. 65, pp. 3614-3628, Aug. 2017.
  • [9] Y. Wu, C.-K. Wen, D. W. K. Ng, R. Schober, and A. Lozano, ”Low complexity MIMO precoding for finite alphabet signaling,”  IEEE Trans. Wireless Commun. vol. 16, pp. 4571-4584, Jul. 2017.
  • [10] Y. Wu, R. Schober, D. W. K. Ng, C. Xiao, and G. Caire, ”Secure massive MIMO transmission with an active eavesdropper, ” IEEE Trans. Inf. Theory, vol. 62, pp. 3880-3890, Jul. 2016  (ESI Highly Cited Paper).
  • [11] A. Ghosh, R. Ratasuk, P. Moorut, T. S. Rappaport, and S. Sun, “Millimeter-Wave enhanced local area systems: A high-data-rate approach for future wireless networks,” IEEE J. Sel. Areas Commun., vol. 32, pp. 1152-–1163, Jun. 2014.
  • [12] S. Rangan, T. S. Rappaport, and E. Erkip, “Millimeter-wave cellular wireless networks: Potentials and challenges,” Proc IEEE, vol. 102, pp. 366-–385, Mar. 2014.
  • [13] J. Tang and X. Zhang, “Cross-Layer-Model Based Adaptive Resource Allocation for Statistical QoS Guarantees in Mobile Wireless Networks,” IEEE Trans. Wireless Commun., vol. 7, pp. 2318-–2328, Jun. 2008.
  • [14] S. Boyd and L. Vandenberghe, ”Convex Optimization.” 2004.