Local search methods for efficient router nodes placement in wireless mesh networks
- 158 Downloads
Wireless Mesh Networks (WMNs) are an important networking infrastructure for providing cost-efficient broadband wireless connectivity to a group of users. WMNs are increasingly being used in urban, metropolitan and municipal area networks for deployment of medical, transport, surveillance systems, etc. The performance and operability of WMNs largely depends on placement of mesh routers nodes in the geographical area to achieve network connectivity and stability. The objective is to find an optimal and robust topology of the mesh router network to support intelligent telecommunication services to clients such as adaptive and flexible wireless Internet access, mobile data, voice, video in addition to supporting other preferred client services. In this work, we propose and evaluate local search methods for intelligent placement of mesh routers in WMNs with a two fold objective: maximizing the size of the giant component in the network and user coverage. Given a grid area where to distribute a given number of mesh router nodes, which can have different radio coverage, and a number of fixed clients a priori distributed in the given area, local search methods explore different local movements and incrementally improve the quality of the router nodes placement in terms of network connectivity and user coverage. We have experimentally evaluated the proposed local search methods through a benchmark of generated instances of varying sizes. Moreover, different distributions of mesh clients (Uniform, Normal, Exponential and Weibull) are used. The experimental evaluation showed the good performance of local search methods for optimizing network connectivity and user coverage in WMNs.
KeywordsWireless mesh networks Local search Node placement Optimization Size of giant component User coverage
Unable to display preview. Download preview PDF.
- Antony Franklin, A., & Siva Ram Murthy, C. (2007). Node placement algorithm for deployment of two-tier wireless mesh networks. In Proceedings of IEEE GLOBECOM 2007, IEEE Global Communications Conference (pp. 4823–4827).Google Scholar
- Chen, C., & Chekuri, C. (2007). Urban wireless mesh network planning: The case of directional antennas. In Tech Report No. UIUCDCS-R-2007-2874, Department of Computer Science, University of Illinois at Urbana-Champaign.Google Scholar
- Garey M. R., Johnson D. S. (1979) Computers and intractability—a guide to the theory of NP-completeness. Freeman, San FranciscoGoogle Scholar
- Meng, X. G., Wong, S. H. Y., Yuan, Y., & Lu, S. (2004). Characterizing flows in large wireless data networks. In MobiCom’04: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking (pp. 174–186). New York, USA.Google Scholar
- Muthaiah, S. N., & Rosenberg, C. (2008). Single gateway placement in wireless mesh networks. In Proceedings of 8th International IEEE Symposium on Computer Networks, Turkey.Google Scholar
- Tang M. (2009) Gateways placement in backbone wireless mesh networks. International Journal of Communications, Network and System Sciences 1: 1–89Google Scholar
- Vanhatupa, T., Hännikäinen, M., & Hämäläinen, T. D. (2007). Genetic algorithm to optimize node placement and configuration for WLAN planning. In Proceedings of 4th International Symposium on Wireless Communication Systems (pp. 612–616).Google Scholar
- Wang, J., Xie, B., Cai, K., & Agrawal, D. P. (2007). Efficient mesh router placement in wireless mesh networks. In MASS 2007 (pp. 9–11). Pisa, Italy.Google Scholar
- Zhou, P., Manoj, B. S., & Rao, R. (2007). A gateway placement algorithm in wireless mesh networks. In Proceedings of the 3rd international Conference on Wireless Internet, Texas.Google Scholar