1 Introduction

The wireless networks and devices are becoming increasingly popular and they provide users access to information and communication anytime and anywhere [1, 3,4,5, 9,10,11,12, 14, 15, 17, 19, 20, 25, 29]. Wireless Mesh Networks (WMNs) are gaining a lot of attention because of their low cost nature that makes them attractive for providing wireless Internet connectivity. A WMN is dynamically self-organized and self-configured, with the nodes in the network automatically establishing and maintaining mesh connectivity among them-selves (creating, in effect, an ad hoc network). This feature brings many advantages to WMNs such as low up-front cost, easy network maintenance, robustness and reliable service coverage [2]. Moreover, such infrastructure can be used to deploy community networks, metropolitan area networks, municipal and corporative networks, and to support applications for urban areas, medical, transport and surveillance systems.

In this work, we deal with node placement problem in WMNs. We consider the version of the mesh router nodes placement problem in which we are given a grid area where to deploy a number of mesh router nodes and a number of mesh client nodes of fixed positions (of an arbitrary distribution) in the grid area. The objective is to find a location assignment for the mesh routers to the cells of the grid area that maximizes the network connectivity and client coverage. Network connectivity is measured by Size of Giant Component (SGC) of the resulting WMN graph, while the user coverage is simply the number of mesh client nodes that fall within the radio coverage of at least one mesh router node and is measured by Number of Covered Mesh Clients (NCMC). Node placement problems are known to be computationally hard to solve [13, 33]. In some previous works, intelligent algorithms have been recently investigated [8, 16, 18, 27, 28, 35]. We already implemented a Particle Swarm Optimization (PSO) based simulation system, called WMN-PSO [23]. Also, we implemented a simulation system based on Hill Climbing (HC) for solving node placement problem in WMNs, called WMN-HC [22].

In our previous work [23, 26], we presented a hybrid intelligent simulation system based on PSO and HC. We called this system WMN-PSOHC. In this paper, we analyze the performance of Constriction Method (CM) and Rational Decrement of Vmax Method (RDVM) by WMN-PSOHC simulation system considering Normal distribution of mesh clients.

The rest of the paper is organized as follows. We present our designed and implemented hybrid simulation system in Sect. 2. In Sect. 3, we introduce WMN-PSOHC Web GUI tool. The simulation results are given in Sect. 4. Finally, we give conclusions and future work in Sect. 5.

2 Proposed and Implemented Simulation System

2.1 Particle Swarm Optimization

In Particle Swarm Optimization (PSO) algorithm, a number of simple entities (the particles) are placed in the search space of some problem or function and each evaluates the objective function at its current location. The objective function is often minimized and the exploration of the search space is not through evolution [21]. However, following a widespread practice of borrowing from the evolutionary computation field, in this work, we consider the bi-objective function and fitness function interchangeably. Each particle then determines its movement through the search space by combining some aspect of the history of its own current and best (best-fitness) locations with those of one or more members of the swarm, with some random perturbations. The next iteration takes place after all particles have been moved. Eventually the swarm as a whole, like a flock of birds collectively foraging for food, is likely to move close to an optimum of the fitness function.

Each individual in the particle swarm is composed of three \(\mathcal D\)-dimensional vectors, where \(\mathcal D\) is the dimensionality of the search space. These are the current position \(\mathbf {x}_i\), the previous best position \(\mathbf {p}_i\) and the velocity \(\mathbf {v}_i\).

The particle swarm is more than just a collection of particles. A particle by itself has almost no power to solve any problem; progress occurs only when the particles interact. Problem solving is a population-wide phenomenon, emerging from the individual behaviors of the particles through their interactions. In any case, populations are organized according to some sort of communication structure or topology, often thought of as a social network. The topology typically consists of bidirectional edges connecting pairs of particles, so that if j is in i’s neighborhood, i is also in j’s. Each particle communicates with some other particles and is affected by the best point found by any member of its topological neighborhood. This is just the vector \(\mathbf {p}_i\) for that best neighbor, which we will denote with \(\mathbf {p}_g\). The potential kinds of population “social networks” are hugely varied, but in practice certain types have been used more frequently.

In the PSO process, the velocity of each particle is iteratively adjusted so that the particle stochastically oscillates around \(\mathbf {p}_i\) and \(\mathbf {p}_g\) locations.

2.2 Hill Climbing

