An Annealing Approach to Router Nodes Placement Problem in Wireless Mesh Networks

摘要

Mesh router nodes placement is a central problem to Wireless Mesh Networks (WMNs). An efficient placement of mesh router nodes is indispensable for achieving network Performance in terms of both network Connectivity and user coverage. Unfortunately the problem is computationally hard to solve to optimality even for small deployment areas and a small number of mesh router nodes. As WMNs are be-coming an important networking infrastrueture for providing cost-efficient broadband wireless Connectivity, researchers are paying attention to the resolution of the mesh router placement problem through heuristic approaches in order to achieve near optimal, yet high quality Solutions in reasonable time. In this work we propose and evaluate a Simulated Annealing (SA) approach to placement of mesh router nodes in WMNs. The optimization mode; uses two maximization objectives, namely, the size of the giant component in the network and user coverage. Both objectives are important to deployment of WMNs; the former is crucial to achieve network Connectivity while the later is an indicator of the QoS in WMNs. The SA approach distinguishes for its simplicity yet its policy of neighborhood exploration allows to reach promising areas of the Solution space where quality Solutions could be found. We have experimentally evaluated the SA algorithm through a benchmark of generated instances, varying from small to large size, and capturing different characteristics of WMNs such as topological placements of mesh clients. The experimental results showed the efficiency of the annealing approach for the placement of mesh router nodes in WMNs.