Optimizing the placement of ITAPs in wireless mesh networks by implementing HC and SA algorithms

Abstract

In this paper, we present novel heuristic improvement (move) operators for the design of Wireless Mesh Networks (WMN), and demonstrate their efficiency within simple Hill Climbing (HC) and Simulated Annealing (SA) frameworks. The management cost of Internet Transit Access Points (ITAPs) in WMN is significant, so it is crucial to minimize the number of ITAPs required whilst maintaining an acceptable quality of service (QoS). Using a single objective method, we investigate algorithms to make informed placement decisions based on the grid size, wireless range connectivity, wireless link capacity and user demands. The experimental results showed the efficiency of the proposed combination of move operators.