An Access Selection Algorithm for Heterogeneous Wireless Networks Based on Optimal Resource Allocation

Wireless networks form heterogeneous wireless networks (HWNs) with overlapping signal coverage, and access selection is one of the key technologies of HWNs. Today, most access selection algorithms select appropriate networks mainly from the perspective of users while failing to consider resource allocation and optimize the overall transmission performance of HWNs. This paper proposes an access selection algorithm for HWNs based on optimal resource allocation by analyzing the wireless link transmission rate model, focusing on maximizing the HWN transmission rate, using the dynamic programming theory to derive the optimal value of bandwidth allocated to users. Experimental results show that the algorithm proposed in this paper can effectively improve network throughput and resource utilization and can connect users to the appropriate network according to QoS rate requirements.


Introduction
In recent years, various wireless communication technologies, such as cellular networks, wireless local area networks (WLAN), and wireless metropolitan area networks (WMAN), have achieved rapid development. Within the signal coverage of cellular networks, a variety of other wireless access networks are deployed, forming heterogeneous wireless networks (HWNs) in which multiple networks coexist with overlapping signal coverage [1,2].
Access selection is one of the key technologies of HWNs. Their main function is to control users' access requests and select a network that provides connection services [3,4]. For traditional access selection algorithms, the decision parameters are mainly related to the quality of the wireless link (e.g., received signal strength (RSS) or signal to interference plus noise ratio (SINR)). The basic idea of such algorithms is that user terminals are allowed to access the network with the highest RSS and all users in the same network share the network resources relatively equally. While such algorithms are simple, too many users may end up accessing the same wireless network at once, creating insuffi-ciency in the utilization of network resources and low network capacity [5].
Additionally, some studies comprehensively consider multiple decision parameters (e.g., RSS, bandwidth, network load, delay, delay jitter, packet loss ratio, movement speed, service price, and energy consumption) and use mathematical models to study the access selection of HWNs, such as multiple attribute decision-making [6,7], utility theory [8,9], game theory [10,11], Markov decision process [12,13], and fuzzy logic [14,15]. These algorithms are mainly based on the principle of "always best connected" [16] and comprehensively calculate a plurality of decision parameters to obtain the ranking of comprehensive scores of candidate networks. As a result, a network with the highest score is selected from a group of candidate networks.
While the above algorithms solve the network access problem and can select a suitable network for users, they fail to optimize the performance of HWNs, which is not conducive to the effective utilization of the overall network resources. Moreover, they do not calculate the specific resource allocation. In addition, with the increase of the number of decision parameters and users, these algorithms become increasingly complex [17]. Therefore, how to optimize the utilization of wireless resources and improve the overall performance of networks is the research motivation of this paper, along with selecting the appropriate network for users.
In this paper, an optimal resource allocation access selection algorithm (ORAAS) is proposed. Firstly, the transmission rate model of a wireless link is analyzed, and the problem is modeled as maximizing the network transmission rate. Then, we use the dynamic programming theory to calculate the optimal value of the bandwidth resources allocated to each user under the maximum network transmission rate. Finally, we connect users to the appropriate network according to the bandwidth resources allocated by the network and the QoS rate requirements of users. The main contributions of this paper are as follows: (1) Divide the solution of the target problem into several interrelated phases according to the number of users and break down the problem of maximizing the system transmission rate for all users into subproblems of maximizing the system transmission rate for different users (2) Utilize the bandwidth resource allocation state of the previous user when solving each subproblem in order to calculate the optimal bandwidth resource allocation to the next user, thereby gradually obtaining the optimal bandwidth allocation value for each user at the maximum system transmission rate (3) Solve the maximum value of the network transmission rate and the optimal value of the user bandwidth resource allocation simultaneously (4) Improve the network transmission performance under the HWN access selection simulation and optimize the resource utilization efficiency through the proposed algorithm The rest of this paper is organized as follows: Section 2 reviews the research work related to this article, Section 3 describes the system model and problem definition in detail, Section 4 solves the problem and designs the algorithm, Section 5 introduces in detail the experimental environment used for the performance analysis and discusses the experimental results, and Section 6 summarizes the paper and introduces further research work.

