Service and interferenceaware dynamic TDD design in 5G ultradense network scenario
 Weidong Gao^{1}Email authorView ORCID ID profile,
 Binyong Lin^{1} and
 Gang Chuai^{1}
https://doi.org/10.1186/s1363801708774
© The Author(s). 2017
Received: 4 April 2017
Accepted: 5 May 2017
Published: 16 May 2017
Abstract
The 5G wireless communication system supports varied applications, making the uplink/downlink traffic asymmetry more and more serious. Dynamic time division duplex (TDD) technique has become a key technology of 5G networks due to its flexibility to support asymmetric services. In this paper, we study dynamic TDD subframe reconfiguration algorithm based on shifting. Firstly, we define cell shifting priority considering both traffic and interference. Then, we perform cell shiftingbased TDD subframe reconfiguration following cell shifting priority. Simulation results show that the proposed dynamic TDD algorithm can guarantee high data rate and low interference, thus effectively increases the network throughput.
Keywords
5G Traffic Interference Dynamic TDD Adaptive1 Introduction
In order to adapt to the explosive growth of mobile data in the future and speed up the application of new services, the 5th generation (5G) of mobile communication technologies came into being. So far, the vision and demand of 5G communication has been clear, while how to integrate a variety of new technologies and existing technologies to achieve an integrated 5G network has become the focus of the current research.
With the newly introduced crossslot interference as mentioned above, it is recognized the interference problem in dynamic TDD system is more serious than that of traditional LTE networks. In particular, the uplink reception performance may deteriorate dramatically for the reason that the base stations have greater transmission power and will lead to more crossslot interference [5]. Therefore, it is necessary to design proper dynamic TDD schemes that can effectively reduce the crossslot interference and ensure the system throughput. Otherwise, the throughput loss caused by crossslot interference may outweigh the throughput gain brought by dynamic TDD.
In addition to crossslot interference problems, the dynamic TDD also needs to consider the interference and traffic balance. For dynamic TDD, the ideal situation is to allocate uplink and downlink resources in proportion to their traffic volume. However, it is not enough to consider only the amount of traffic. If the interference is not carefully addressed, the system throughput may be seriously affected. Therefore, the uplink and downlink subframe reconfiguration scheme must take into account both the network traffic and network interference level to maximize the system throughput. As we know, 5G traffic has the characteristics of burst and fluctuation with time. At the same time, 5G traffic also has time correlation, which is stable in a certain period of time. Therefore, we should consider the unification of historical data and instantaneous data when considering traffic volume. To sum up, we need to combine the traffic characteristics and the interference levels to design a reasonable dynamic TDD scheme.
Literatures have studied varied dynamic TDD schemes, including the proportion method, greedy method, evolutionary game method, and soft reconfiguration method. For the proportion method [6], the TDD frame configuration whose UL/DL subframe ratio is closest to the UL/DL traffic ratio is adopted. The commonly used proportion method includes traffic volumebased schemes [7, 8] and bufferbased schemes [9–11]. The proportion method is simple, but it cannot fully reflect the needs of the network because it does not take into account the order of UL/DL subframes. Due to its simplicity, the proportion method is often used as the baseline scheme to measure the performance of newly proposed dynamic TDD schemes. The greedy method [12, 13] firstly calculates the gain of each subframe supposing it is an uplink subframe or a downlink subframe and configures the subframe following the direction that with larger gain. The greedy method is able to adapt to the instantaneous network load, but it might not be optimal during a long period of time. The central idea of evolutionary game algorithm [14] includes “choice” operation and “mutation” operation. A player (corresponding to a home base station) chooses its TDD frame configuration based on the utility function where the policy with greater utility function will be chosen with higher probability.
The soft reconfiguration method [15] reconfigures TDD frame configuration following a transition diagram, where for a cell, if the received interference from other cells is greater than a threshold, it will choose from the TDD frame configurations along the left direction of the transition diagram, and if the interference it introduces to other cells is larger than a second threshold, it will choose from the TDD frame configurations along the right direction of the transition diagram. Soft reconfiguration method can ensure that all the cells have a good SINR and therefore reduce the interference of the entire network. Moreover, because the difference between the adjacent frame configurations is small, the negative effect of frame reconfiguration is neglectable, which is helpful to the stability of the network. However, the soft reconfiguration method has two shortcomings that need to be enhanced. First, there may be a situation that the given two conditions are satisfied at the same time, i.e., a cell receives serious interference while it also introduces serious interference to other cells. When this happens, it is impossible to determine whether the TDD frame configuration should shift to left or to right along the transition diagram. Second, there is a probability that a cell is continuously receiving heavy interference from other cells under current TDD frame configuration, but it will cause severe interference to other cells when it shifts its TDD frame configuration along the right direction of the transition diagram, therefore resulting in back and forth reconfiguration between these two TDD frame configurations.
Inspired by the soft reconfiguration method, we in this paper propose an improved TDD frame configuration scheme based on shifting. In the proposed scheme, the cells are divided into groups, and it is regulated that the cells in each group can only shift along the same direction. At the same time, we also define the shifting priority, which is set according to the interference and traffic volume. These regulations ensure the practicability of the soft reconfiguration scheme.
2 System model
Consider a clustered network architecture, where the cells with severe crossslot interference are distributed to the same cell cluster and share the same TDD frame configuration. Commonly used clustering methods include threshold method [16–18] and heuristic algorithm [19]. Without losing generality, we use a threshold method that based on link coupling loss [17]. Taking a single cell cluster Β as an example, assume that there are a total of N cells in the cluster and M _{ i } users in cell #i.
where ⌈x⌉ is the ceiling function, \( {Q}_j^{UL}(t) \) and \( {Q}_j^{DL}(t) \) are the uplink and downlink data buffer size, and \( {C}_j^{UL} \) and \( {C}_j^{DL} \) are the UE’s average UL/DL throughput in its last TDD reconfiguration cycle. We can see from formula (1) that the number of downlink subframe is proportional to the downlink data buffer size of the cell and inversely proportional to the average throughput of last TDD reconfiguration cycle. Because the instantaneous buffer size and average throughput may be different, the downlink subframe requirements are usually different among the cells.
Based on the formula (8), we can design the corresponding dynamic TDD configuration scheme, which will be detailed in the next section.
3 Dynamic TDD frame configuration scheme
In this paper, we propose a shiftingbased TDD frame configuration scheme. The cells in a cluster are divided into three groups: leftshifting group, rightshifting group, and nonshifting group, and the cells in each group can only shift along the same direction, i.e., left or right. Furthermore, the shifting operations follow shifting priority rules.
3.1 Shifting priority
Every cell has a shifting priority, which is used to indicate the processing order of the corresponding cell, i.e., the cell with higher shifting priority can prioritize its TDD frame configuration. The cell shifting priority is composed of two parts: the interference priority part and the service priority part. The interference priority is defined as the worst SINR deviation from the SINR threshold (it should be ensured that the worst SINR of a cell should be greater than the SINR threshold). The higher the interference priority is, the easier it can meet the requirements of the interference conditions and the greater it can contribute to the cell shifting priority. The service priority indicates how close the radio frame configuration is to the traffic; the higher the service priority is, the easier it can satisfy the requirement of the traffic and the greater it can contribute to the cell shifting priority.
We know that the more downlink subframes a cell uses, the stronger its antiinterference ability is and the more interference it will bring to other cells. For a low SINR cell, it is better to increase the downlink subframes to enhance its antiinterference ability, and we use its neighboring cell’s worst SINR reduction as the interference priority, which is denoted as \( {S}_R^i \). Similarly, for a high SINR cell, we should reduce its downlink subframes to reduce the interference to adjacent cells, and we use its worse SINR reduction as the interference priority, which is denoted as \( {S}_L^i \).
The service priority is relevant to the traffic volume and cell clustering strategy, considering that it is not deterministic whether l _{ i } or l is larger and there are two situations when calculating the service priority: (1) If l _{ i } is larger than l, improving the service priority is equivalent to increasing the number of downlink subframes, which is denoted as \( {\mathrm{Traffic}}_R^i \); (2) if l _{ i } is smaller than l, improving the service priority is equivalent to decreasing the number of downlink subframes, which is denoted as \( {\mathrm{Traffic}}_L^i \).
When the interference priority and the service priority are jointly considered, the shifting priority calculation can be divided into two cases: (1) If there are few downlink subframes, we need to increase the downlink subframes to increase the shifting priority \( \mathrm{Prio}{\mathrm{r}}_R^i \) that is determined by \( {S}_R^i \) and \( \mathrm{Traffi}{\mathrm{c}}_R^i \); (2) if there are excessive downlink subframes, we need to decrease the downlink subframes to decrease the shifting priority \( \mathrm{Prio}{\mathrm{r}}_L^i \) that is determined by \( {S}_L^i \) and \( {\mathrm{Traffic}}_L^i \).
3.1.1 Case 1: shifting priority calculation when increasing downlink subframes
Assume the downlink subframe number of cell #i is ω _{ i }, and we will calculate its cell shifting priority \( \mathrm{Prio}{\mathrm{r}}_R^i \) when its downlink subframes increase to ω _{ i } + 1, where 1 ≤ ω _{ i } < T − 1.
It is obvious that \( 1\ge \varDelta {\mathrm{SINR}}_R^{ik}\ge 0 \), where \( \varDelta {\mathrm{SINR}}_R^{ik}=0 \) means that the worst SINR of cell #k will not deteriorate and \( \varDelta {\mathrm{SINR}}_R^{ik}=1 \) means that the worst SINR of cell #k will decrease to Thres, which is the worst case among the viable options. \( \varDelta {\mathrm{SINR}}_R^{ik}>1 \) indicates that the worst SINR of cell #k is lower than the threshold and it is not a viable option.
 1.
