# Fixed Wireless Access in Flexible Environment: Problem Definition and Feasibility Check
## 7 Conclusions  
The algorithm guarantees finding a single radio link solution for FWA. The algorithm can also be extended to handle solutions with multiple radio links. This extension is straightforward when different services use separate radio links. Future network design considerations include:  
* consider dual polarization, dual RF channel or dual frequency band links to further increase the possible throughput of the wireless radio hop,
* include free space optics (FSO) links or hybrid radio/FSO links [24; 25],
* allow potential targets _pCTs_ can be either exclusive or inclusive \"OR\" (e.g., the client (PL) may connect its factory traffic to multiple data centers, e.g., the low latency robotics traffic to one industrial ultra-reliable low-latency communication server and the office workers' traffic to a less reliable communication server at another _pCT_ location. Other options are also possible),
* consider the impact of adding multiple PLs simultaneously,  
Figure 8: (**a**) Transmit power with automatic transmit power control in [dBm]; (**b**) received signal level in [dBm]; (**c**) measured throughput of an experimental 6 Gbps _E_-band link; (**d**) Rain intensity measured at ‘Budapest-Lágymányos’ meteorological station.  
* extend the algorithm to find cost optimal solution,
* support CSP in executing trade-off analysis of cost versus technical requirements (availability, throughput, latency). This is done by allowing the definition of input parameter ranges instead of single values and performing the feasibility check for all input parameter combinations. The topic involves several interacting factors: (i) diverse service traffic, (ii) variable network load, (iii) differing fiber-optical and wireless link characteristics, and (iv) cost-performance trade-offs. The proposed algorithm provides support and an important first step in solving this complex problem.  
For large networks the calculations may become computationally intensive. Since these calculations are performed offline during the design phase, the necessary computing resources are available both time- and CPU power-wise. It is also possible to run draft calculations by reducing the granularity (i.e., calculations with longer timeslots). The above improvements are the subject of further research to extend the feasibility check algorithm into a powerful planning tool.  
Conceptualization, A.H. and G.J.; methodology, J.V. and A.H.; validation, A.H., G.J. and A.F.; formal analysis, J.V.; investigation, A.H. and G.J.; resources, G.J.; data curation, A.H.; writing--original draft preparation, J.V. and A.H.; writing--review and editing, all authors; visualization, J.V. and A.H.; supervision, G.J.; project administration, A.H. All authors have read and agreed to the published version of the manuscript.  
This research received no external funding.  
The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.  
The authors acknowledge the fruitful discussions and very useful comments of [PERSON] and [PERSON] (Nokia Trafficom), [PERSON] (Nokia Bell Labs), [PERSON] and [PERSON] (Nokia), [PERSON] (Budapest University of Technology and Economics), and [PERSON] (OMSZ, the Hungarian Meteorological Service).  
Authors [PERSON], [PERSON] and [PERSON] are employed by the company Nokia. The remaining author declares that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.