Related Work
According to different optimization objectives, resource allocation in HWNs is currently divided into user-oriented utility optimization and system-oriented utility optimization [18,19]. User-oriented utility optimization mainly selects parameters related to user QoS, such as RSS, bandwidth, blocking rate, and price, to evaluate the network performance, and allocates resources on the premise of optimizing user utility [20]. System-oriented utility optimization is mainly to maximize the utility of HWNs through resource allocation, traffic flow scheduling, load allocation, and other means in access selection, including maximizing the number of accessing users, maximizing network capacity, and maximizing energy conservation [21].
Jiang et al. [22] proposed different delay constraints for different services and designed a new and effective network selection strategy in a HWN communication environment, which incorporates delay in the calculation of transmission rate. Users can access the appropriate network after considering the delay requirements of different services. The algorithm greatly improves the throughput of HWNs and guarantees the QoS.
Niyato and Hossain [23,24] proposed a game theory framework for bandwidth allocation and access control in HWNs. The optimal bandwidth allocation is obtained by calculating the Nash equilibrium of noncooperative games, which maximizes the utility of all connections in the network. Then, based on the obtained bandwidth allocation, the capacity reservation threshold is calculated by a bargaining game to meet the QoS requirements of different types of connections.
BenMimoune et al. [25] proposed an access selection and power allocation scheme in HWNs based on the Voronoi diagram to increase the number of access users and system throughput. As a result, this reduces the call blocking rate and improves energy efficiency.
Choi et al. [26] studied the interface and frequency band selection of mobile users and the power allocation of selected links in an HWN environment. In addition, the authors analyzed the parallel transmission of multiradio access, proposed a distributed joint allocation algorithm to maximize the total system capacity, and solved the bandwidth and power allocation problems of access links.
Wang et al. [27] studied the joint optimization of user connection and resource allocation in HWNs. First, the problem of user association and subchannel allocation for fixed power allocation is derived based on the graph theory, then the power allocation problem in the case of fixed user association and subchannel allocation is derived by using the convex function approximation approach, and finally, the authors proved that the proposed algorithm improves the overall network throughput through the simulation. This paper proposes an access selection algorithm based on optimal resource allocation. The algorithm calculates the optimal value of bandwidth resources allocated to each user at the maximum network transmission rate and connects users to the appropriate network according to the user's QoS rate requirements. The algorithm improves the network performance and resource utilization.

System Model and Problem Definition
3.1. System Model. Assume that a HWN includes n radio access networks (RAN) with overlapping signal coverage and that there is no interference in wireless signals. Each radio access network has its own architecture, and the networks communicate with each other through core network interconnection [28]. m mobile user terminals are randomly 2 Wireless Communications and Mobile Computing distributed in the signal ranges of HWNs, and the user terminals are multimode terminals capable of processing all radio access technologies. In addition, assume that a user terminal can access one or more wireless networks in parallel at the same time and that the access selection is controlled by the user terminal. The HWN selection scenario in this paper is shown ( Figure 1). For the convenience of explanation, the main mathematical symbols used in this paper and their descriptions are shown (Table 1).

Problem Definition.
Assume that User i is connected to wireless Network j and that the bandwidth resource allocated by User i in Network j is b i,j . According to the Shannon capacity formula [22,26], the maximum data transmission rate that can be reached by User i in Network j can be defined as In Formula (1), β j is the network effectiveness coefficient of Network j, which can be set according to the characteristics of different networks. For example, for Network j with better coding, the value of its β j is higher than that of other networks using traditional coding. In this paper, β j represents the bandwidth efficiency of wireless networks, that is, the bandwidth effectiveness of each network, and 0 ≤ β j ≤ 1. In addition, b i,j indicates the band-width resources obtained by User i in Network j, p i,j indicates the transmission power of User i in Network j, and N o is the thermal noise power spectral density.
In this paper, the user terminal supports multilink parallel access to n networks, and according to Formula (1), the maximum data transmission rate that User i can achieve is Since bandwidth allocation may affect the transmission rate of users, from the perspective of the whole HWNs, it is always expected that all users receive a reasonable bandwidth in each wireless network, enabling HWNs to reach the maximum transmission rate. Therefore, the problem is defined as follows: The first constraint condition ∑ m i=1 b i,j ≤ B j in Formula (3) represents that the total bandwidth allocated to all users in Network j should be less than or equal to the total bandwidth of Network j. In addition, the second constraint condition