If \( \varDelta {\mathrm{SINR}}_R^{ik}<1 \), \( {S}_R^i \) is a viable option and a finite positive number. The closer to 0 the value of \( \varDelta {\mathrm{SINR}}_R^{ik} \) is, the bigger the \( {S}_R^i \) will be; the closer to q the value of \( \varDelta {\mathrm{SINR}}_R^{ik} \) is, the smaller the \( {S}_R^i \) will be. It is ideal that all \( \varDelta {\mathrm{SINR}}_R^{ik} \) values stay away from 1, i.e., the closer to 1 the value of \( \varDelta {\mathrm{SINR}}_R^{ik} \) is, the greater it will impact on \( {S}_R^i \). Considering this characteristic, we use harmonic mean value for \( {S}_R^i \).
 2.
If \( \varDelta {\mathrm{SINR}}_R^{ik}=1 \), \( {S}_R^i \) is the worst case among the viable options, whose value is 0.
 3.
If \( \varDelta {\mathrm{SINR}}_R^{ik}>1 \), \( {S}_R^i \) is not a viable option and it has a negative value.
Considering there are cases that ω _{ i } > l _{ i }, we use absolute value that is adopted for the denominator of the formula (12). Due to that l _{ i } > l, \( {\mathrm{Traffic}}_R^i>0 \) holds. The greater the value of \( {\mathrm{Traffic}}_R^i \) is, the more accurate it can reflect the actual traffic needs, and the greater the shifting priority will be.
3.1.2 Case 2: shifting priority calculation when decreasing downlink subframes
Assume the downlink subframe number of cell #i is ω _{ i }, and we will calculate its shifting priority Prior^{ i } when its downlink subframes decrease to ω _{ i } − 1, where 1 ≤ ω _{ i } < T − 1.
After obtaining the shifting priority that is determined by both of the interference priority and the traffic priority, if we want to increase the downlink subframes, we can choose the cell with the maximum \( \mathrm{Prio}{\mathrm{r}}_R^i \) value, and if we want to decrease the downlink subframes, we can choose the cell with the maximum \( \mathrm{Prio}{\mathrm{r}}_L^i \) value.
3.2 Dynamic TDD frame configuration
For the dynamic TDD frame configuration method based on traffic and interference, we give priority to increasing the downlink subframes for cells with high \( \mathrm{Prio}{\mathrm{r}}_R^i \) and decreasing the downlink subframes for cells with high \( \mathrm{Prio}{\mathrm{r}}_L^i \). The TDD frame configuration includes the following processes.
3.2.1 Cell set partition
 1.