Hill Climbing (HC) algorithm is a heuristic algorithm. The idea of HC is simple. In HC, the solution \(s'\) is accepted as the new current solution if \(\delta {}\le {}0\) holds, where \(\delta {}=f(s')-f(s)\). Here, the function f is called the fitness function. The fitness function gives points to a solution so that the system can evaluate the next solution \(s'\) and the current solution s.

The most important factor in HC is to define the neighbor solution, effectively. The definition of the neighbor solution affects HC performance directly. In our WMN-PSOHC system, we use the next step of particle-pattern positions as the neighbor solutions for the HC part.

2.3 WMN-PSOHC System Description

In following, we present the initialization, particle-pattern, fitness function and router replacement methods.

Initialization

Our proposed system starts by generating an initial solution randomly, by ad hoc methods [34]. We decide the velocity of particles by a random process considering the area size. For instance, when the area size is \(W\times {}H\), the velocity is decided randomly from \(-\sqrt{W^{2}+H^{2}}\) to \(\sqrt{W^{2}+H^{2}}\).

Particle-Pattern

A particle is a mesh router. A fitness value of a particle-pattern is computed by combination of mesh routers and mesh clients positions. In other words, each particle-pattern is a solution as shown is Fig. 1. Therefore, the number of particle-patterns is a number of solutions.

Fitness Function

One of most important thing is to decide the determination of an appropriate objective function and its encoding. In our case, each particle-pattern has an own fitness value and compares other particle-patterns fitness value in order to share information of global solution. The fitness function follows a hierarchical approach in which the main objective is to maximize the SGC in WMN. Thus, we use \(\alpha \) and \(\beta \) weight-coefficients for the fitness function and the fitness function of this scenario is defined as:

$$\begin{aligned} \text{ Fitness }=\alpha {}\times \text{ SGC }(\textit{\textbf{x}}_{ij},\textit{\textbf{y}}_{ij}) + \beta {} \times \text{ NCMC }(\textit{\textbf{x}}_{ij},\textit{\textbf{y}}_{ij}). \end{aligned}$$

Router Replacement Methods

A mesh router has x, y positions and velocity. Mesh routers are moved based on velocities. There are many router replacement methods in PSO field [7, 30,31,32]. In this paper, we consider CM and RDVM.

  • Constriction Method (CM) CM is a method which PSO parameters are set to a week stable region (\(\omega = 0.729\), \(C_1 = C2 = 1.4955\)) based on analysis of PSO by M. Clerc et al. [5,6,7].

  • Rational Decrement of Vmax Method (RDVM) In RDVM, PSO parameters are set to unstable region (\(\omega =0.9\), \(C_1=C_2=2.0\)). The \(V_{max}\) is kept decreasing with the increasing of iterations as

    $$\begin{aligned} V_{max}(x) = \sqrt{ W^{2}+H^{2} }\times \frac{T-x}{x}. \end{aligned}$$

    where, W and H are the width and the height of the considered area, respectively. Also, T and x are the total number of iterations and a current number of iteration, respectively [24].

Fig. 1.
figure 1

Relationship among global solution, particle-patterns and mesh routers.

Full size image

3 WMN-PSOHC Web GUI Tool

The Web application follows a standard Client-Server architecture and is implemented using LAMP (Linux + Apache + MySQL + PHP) technology (see Fig. 2). We show the WMN-PSOHC Web GUI tool in Fig. 3. Remote users (clients) submit their requests by completing first the parameter setting. The parameter values to be provided by the user are classified into three groups, as follows.

  • Parameters related to the problem instance: These include parameter values that determine a problem instance to be solved and consist of number of router nodes, number of mesh client nodes, client mesh distribution, radio coverage interval and size of the deployment area.

  • Parameters of the resolution method: Each method has its own parameters.

  • Execution parameters: These parameters are used for stopping condition of the resolution methods and include number of iterations and number of independent runs. The former is provided as a total number of iterations and depending on the method is also divided per phase (e.g., number of iterations in a exploration). The later is used to run the same configuration for the same problem instance and parameter configuration a certain number of times.

4 Simulation Results

In this section, we show simulation results using WMN-PSOHC system. In this work, we consider Normal distribution of mesh clients. The number of mesh routers is considered 16 and the number of mesh clients 48. We consider the number of particle-patterns 9. We conducted simulations 100 times, in order to avoid the effect of randomness and create a general view of results. The total number of iterations is considered 800 and the iterations per phase is considered 4. We show the parameter setting for WMN-PSOHC in Table 1.

We show the simulation results in Fig. 4 and Fig. 5. For SGC, both replacement methods reach the maximum (100%). This means that all mesh routers are connected to each other. We see that CM converges faster than RDVM for SGC. Also, for the NCMC, CM performs better than RDVM. Therefore, we conclude that the performance of CM is better compared with RDVM.

Fig. 2.
figure 2

System structure for web interface.

Full size image
Fig. 3.
figure 3

WMN-PSOHC Web GUI Tool.

Full size image
Table 1. Parameter settings.
Full size table
Fig. 4.
figure 4

Simulation results of WMN-PSOHC for SGC.

Full size image
Fig. 5.
figure 5

Simulation results of WMN-PSOHC for NCMC.

Full size image

5 Conclusions

In this work, we evaluated the performance of CM and RDVM router replacement methods for WMNs by WMN-PSOHC hybrid intelligent simulation system. Simulation results show that the performance of CM is better compared with RDVM.

In our future work, we would like to evaluate the performance of the proposed system for different parameters and scenarios.