Problem Solving and Algorithm Design
In this section, the problem in this paper is first analyzed according to the principle of dynamic programming. Next, the calculation process of the optimal bandwidth allocation, which maximizes the network rate, is detailed. Finally, the pseudocode of the access selection algorithm is provided based on optimal bandwidth resource allocation.

Concepts to the Dynamic Programming Theory.
According to the definition of the problem given in the previous section and to make HWNs obtain the maximum transmission rate, namely, making every radio access network in HWNs reach the maximum transmission rate, the maximum data transmission rate of network j can be expressed as follows: To make the network reach the maximum transmission rate, it is necessary to obtain the optimal solution of the bandwidth allocation to each user in the network. In this paper, the dynamic programming theory is used to solve this problem, with the key terms defined as follows: (i) Stage: to solve the optimal bandwidth allocation to m users and maximize the network transmission rate, the problem is divided into several interrelated "stages" in order to solve it in a certain order. In this paper, for the same network, the bandwidth allocation to m users can be seen as a sequential process (i.e., the bandwidth is first allocated to User 1 and then User 2, up to User m). Therefore, m users are divided into m stages. Each stage is to allocate bandwidth to the user in that stage. The purpose is to breakdown the problem solving process into a multistage decision-making process.
(ii) State: from the dynamic programming model, "state" describes the natural state at the beginning of each stage throughout the whole research process of the problem. Usually, a stage contains several states, and the set they constitute is called the reachable state set. Here, s i is used to represent state variables of Stage i, and s i is the bandwidth resources assignable by User i in the network. In addition, S i represents the set of the reachable states at Stage i. For example, when the state variable is s i = 10, the set of the reachable states is S i = fs i | s i ∈ ½0, 10g. By definition, S i is both the starting point of the bandwidth resource state of User i (i.e., Stage i) and the end point of the resource state of User i − 1 for completing bandwidth allocation (i.e., Stage i − 1). Moreover, after the state of User i is determined, the bandwidth resource allocation to User i and all following users are not affected by the users before User i.
(iii) Decision: "decision" refers to the action performed in a multistage decision-making process at the specific state of a certain stage. In this paper, the decision variable b i represents the bandwidth value allocated to User i when the bandwidth resource state is s i , and for Network j, it is b i,j . By definition, b i is the function of state variable s i , which can be expressed as b i ðs i Þ. The value of decision variable b i is generally not unique but allowed within a certain range. This paper uses D i ðs i Þ to represent the set of decisions allowed by User i in the state s i , so as to obtain b i ðs i Þ ∈ D i ðs i Þ. For example, when the state variable s i = 10, b i ðs i Þ ∈ ½0, 10.
(iv) Policy: "policy" refers to the set established by the above-mentioned decisions in order. In this paper, the bandwidth allocation policies adopted from User i to User m are the set of bandwidth allocation decisions from User i to User m in sequence, namely,  (5), it represents a subpolicy composed of decisions at each stage from User i to User m, which is recorded as p i,m ðs i Þ. When i = 1, this decision sequence is the policy of the whole process, which is recorded as p 1,m , that is, a set of decisions for bandwidth allocation to all users in the network in sequence, namely, In addition, since there are many different policies for bandwidth allocation to all users, the optimal policy is the one that maximizes the network speed among all the policies, which is recorded as p * 1,m , namely, (v) State transition equation: the "state transition equation" represents the transition relationship between two adjacent states from Stage i to Stage i + 1, that is, the value of the state variable s i+1 of Stage i + 1 is determined jointly by the state variable s i of Stage i and the decision variable b i of Stage i. The transition relationship between the above two states can be recorded as follows: In this paper, if the state variable of User i is S i and the bandwidth allocation decision for User i is b i , then the state variable of User i + 1 can be obtained as follows: (vi) Index function and optimal index function value: in this paper, R i,m represents the sum of transmission rates from User i to User m, and according to Formula (4) and the above definition, R i,m can be expressed as a function of s i , b i , and R i+1,m , and R i,m satisfies the recurrence relation: In Formula (10), r i ðs i , b i Þ indicates the stage index value of User i, that is, the rate that User i can reach after obtaining bandwidth. In addition, the optimal index function value achieved by adopting the optimal bandwidth allocation policy from User i to User m is recorded as R * i ðs i Þ, namely, According to the above definition, the maximum transmission rate for a certain wireless network is determined by breaking down this problem into a multistage decision-making process ( Figure 2).
According to the problem defined in Formula (4) and the principle of optimality of dynamic programming, the user bandwidth allocation policy is determined to be a sufficient and necessary condition for the optimal policy.
In Formula (12) See Appendix A for the proof of the theorem.
Inference 2. If the bandwidth allocation policy p * 1,m is the optimal policy to maximize the network transmission rate, then for any User i, its subpolicy p * i,m must be the optimal policy for the subprocess with the starting point as See Appendix B for the proof of the inference.