Both the uplink subframes and downlink subframes are continuous; furthermore, the downlink subframes are in front of the uplink subframes.
 2.
For any TDD configuration, there is at least one uplink subframe and one downlink subframe, so that there is traffic in the downlink direction and uplink direction at any time, i.e., ω _{ i } ∈ {1, 2, …, T − 1}.
We do not deal with the cells in the nonshifting group, and we shift to the right for the cells in the rightshifting group and shift to the left for the cells in the leftshifting group. Next, we will obtain the right shifting priority \( \mathrm{Prio}{\mathrm{r}}_R^i \) and left shifting priority \( \mathrm{Prio}{\mathrm{r}}_L^i \), respectively.
3.2.2 Right shifting and left shifting
We will choose proper cells from the rightshifting group to move them to the right. Firstly, we need to calculate the right shifting priority for all the cells within the group. Right shifting priority has taken into account the factors of traffic and interference, and the right shifting operation will increase the interference to other cells and reduce the interference to itself. The value of \( \mathrm{Prio}{\mathrm{r}}_R^i \) may be positive, zero, or negative. Positive value means that the right shifting operation will make the network performance better, negative value means the opposite, and zero value indicates that the gain and loss are balanced.
 1.
If \( \max \left(\mathrm{Prio}{\mathrm{r}}_R^i\right)>0 \) holds for all cells in the rightshifting group, the cell with maximal \( \mathrm{Prio}{\mathrm{r}}_R^i \) will be selected. If there are more than one cell meet this condition, select one from them randomly.
 2.
