Solving the Wireless Mesh Network Design Problem using Genetic Algorithm and Simulated Annealing Optimization Methods
18 Jun 2014-International Journal of Computer Applications (Foundation of Computer Science (FCS))-Vol. 96, Iss: 11, pp 1-10
TL;DR: The genetic algorithm and simulated annealing enable searching for a low-cost WMN configuration with constraints and determine the number of used gateways to minimize WMN network costs while satisfying quality of service.
Abstract: Mesh clients, mesh routers and gateways are components of Wireless Mesh Network (WMN). In WMN, gateways connect to Internet using wireline links and supply Internet access services for users. Multiple gateways are needed, which take time and cost budget to set up, due to the limited wireless channel bit rate. WMN is a highly developed technology that offers to end users a wireless broadband access. It offers a high degree of flexibility contrasted to conventional networks; however, this attribute comes at the expense of a more complex construction. Therefore, a challenge is the planning and optimization of WMNs. This paper concentrates on the challenge using a genetic algorithm and simulated annealing. The genetic algorithm and simulated annealing enable searching for a low-cost WMN configuration with constraints and determine the number of used gateways. Experimental results proved that the performance of the genetic algorithm and simulated annealing in minimizing WMN network costs while satisfying quality of service. The proposed models are presented to significantly outperform the existing solutions.
Citations
More filters
23 Mar 2016
TL;DR: A new replacement method for mesh routers called Rational Decrement of Vmax Method (RDVM), which uses Size of Giant Component (SGC) and Number of Covered Mesh Clients (NCMC) as metrics for optimization and finds that RDVM converges faster to best solution than LDVM.
Abstract: With the fast development of wireless technologies, Wireless Mesh Networks (WMNs) are becoming an important networking infrastructure due to their low cost and increased high speed wireless Internet connectivity. In our previous work, we implemented the Linearly Decreasing Vmax Method (LDVM) for our WMN-PSO simulation system. In this paper, we implement a new replacement method for mesh routers called Rational Decrement of Vmax Method (RDVM). We use Size of Giant Component (SGC) and Number of Covered Mesh Clients (NCMC) as metrics for optimization. From the simulation results, we found that RDVM converges faster to best solution than LDVM.
68 citations
TL;DR: A simulation system based on particle swarm optimisation PSO is implemented in order to solve the problem of mesh router placement in WMNs, showing that the CM converges very fast, but has the worst performance among the methods.
Abstract: With the fast development of wireless technologies, wireless mesh networks WMNs are becoming an important networking infrastructure due to their low cost and increased high speed wireless internet connectivity. This paper implements a simulation system based on particle swarm optimisation PSO in order to solve the problem of mesh router placement in WMNs. Four replacement methods of mesh routers are considered: constriction method CM, random inertia weight method RIWM, linearly decreasing Vmax method LDVM and linearly decreasing inertia weight method LDIWM. Simulation results are provided, showing that the CM converges very fast, but has the worst performance among the methods. The considered performance metrics are the size of giant component SGC and the number of covered mesh clients NCMC. The RIWM converges fast and the performance is good. The LDIWM is a combination of RIWM and LDVM. The LDVM converges after 170 number of phases but has a good performance.
64 citations
15 Mar 2018
TL;DR: A hybrid simulation system based on PSO and distributed GA (DGA), called WMN-PSODGA, for solving node placement problem in WMNs is implemented and results show that the WMn-PS ODGA has good performance when the number of GA islands is 64.
Abstract: Wireless Mesh Networks (WMNs) have many advantages such as low cost and increased high speed wireless Internet connectivity, therefore WMNs are becoming an important networking infrastructure. In our previous work, we implemented a Particle Swarm Optimization (PSO) based simulation system, called WMN-PSO, and a simulation system based on Genetic Algorithm (GA), called WMN-GA, for solving node placement problem in WMNs. In this paper, we implement a hybrid simulation system based on PSO and distributed GA (DGA), called WMN-PSODGA. We evaluate WMN-PSODGA by computer simulations. The simulation results show that the WMN-PSODGA has good performance when the number of GA islands is 64.
54 citations
01 May 2019
TL;DR: A hybrid simulation system based on PSO and SA for node placement in wireless mesh networks, called WMN-PSOSA is implemented and results show that the rational decrement of Vmax method and linearly decreasing inertia weight method have better performance compared with constriction method and random inertia weight methods.
Abstract: Wireless mesh networks (WMNs) have many advantages such as low-cost and increased high- speed wireless Internet connectivity; therefore, WMNs are becoming an important networking infrastructure. In our previous work, we implemented a particle swarm optimization (PSO)-based simulation system for node placement in WMNs, called WMN-PSO. Also, we implemented a simulation system based on simulated annealing (SA) called WMN-SA. In this paper, we implement a hybrid simulation system based on PSO and SA, called WMN-PSOSA. We evaluate the performance of WMN-PSOSA by conducting computer simulations considering four different replacement methods. The simulation results show that the rational decrement of Vmax method and linearly decreasing inertia weight method have better performance compared with constriction method and random inertia weight method.
52 citations
04 Jul 2018
TL;DR: A hybrid simulation system based on PSO and distributed GA (DGA), called WMN-PSODGA, is implemented for solving node placement problem in WMNs and results show that the WMn-PS ODGA has good performance when the client distribution is Normal compared with the case of Exponential distribution.
Abstract: The Wireless Mesh Networks (WMNs) are becoming an important networking infrastructure because they have many advantages such as low cost and increased high speed wireless Internet connectivity. In our previous work, we implemented a Particle Swarm Optimization (PSO) based simulation system, called WMN-PSO, and a simulation system based on Genetic Algorithm (GA), called WMN-GA, for solving node placement problem in WMNs. In this paper, we implement a hybrid simulation system based on PSO and distributed GA (DGA), called WMN-PSODGA. We analyze the performance of WMN-PSODGA by computer simulations considering different client distributions. Simulation results show that the WMN-PSODGA has good performance when the client distribution is Normal compared with the case of Exponential distribution.
47 citations
References
More filters
Book•
01 Jan 1975
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Abstract: Name of founding work in the area. Adaptation is key to survival and evolution. Evolution implicitly optimizes organisims. AI wants to mimic biological optimization { Survival of the ttest { Exploration and exploitation { Niche nding { Robust across changing environments (Mammals v. Dinos) { Self-regulation,-repair and-reproduction 2 Artiicial Inteligence Some deenitions { "Making computers do what they do in the movies" { "Making computers do what humans (currently) do best" { "Giving computers common sense; letting them make simple deci-sions" (do as I want, not what I say) { "Anything too new to be pidgeonholed" Adaptation and modiication is root of intelligence Some (Non-GA) branches of AI: { Expert Systems (Rule based deduction)
32,573 citations
"Solving the Wireless Mesh Network D..." refers background in this paper
...This paper proposes and evaluates genetic algorithms (GAs) [4,5] and simulated annealing (SA) [6] for near-optimally solving one of these problems—minimizing costs—as it interacts to WMN design....
[...]
28 Aug 2005
TL;DR: This paper provides necessary conditions to verify the feasibility of rate vectors in next generation fixed wireless broadband networks, and uses them to derive upper bounds on the capacity in terms of achievable throughput, using a fast primal-dual algorithm.
Abstract: Next generation fixed wireless broadband networks are being increasingly deployed as mesh networks in order to provide and extend access to the internet. These networks are characterized by the use of multiple orthogonal channels and nodes with the ability to simultaneously communicate with many neighbors using multiple radios (interfaces) over orthogonal channels. Networks based on the IEEE 802.11a/b/g and 802.16 standards are examples of these systems. However, due to the limited number of available orthogonal channels, interference is still a factor in such networks. In this paper, we propose a network model that captures the key practical aspects of such systems and characterize the constraints binding their behavior. We provide necessary conditions to verify the feasibility of rate vectors in these networks, and use them to derive upper bounds on the capacity in terms of achievable throughput, using a fast primal-dual algorithm. We then develop two link channel assignment schemes, one static and the other dynamic, in order to derive lower bounds on the achievable throughput. We demonstrate through simulations that the dynamic link channel assignment scheme performs close to optimal on the average, while the static link channel assignment algorithm also performs very well. The methods proposed in this paper can be a valuable tool for network designers in planning network deployment and for optimizing different performance objectives.
825 citations
"Solving the Wireless Mesh Network D..." refers background or methods in this paper
...The authors in [9, 10] and [12, 20] suggest channel assignment algorithms while assuming a fixed topology to satisfy end user demands and maximize throughput....
[...]
...Because channel allocation in WMNs is an NPhard problem [10], most design methods suggest mathematical forms that are solved using heuristics and linear programming [9, 10, 19, 20, 21]....
[...]
TL;DR: This article provides exact upper bounds on the throughput of any node in a WMN for a given topology and the set of active nodes, and shows that for WMNs the throughput decreases as O(1/n), where n is the total number of nodes in the network.
Abstract: Wireless mesh networks are an alternative technology for last-mile broadband Internet access. In WMNs, similar to ad hoc networks, each user node operates not only as a host but also as a router; user packets are forwarded to and from an Internet-connected gateway in multihop fashion. The meshed topology provides good reliability, market coverage, and scalability, as well as low upfront investments. Despite the recent startup surge in WMNs, much research remains to be done before WMNs realize their full potential. This article tackles the problem of determining the exact capacity of a WMN. The key concept we introduce to enable this calculation is the bottleneck collision domain, defined as the geographical area of the network that bounds from above the amount of data that can be transmitted in the network. We show that for WMNs the throughput of each node decreases as O(1/n), where n is the total number of nodes in the network. In contrast with most existing work on ad hoc network capacity, we do not limit our study to the asymptotic case. In particular, for a given topology and the set of active nodes, we provide exact upper bounds on the throughput of any node. The calculation can be used to provision the network, to ensure quality of service and fairness. The theoretical results are validated by detailed simulations.
614 citations
TL;DR: A generalized simulated annealing method has been developed and applied to the optimization of functions (possibly constrained) having many local extrema and it is used to solve a problem analyzed by Bates for which an improved optimum is identified.
Abstract: A generalized simulated annealing method has been developed and applied to the optimization of functions (possibly constrained) having many local extrema. The method is illustrated in some difftcult pedagogical examples and used to solve a problem analyzed by Bates (Technometrics, 25, pp. 373–376, 1983) for which we identify an improved optimum. The sensitivity of the solution to changes in the constraints and in other specifications of the problem is analyzed and discussed.
554 citations
"Solving the Wireless Mesh Network D..." refers methods in this paper
...The main advantage of SA method is that it does not need large computer memory [6, 7]....
[...]
TL;DR: This paper proposes a polynomial time near-optimal algorithm which recursively computes minimum weighted Dominating Sets (DS) while consistently preserving QoS requirements across iterations, and shows that it outperforms other alternative schemes.
Abstract: In a wireless mesh network (WMN), the traffic is aggregated and forwarded towards the gateways. Strategically placing and connecting the gateways to the wired backbone is critical to the management and efficient operation of a WMN. In this paper, we address the problem of gateways placement, consisting in placing a minimum number of gateways such that quality-of-service (QoS) requirements are satisfied. We propose a polynomial time near-optimal algorithm which recursively computes minimum weighted Dominating Sets (DS), while consistently preserving QoS requirements across iterations. We evaluate the performance of our algorithm using both analysis and simulation, and show that it outperforms other alternative schemes by comparing the number of gateways placed in different scenarios
270 citations