Calculation of Optimal Bandwidth Allocation Value.
In the above section, the stages, states, decisions, and policies are defined and explained, and the problem of determining the maximum network rate is divided into several interrelated stages according to the number of users based on the dynamic programming model. This means that a huge problem is broken down into a series of subproblems of the same type, and they are solved one by one. This section determines the user's optimal bandwidth allocation value and the maximum network rate that can be reached according to the state transition equation, There are two methods to solve problems based on the dynamic programming model: the reverse order method and the sequential method. This paper uses the reverse order method. First, according to the boundary condition R m+1 ðs m+1 Þ = 0 and starting from i = m, the optimal bandwidth resource value allocated to users in each stage and the corresponding maximum network rate value are obtained step by step, from backwards to forwards. In the solution of subproblems in each stage, the optimal solutions of subproblems in the previous stage are used. For the last user and when determining R * 1,m ðs 1 Þ, the maximum value of the network rate for all users is obtained. According to Formula (4), the index function is the sum of rates for all users in the network, and according to the reverse order solution, its basic equation is To solve the bandwidth allocation at the maximum network transmission rate, according to the reverse order solution, and using the theorem and inference derived in the previous section, from the last User m, the following is obtained: in which, D m ðs m Þ is a set of decisions to allocate bandwidth size for User m determined by bandwidth resource state s m . By solving this problem, the optimal bandwidth resource allocation value b * m ðs m Þ of User m and the maximum value R * m ðs m Þ of the network transmission rate when User m is included are obtained.
For the sum of transmission rates from User m − 1 to User m, the following can be obtained: Similarly, for the sum of transmission rates from User i to User m, the following is concluded: in which s i+1 = s i − b i , and the bandwidth resource allocation value b * i ðs i Þ of User i and the maximum network transmission rate R * i,m ðs i Þ under the circumstance from User i to User m are obtained from the results of the previous User i + 1.
Similarly, up to User 1, for the sum of transmission rates from User 1 to User m, the following is obtained: in which s 2 = s 1 − b 1 , and by solving the maximum value of the above formula, the bandwidth resource allocation value b * 1 ðs 1 Þof User 1 and the maximum transmission rate R * 1,m ðs 1 Þ of the entire network can be obtained. Since the total bandwidth resources of the network are known (i.e., the initial state s 1 is known), b * 1 ðs 1 Þ and R * 1,m ðs 1 Þ can be determined, and the value of the state s 2 can also be obtained from s 2 = s 1 − b 1 , so b * 2 ðs 2 Þ and R * 2,m ðs 1 Þ can also be determined. The bandwidth allocation decision and transmission rate for each user can be determined step by step according to the reverse order of the above recursive process, which reveals the maximum network transmission rate.
In addition, since both the bandwidth resource state s i and the bandwidth allocation value b i are continuous real variables, the set of the reachable states S i and the set of the resource allocation decisions D i ðs i Þ are both real number sets. In addition, the real closed interval of the set of the reachable states S i in each stage is ½s i , s i . The above-mentioned problems in the simulation are solved by first discretizing s i and selecting the appropriate increment Δs before calculating. In Stage i, the calculation will be carried out on the point column fs i , s i + Δs, ⋯, s i + t i Δsg, where t i is a positive integer and satisfies

Design of Access Selection Algorithm Based on Optimal
Bandwidth Resource Allocation. After solving the bandwidth value allocated to users by each network, the transmission rate r i,j that can be reached by User i in Network j is obtained according to Formula (1). Assuming that the minimum rate requirement of User i in Network j is r req min i,j , the user is connected to the corresponding network according to the user rate requirement. If Network j cannot meet the minimum rate requirement of User i in the network (i.e., r i,j < r req min i,j ), User i will not access Network j. On the contrary, if Network j can meet the minimum rate requirement of User i in the network, then that network is accessed. In particular, if multiple networks can satisfy the rate requirements after allocating bandwidth to users, users can access these networks simultaneously and in parallel. Therefore, the pseudocode of the access selection algorithm based on optimal bandwidth resource allocation is as follows: 6 Wireless Communications and Mobile Computing

