Optimizing the Wire Layout in Wireless Mesh Network

In this paper, we aim at the placement of TAPs in Wireless Community Mesh network to minimize the layout cost while guarantee user´s demand. We model this problem as Quasi-Group Steiner Tree Problem and give 3 approximation algorithms, which based on Steiner Tree, General Minimum Spanning Tree and overlay specific of this problem respectively. Our simulations show that the algorithm based on overlay specific has the best average performance, i.e. with the shortest length of wire layout in all scenarios that we do in this paper.