If \( \max \left(\mathrm{Prio}{\mathrm{r}}_R^i\right)=0 \), then select the cell with the smallest impact on other cells’ SINR by right shifting operation.
 3.
If \( \max \left(\mathrm{Prio}{\mathrm{r}}_R^i\right)<0 \), ignore the right shifting operation.
Similar to the right shifting operation, we can compute the left shifting priority for the cells in B _{ L }. Left shifting priority also needs to consider the amount of traffic and interference, because the left shifting operation will reduce the interference to other cells and increase the interference to themselves. After obtaining the left shifting priority, we can select the cell from B _{ L } that needs to shift left. The leftshifting cell selection principle is similar to that of the right shifting priority, which is omitted here.
3.2.3 Shifting flow

Step 1: Obtain the downlink subframe numbers l _{ i } and l according to formulas (1) and (2). Partition the cells into three groups: leftshifting group B _{ L }, rightshifting group B _{ R }, and nonshifting group B _{ M }.

Step 2: If the corresponding interference is small for l _{ i }, i.e., it meets the condition of formula (8), then the shifting strategy which coincides with the WTDD method [19] is adopted, and if the corresponding interference for l is too big, the CTDD method is adopted. In all other cases, shiftingbased dynamic TDD is used.

Step 3: The initial state is the same as that of WTDD method.

Step 4: Calculate the right shifting priority according to the formulas (9)~(13) and perform right shifting operation following the principle of right shifting.

Step 5: Calculate the left shifting priority according to the formulas (14)~(18) and perform left shifting operation following the principle of left shifting.

Step 6: Iterate step 3 and step 4 until the condition of formula (8) is met for all cells.
4 Simulation results
4.1 Simulation parameters
Simulation parameters
Name  Value 