Experiment and Performance Analysis
This section analyzes the performance of the algorithm proposed in this paper. First, the experimental environment is described, including the simulations and experimental parameter settings. Then, the optimal resource allocation access selection algorithm (ORAAS) is analyzed. Finally, the ORAAS algorithm is compared with the RSS algorithm.

Setting of Experimental Parameters.
The simulation network environment in this paper includes one LTE eNB node, one WLAN AP node, and one WiMAX BS node. Here, the total bandwidth of WLAN network access points is B 1 = 20 MHz, with coordinates of (0, 0); the total bandwidth of LTE network access points is B 2 = 25 MHz, with coordinates of (200, 0); and the total bandwidth of WiMAX network access points is B 3 = 10 MHz, with coordinates of (0, 200), and the network effectiveness coefficients β for WLAN, LTE, and WiMAX are set to 0.95, 0.9, and 0.85, respectively. In addition, in this experiment, the user emission power is set to 20 mW, the thermal noise power spectral density to N 0 = −174 dBm/ Hz, and the increment Δs of discretization processing of s i is set to 0.02. To calculate the RSS between the access point and the user, the experiment uses an improved model based on the COST-231 Hata model to calculate the path loss PL dB .
The distance d from each user to each access point is calculated based on the coordinates of users and network access points. Thus, the corresponding path loss PL dB is calculated according to Formula (21), with the specific data being shown in Table 2.
After obtaining the path loss PL dB , the optimal bandwidth allocation value and the maximum data transmission rate are calculated for each user. The curves (Figures 4-6) show the change of wireless link capacity between each user and network with the change of bandwidth allocation. From the figures, it can be seen that the capacity of each user link is increasing logarithmically with respect to the bandwidth. At the maximum capacity of the HWN, the method given in Section 4.2 solves the optimal bandwidth allocation value of WLAN, LTE, and WiMAX networks for each user (i.e., the area marked with " * " in each figure). As can be seen ( Table 2 and Figures 4-6), for the same network access point, the closer the user is to the access point, the better the channel quality is and the more bandwidth that can be allocated.

Wireless Communications and Mobile Computing
This is due to the utility generated for the same bandwidth resource in the same network by allocating the bandwidth resource to users with good channel quality being greater than that generated by allocating it to users with poor channel quality. This also conforms to the characteristics of monotonically increasing logarithmically and decreasing the marginal benefit. Therefore, the bandwidth allocation policy proposed in this paper can make the best use of the bandwidth resources of each network. According to Figures 4-6 and Formula (1), the bandwidth allocation values b i,j (MHz) and the maximum transmission rates r i,j (Mbps) that can be achieved by each user in different networks are shown (Table 3).
According to the maximum transmission rates that users can achieve in each network and the minimum rate requirements of users, the network access, the utilization rate of network resources, and the maximum total capacity that the system can achieve for each user can be obtained. As shown (Table 4), "√" indicates that the user is connected to the network and "×" indicates that the user is not connected to the network. When the user's minimum rate requirement is r req min i,j = 5 Mbps, User 1 chooses to connect to WiMAX; User 2 connects to WLAN and LTE; User 3 connects to WLAN, LTE, and WiMAX; User 4 connects to WLAN and WiMAX; and User 5 connects to LTE.

