Optimal number and class selection of nodes in Wireless Mesh Networks

In this work, the optimal network plan in terms of node class selection and number of nodes required to achieve a given network reliability in a wireless mesh network (WMN) was investigated. The network is said to be optimal if it minimizes the network implementation cost while achieving the application matrix requirements. In this work, these requirements are described in terms of communication range, minimum network reliability, and achievable throughput. A node class is generally characterized by its capabilities (such as transmitted power and sensitivity) and associated cost. In order to tackle this problem, we developed an analytical model and methodology for WMN optimization. The proposed model differs from previously used models in that it takes into account linkspsila dependencies of geometrically co-located nodes, the effect of boundary nodespsila connectivity, in addition to fading and shadowing effects. This methodology was used to find the structure of the optimal policy for two important topologies: the one-dimensional linear network topology, and the two-dimensional triangular lattice topology. The proposed methodology resulted in a qualitative and quantitative description of the optimal WMN planning policy.