Urban Wireless Mesh Network Planning: The Case of Directional Antennas

As more and more cities plan to deploy municipal wireless mesh networks to provide publicly-accessible infrastructure, it becomes critical to come up with a deployment plan that provides sufficient accessibility with financial and technological constraints. In this paper, we consider deploying the mesh routers that are equipped with directional antennas to form the mesh backbone. We propose GPSR, an efficient and near-optimal algorithm that maximizes the profit of the deployment, ensures the deployment cost is under budget, and guarantees connectivity and system robustness. Furthermore, GPSR is general enough to address many practically-encountered variants of the mesh network planning problem. Our performance evaluation shows that GPSR almost always generates the deployment plan within 95% of the optimal for all of our experiments.

[1]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.

[2]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[3]  Rudi van Drunen,et al.  Building a Wireless Community Network in the Netherlands , 2003, USENIX Annual Technical Conference, FREENIX Track.

[4]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[5]  Antonio Pescapè,et al.  Experimental evaluation and characterization of the magnets wireless backbone , 2006, WINTECH.

[6]  Kameswari Chebrolu,et al.  Design and evaluation of a new MAC protocol for long-distance 802.11 mesh networks , 2005, MobiCom '05.

[7]  David P. Williamson,et al.  Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems , 2006, J. Comput. Syst. Sci..

[8]  Robert Tappan Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM '04.

[9]  J. G. Pierce,et al.  Geometric Algorithms and Combinatorial Optimization , 2016 .

[10]  Kamal Jain,et al.  A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[11]  Kameswari Chebrolu,et al.  Revisiting MAC Design for an 802 . 11-based Mesh Network , 2004 .

[12]  Robert Tappan Morris,et al.  Architecture and evaluation of an unplanned 802.11b mesh network , 2005, MobiCom '05.

[13]  R. Ravi,et al.  A nearly best-possible approximation algorithm for node-weighted Steiner trees , 1993, IPCO.

[14]  Bhaskaran Raman,et al.  Turning 802.11 inside-out , 2004, Comput. Commun. Rev..

[15]  Kameswari Chebrolu,et al.  Long-distance 802.11b links: performance measurements and experience , 2006, MobiCom '06.

[16]  Sayandeep Sen,et al.  Long distance wireless mesh network planning: problem formulation and solution , 2007, WWW '07.

[17]  Ranveer Chandra,et al.  Optimizing the placement of Internet TAPs in wireless neighborhood networks , 2004, Proceedings of the 12th IEEE International Conference on Network Protocols, 2004. ICNP 2004..

[18]  Robert Krauthgamer,et al.  Hardness of Approximation for Vertex-Connectivity Network Design Problems , 2002, SIAM J. Comput..

[19]  Edward W. Knightly,et al.  Measurement driven deployment of a two-tier urban mesh access network , 2006, MobiSys '06.