Simulation scenario  2 clusters/macro cell; 4 small cells/cluster 
Intersite distance  30 m 
Carrier frequency  3.5 GHz 
Bandwidth  10 MHz 
Channel model  ITU M.2135 UMi 
Transmit power  24 dBm 
Scheduling strategy  Proportional fairness (PF) 
UE number  2 UE/macro cell 
Antenna pattern  Omnidirectional 
Antenna height  Base station, 6 m UE, 1.5 m 
Antenna gain plus connection loss  5 dBi 
UE movement speed  3 km/h 
Service type  FTP model 1: λ _{UL} = λ _{DL} = 0.5 (low arrival rate); λ _{UL} = λ _{DL} = 1.5 (moderate arrival rate) 
Reconfiguration cycle  40 ms 
Worst SINR threshold (STDD)  0 dB 
4.2 Simulation results
In order to verify the effectiveness of the proposed shiftingbased dynamic TDD (STDD) scheme, the performance is compared with that of WTDD algorithm [22] and CTDD algorithm [21].
The proposed STDD algorithm preserves partial crossslot interference and traditional interference, and the SINR performance lies between that of WTDD algorithm and that of CTDD algorithm. The STDD method sets the worst SINR threshold to 0, because the SINR of almost all users is greater than 0 and it can ensure the fairness among the UEs and avoid the emergence of poor wireless links.
5 Conclusions
This paper presents a dynamic TDD algorithm that considers both traffic and interference factors to guarantee system performance. The proposed dynamic TDD method shows better performance on the aspect of uplink and downlink throughput in cases of low to moderate load comparing with that of WTDD method and CTDD method. Furthermore, the proposed method will turn into WTDD method or CTDD method in conditions of low SINR or high SINR, respectively. The proposed dynamic TDD method can avoid the occurrence of wireless communication links with too low SINR, which ensures high average packet throughput.
Declarations
Funding
This work is supported by Major National Scientific & Technological Specific Project of China under grant number 2016ZX03001009003.
Authors’ contributions
WG conceived and designed the study. BL performed the experiments. GC reviewed and edited the manuscript. All authors read and approved the manuscript.
Competing interests
The authors declare that they have no competing interests.
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.
Authors’ Affiliations
References
 B Li, SH Li, A Nallanathan, CL Zhao, Deep sensing for future spectrum and location awareness 5G communications. IEEE Journal Selected Areas Communications 33(7), 1331–1344 (2015)View ArticleGoogle Scholar
 B Li, Z Zhou, WX Zou, XB Sun, GL Du, On the efficient beamforming training for 60 GHz wireless personal area networks. IEEE Trans. Wireless Commun. 12(2), 504–515 (2013)View ArticleGoogle Scholar
 B Li, Z Zhou, ZHJ Zhang, A Nallanathan, Efficient beamforming training for 60GHz millimeterwave communications: a novel numerical optimization framework. IEEE Transactions on Vehicular Technology 63(2), 703–717 (2014)View ArticleGoogle Scholar
 3GPP TR 36.932, Scenarios and requirements for small cell enhancements for EUTRA and EUTRAN (Release 12), v12.1.0, 2013Google Scholar
 Y Wang, M Tao, Dynamic uplink/downlink configuration using Qlearning in femtocell networks. 2014 IEEE/CIC International Conference on Communications in China (ICCC), Shanghai, 2014, pp. 53–58Google Scholar
 H Sun, M Sheng, M Wildemeersch, TQS Quek, Coverage analysis for twotier dynamic TDD heterogeneous networks. 2014 IEEE Global Communications Conference, Austin, TX, 2014, pp. 3672–3677Google Scholar
 Y Gao, L Cheng, Y Li, X Zhang, D Yang, Performance evaluation on cell clustering interference mitigation and CoMP in multipico network with dynamic TDD. 2015 IEEE 81st Vehicular Technology Conference (VTC Spring), Glasgow, 2015, pp. 1–5Google Scholar
 M Ding, D LópezPérez, AV Vasilakos, W Chen, Analysis on the SINR performance of dynamic TDD in homogeneous small cell networks. 2014 IEEE Global Communications Conference, Austin, TX, 2014, pp. 1552–1558Google Scholar
 A Khoryaev, A Chervyakov, M Shilov, S Panteleev, A Lomayev, Performance analysis of dynamic adjustment of TDD uplinkdownlink configurations in outdoor picocell LTE networks. 2012 IV International Congress on Ultra Modern Telecommunications and Control Systems, St. Petersburg, 2012, pp. 914–921Google Scholar
 H Sun, M Wildemeersch, M Sheng, TQS Quek, D2D enhanced heterogeneous cellular networks with dynamic TDD. IEEE Transactions on Wireless Communications 14(8), 4204–4218 (2015)View ArticleGoogle Scholar
 Y Li, Z Lin, H Liu, Y Gao, X Zhang, X Liu, Performance evaluation of a resource allocation scheme for mixed traffic in dynamicTDD network. 2014 IEEE 80th Vehicular Technology Conference (VTC2014Fall), Vancouver, BC, 2014, pp. 1–5Google Scholar
 K Nguyen, L Zappaterra, HA Choi, A centralized algorithm for dynamic TDD frame reconfigurations in synchronized HetNets. 2015 IEEE International Conference on Communication Workshop (ICCW), London, 2015, pp. 113–118Google Scholar
 MS ElBamby, M Bennis, W Saad, M Latvaaho, Dynamic uplinkdownlink optimization in TDDbased small cell networks. 2014 11th International Symposium on Wireless Communications Systems (ISWCS), Barcelona, 2014, pp. 939–944Google Scholar
 M Tao, Q Cui, X Tao, H Xiao, Realtime dynamic clustering for interference and traffic adaptation in wireless TDD system. 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS), Orlando, FL, 2014, pp. 128–133Google Scholar
 AM Fouladgar, O Simeone, O Sahin, P Popovski, S Shamai, Joint interference alignment and bidirectional scheduling for MIMO twoway multilink networks. 2015 IEEE International Conference on Communications (ICC), London, 2015, pp. 4126–4131Google Scholar
 CC Chao, CH Lee, HY Wei, CY Wang, WT Chen, Distributed dynamicTDD resource allocation in femtocell networks using evolutionary game. 2015 IEEE 26th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC), Hong Kong, 2015, pp. 1157–1162Google Scholar
 F Sun, Y Zhao, Cell clusterbased dynamic TDD DL/UL reconfiguration in TDLTE systems. 2016 IEEE Wireless Communications and Networking Conference, Doha, 2016, pp. 1–5Google Scholar
 D Della Penda, L Fu, M Johansson, Energy efficient D2D communications in dynamic TDD systems. IEEE Transactions on Communications 65(3), 1260–1273 (2017)View ArticleGoogle Scholar
 A Lukowa, V Venkatasubramanian, Performance of strong interference cancellation in flexible UL/DL TDD systems using coordinated muting, scheduling and rate allocation. 2016 IEEE Wireless Communications and Networking Conference, Doha, 2016, pp. 1–7Google Scholar
 F Sanchez Moya, V Venkatasubramanian, P Marsch, A Yaver, D2D mode selection and resource allocation with flexible UL/DL TDD for 5G deployments. 2015 IEEE International Conference on Communication Workshop (ICCW), London, 2015, pp. 657–663Google Scholar
 J Liu, S Han, W Liu, Performance gain of full duplex over half duplex under bidirectional traffic asymmetry. 2016 IEEE International Conference on Communications Workshops (ICC), Kuala Lumpur, 2016, pp. 98–103Google Scholar
 P Popovski, O Simeone, JJ Nielsen, Č Stefanović, Interference spins: scheduling of multiple interfering twoway wireless links. IEEE Communications Letters 19(3), 387–390 (2015)View ArticleGoogle Scholar
 M Tao, Q Cui, Y Hong, C Yin, H Liang, Max KCUT based clustering for interference mitigation and traffic adaptation in TDD systems. 2014 IEEE 79th Vehicular Technology Conference (VTC Spring), Seoul, 2014, pp. 1–5Google Scholar
 L Xue, Y Cheng, Y Zhou, B Qu, Next generation TDD cellular communication. 2015 49th Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, 2015, pp. 1036–1040Google Scholar