Performance Comparison of Algorithms.
This section will verify the capacity changes of various wireless access networks (i.e., WLAN, LTE, and WiMAX) and their HWNs when the number of users changes and compare the ORAAS algorithm proposed in this paper with the RSS algorithm. In the ORAAS algorithm, according to the bandwidth resources allocated to users by the network, users choose to access the network that can meet their rate requirements. For the RSS algorithm, users measure the RSS of all networks and choose to access the network with the highest RSS, and all users in the same network share the bandwidth resources of the network on average. In the simulation, the users are randomly generated in the area of HWNs composed of three networks. Five users are generated each time with up to 50 users, and the users randomly fall into a circular area with a radius of 100 m centered on the coordinates (100, 100) ( Figure 7). In addition, to speed up the calculation, the Δs is set to 0.05 in the simulation. The capacities of ORAAS and RSS algorithms are shown with different numbers of users ( Table 6). As can be seen, with the increasing number of users, both the ORAAS algorithm and the RSS algorithm can increase the capacity of each network. As the ORAAS algorithm   respectively. It can be seen that the ORAAS algorithm proposed in this paper has a better performance. In addition, the data given (Table 6) is used to obtain a fitting graph (Figure 8).
The change of system capacity is shown with the increase of the number of users ( Figure 8). As can be seen, when the number of users is small, the capacity of each network and HWN system increases rapidly, and when the users reach a certain number, the capacity growth of each network and HWN system gradually tends to be stable, showing logarithmic growth. Comparing the ORAAS algorithm with the RSS algorithm, it can be seen that the ORAAS algorithm performs better than the RSS algorithm in the same environment, regardless of each wireless network or HWNs composed of each wireless network. This is because the ORAAS algorithm considers different situations of users to allocate bandwidth resources. Furthermore, each user can make full use of bandwidth resources in the multiaccess form, increasing the total system capacity due to a more reasonable use of resources.
The ratio of users connected in parallel to the total number of users under different user rate requirements r req min i,j of the ORAAS algorithm is shown ( Figure 9). As can be seen, when the user rate requirement is 1 Mbps, 2 Mbps, 3 Mbps, 5 Mbps, and 8 Mbps, respectively, the proportion of users connected in parallel decreases gradually with the increase of the number of users. As the total amount of bandwidth resources in each network is limited, having more users means that each user receives less resources. When some networks cannot meet the user rate requirements, the users will not be connected to the network. In addition, when the user

10
Wireless Communications and Mobile Computing rate requirement is low (e.g., when r req min i,j = 1 Mbps), the proportion of users connected in parallel decreases slowly ( Figure 9). As the rate requirement of each user is not high here and the total bandwidth resources of the network can meet the demand of more users at the same time, more users can be connected to the same network at the same time. When the user rate requirement is high (for example, when r req min i,j = 8 Mbps), it is difficult for the limited total resources of the network to meet the requirements of multiple users at the same time, causing the proportion of users connected in parallel to decrease obviously. When the number of users increases to 20, the number of users connected in parallel has decreased to 0.

Conclusions and Outlook
To optimize the transmission performance of HWNs in the access process, this paper proposes an access selection algorithm for HWNs based on optimal resource allocation, which models the target as the problem of maximizing the system transmission rate. The dynamic programming theory is adopted to determine the maximum value of the system transmission rate and the optimal solution of the user bandwidth resource allocation. Finally, according to the bandwidth resources allocated to users and QoS rate requirements, users are connected to appropriate networks.
This algorithm improves the transmission performance of the HWN system, but the limitation of this algorithm is that it only considers the allocation of bandwidth resources. In the future research work, the simultaneous allocation of various network resources (e.g., bandwidth, power, and time slot) in access selection should be studied further to obtain better system performance improvement and QoS optimization. For the subprocess from User i to User m, however, the value of its objective function depends on the initial state s i = T i−1 ðs i−1 , b i−1 Þ of the process and the subpolicy p i,m . This initial state s i is determined by the previous subprocess under the subpolicy p 1,i−1 .
Finding the optimal solution on the policy set p 1,m is equivalent to finding the optimal solution on the subpolicy set p i,m ðs i Þ and then finding the optimal solution of these sub-optimal solutions on the subpolicy set p 1,i−1 ðs 1 Þ. Therefore, Formula (A.1) can be converted to ðA:2Þ Since there is no correlation between the first item in curly brackets and the subpolicy p i,m , the following is obtained: ðA:4Þ Therefore, as long as p * 1,m establishes the theorem formula, then for any policy p 1,m , the following is obtained: Thus, p * 1,m is the optimal policy. The proof is completed.

B. Proof of the Inference
The following method of disproof is used to prove the inference.
If p * i,m is not the optimal policy, then

Data Availability
MATLAB code and experimental data can be downloaded from the following link. Link: https://pan.baidu.com/s/1I_ yNS6X_ce8VvAzl1Pj98g; Password: 01q2.

Conflicts of Interest
The authors declare that they have no conflicts of interest.