Methodology of the Wireless Networks Planning in Mesh Topology

Abstract

The aim of the paper is to present an algorithm for the planning of wireless networks in mesh topology. According to the authors' assumptions, the algorithm should optimally span the mesh network of minimal incidence between its nodes. A second aim of the paper is to calculate an optimal flow for the designed network as regards its offered services. The authors' intention is to prove that the wireless mesh networks belong to the group of "survivable networks" by means of introducing appropriate mechanisms associated with an optimal dynamic routing that is dependent on the bandwidth available for these services.