On novel efficient wireless access network design heuristic algorithms for QoS multiservice networks

This paper presents two novel heuristic algorithms for the design of wireless access networks (QoS-HWNDA-1, QoSHWNDA-2) adapted in the case of QoS networks, which is the prevalent situation in the evolution of 5G technology. Emphasis was given to the design of CDMA based wireless networks and Fixed Wireless networks considering QoS architectures. The objectives of these methods are first to place a number of access points/base stations in a number of candidate sites and then to assign a number of fixed wireless terminals to the selected access points/base stations, while ensuring QoS requirements. Both methods are based on Graph Theory and they are essentially greedy algorithms. Except from capacity constraints, wireless reception characteristics are also considered. The algorithms are capable of designing medium and large-scale networks at polynomial time. Both algorithms were compared with a rival optimization problem through a series of tests. The results indicate that as regards design costs the performance of the proposed heuristic algorithms is very close to this of the equivalent optimization problem. The solution times for the proposed heuristic algorithms are smaller especially when the number of the candidate access points/base stations becomes large.