Gateway Placement Research Articles

A Comparatives Study of Gateway Placement Optimization in Wireless Mesh Network using GA, PSO and ACO

In this paper, I study the challenging problem of optimizing gateway placement for throughput in Wireless Mesh Networks. I compare my study ofGenetic Algorithm (GA), Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO) to solve the optimal gateway placement in Wireless Mesh Networks problem. I generate the locations of gateway randomly and independently and choose the router with the highest weight as potential location for gateway placement use multi-traffic-flow weight. In the my algorithms based on GA and PSO, I calculate the fitness value of each scheme and update them step by step with the best method to quickly find the optimal. With ACO algorithm, I calculate the probability and pheromone values of ants will choose to go from current gateway i to next client j. After each iteration, the pheromone values are updated by all the number of ants that have reached to the destination successfully and found the optimal solution.Numerical results show that the proposed algorithm has achieved much better than previous studies.

General optimization framework for surface gateway deployment problem in underwater sensor networks

Abstract The performance of underwater sensor networks (UWSNs) is greatly limited by the low bandwidth and high propagation delay of acoustic communications. Deploying multiple surface-level radio-capable gateways can enhance UWSN performance metrics, reducing end-to-end delays and distributing traffic loads for energy reduction. In this paper, we study the problem of gateway placement for maximizing the cost-benefit of this UWSN architecture. We develop a mixed integer programming (MIP) gateway deployment optimization framework. We analyze the tradeoff between the number of surface gateways and the expected delay and energy consumption of the surface gateway architecture in the optimal case. We used an MIP solver to solve the developed optimization problem and integrated the optimal results to serve as an input for our simulations to evaluate the benefits of surface gateway optimization framework. We investigated the effect of acoustic channel capacity and the underwater sensor node deployment pattern on our solution. Our results show the significant advantages of surface gateway optimization and provide useful guidelines for real network deployment.

Zero-Degree algorithm for Internet GateWay placement in backbone wireless mesh networks

Internet GateWays (IGWs) are responsible for connecting the backbone wireless mesh networks (BWMNs) to the Internet/wired backbone. An IGW has more capabilities than a simple wireless mesh router (WMR) but is more expensive. Strategically placing the IGWs in a BWMN is critical to the Wireless Mesh Network (WMN) architecture. In order to solve the problem of IGWs placement in BWMNs, a novel algorithm is proposed in this paper. The new algorithm is involved in placing a minimum number of IGWs so that the Quality of Service (QoS) requirements are satisfied. Different from existing algorithms, this new algorithm incrementally identifies IGWs and prioritively assigns wireless mesh routers (WMRs) based on the computed degree of WMRs to identified IGWs. Performance evaluation results show that proposed algorithm outperforms other alternative algorithms by comparing the number of gateways placed in different scenarios. Furthermore, having control of the distribution of IGWs in order to locate them closest to available Internet/wired network connection points is an added advantage of this algorithm.

Clustering based Load Balanced Gateway Placement Approach

Wireless mesh networks (WMN) is a promising technology to provide broadband Internet access. Gateway placement is an important part of WMN design that determines how to place the gateways in WMN. Various approaches have been given by various researchers for Gateway placement taking care of various parameters. In this paper, we proposed a clustering based load balanced algorithm to find an approximating optimal solution of gateway placement in WMN. The aim of our research is to focus on load balanced gateway placement problem.

Gateway Placement under the Consideration of the Starvation of TCP Flows in Wireless Mesh Networks

Wireless mesh networks are expected to provide wireless broadband access to Internet. In such networks, gateway placement is an important topic, which usually dominates the overall wireless performance, and hence there have been lots of the related works. However, recent paper even discovers that the starvation of TCP flows usually occurs near wireless gateways. Some TCP flows will starve just due to TCP flows of the node next to the gateway. Hence, possible ways to improve this critical issue should be developed urgently. However, until now, there have not been the feasible ways without modifying MAC and TCP mechanisms. Hence, in this paper, we plan the gateways placement under the consideration of this issue. To the best of our knowledge, this paper is the first work to plan gateway placement under considering the starvation of TCP flows. Our work also provides a new view in the field of planning wireless mesh networks.

Optimizing Gateway Placement in Wireless Mesh Networks Based on ACO Algorithm

Optimizing Gateway Placement in Wireless Mesh Networks Based on ACO Algorithm

A Gateway Placement Scheme with Interference Constraints and Load Balance in Wireless Mesh Networks

How to achieve proper gateway placement is one of the most important challenges in planning wireless mesh networks.Before gateway placement,MRs must be placed and cover the target region completely.The problem of obtaining the minimal gateway set satisfying both network performance and traffic requirements has been proved to be NP hard.In this paper,a novel Gateway Placement Scheme with Interference Constraints and Load Balance(ICLB-GPS) is proposed,considering link interference reducing and gateway load balancing.The scheme combines gateway selection,relay tree construction and node migration between relay trees to achieve load balancing gateway placement,and mainly includes two algorithms: the first one is coverage overlapping and interference reduction gateway selection algorithm,while the second one is gateway load balancing algorithm based on node migration between relay trees.Our simulation compares ICLB-GPS with other existing algorithms on the number of gateways,the MR-GW path length,link interference degree and load balance index,and the results show that ICLB-GPS achieves load balance among gateways and link interference reduction without deployment costs and MR-GW path length increased.

Constrained surface-level gateway placement for underwater acoustic wireless sensor networks

One approach to guarantee the performance of underwater acoustic sensor networks is to deploy multiple Surface-level Gateways (SGs) at the surface. This paper addresses the connected (or survivable) Constrained Surface-level Gateway Placement (C-SGP ) problem for 3-D underwater acoustic sensor networks. Given a set of underwater sensor nodes (USNs) which are floated at different depths to perform collaborative monitoring tasks over a given region, and a set of candidate locations where SGs may be placed, our objective is to place minimum number of SGs at a subset of candidate locations such that it is connected (or k-connected) from any USN to the base station. We first propose a general algorithm for the connected C-SGP problem and prove its approximation ratio. We also give a constant ratio approximation algorithm for the problem. Second, for the survivable C-SGP problem we also propose a general algorithm and prove its approximation ratio. Finally, we give a constant ratio approximation algorithm for the 2-connected C-SGP problem.

Design of scalable and efficient multi-radio wireless networks

A proper design of Wireless Mesh Networks (WMNs) is a fundamental task that should be addressed carefully to allow the deployment of scalable and efficient networks. Specifically, choosing strategic locations to optimally place gateways prior to network deployment can alleviate a number of performance/scalability related problems. In this paper, we first, propose a novel clustering based gateway placement algorithm (CBGPA) to effectively select the locations of gateways. Existing solutions for optimal gateway placement using clustering approaches are tree-based and therefore are inherently less reliable since a tree topology uses a smaller number of links. Independently from the tree structure, CBGPA strategically places the gateways to serve as many routers as possible that are within a bounded number of hops. Next, we devise a new multi-objective optimization approach that models WMN topologies from scratch. The three objectives of deployment cost, network throughput and average congestion of gateways are simultaneously optimized using a nature inspired meta-heuristic algorithm coupled with CBGPA. This provides the network operator with a set of bounded-delay trade-off solutions. Comparative simulation studies with different key parameter settings are conducted to show the effectiveness of CBGPA and to evaluate the performance of the proposed model.

Framework for optimizing the capacity of wireless mesh networks

In this paper, we address the problem of computing the transport capacity of Wireless Mesh Networks (WMNs) dedicated to Internet access. Routing and transmission scheduling have a major impact on the capacity provided to the clients. A cross-layer optimization of these problems allows the routing to take into account contentions due to radio interference. We present a generic mixed integer linear programing description of the configurations of a given WMN, addressing gateway placement, routing, and scheduling optimizations. We then develop new optimization models that can take into account a large variety of radio interference models, and QoS requirements on the routing. We also provide efficient resolution methods that deal with realistic size instances. It allows to work around the combinatoric of simultaneously achievable transmissions and point out a critical region in the network bounding the network achievable capacity. Based upon strong duality arguments, it is then possible to restrict the computation to a bounded area. It allows for computing solutions very efficiently on large networks.

Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs

Motivated by the gateway placement problem in wireless networks, we consider the geometric k-centre problem on unit disc graphs: given a set of points P in the plane, find a set F of k points in the plane that minimizes the maximum graph distance from any vertex in P to the nearest vertex in F in the unit disc graph induced by P ∪ F . We show that the vertex 1-centre provides a 7-approximation of the geometric 1-centre and that a vertex k-centre provides a 13-approximation of the geometric k-centre, resulting in an O ( k n ) -time 26-approximation algorithm. We describe O ( n 2 m ) -time and O ( n 3 ) -time algorithms, respectively, for finding exact and approximate geometric 1-centres, and an O ( m n 2 k ) -time algorithm for finding a geometric k-centre for any fixed k. We show that the problem is NP-hard when k is an arbitrary input parameter. Finally, we describe an O ( n ) -time algorithm for finding a geometric k-centre in one dimension.

Bi-criteria Gateway Placement Problem in Wireless Sensor Networks

Bi-criteria Gateway Placement Problem in Wireless Sensor NetworksOver the last few years, wireless sensor networks (WSNs) have started to play more and more important role in civil and military applications. A typical sensor network consists of resource-constrained sensing nodes, which monitor environment and send the data to more powerful gateway nodes. The goal of gateway nodes is to aggregate, process and send the data to other gateways or directly to sink nodes. The proper placement of nodes is needed to provide good network operation. Sensing nodes are often placed in a random manner unlike gateways. Gateways, due to their role and cost, are installed rather in a controlled way. In this paper, a bi-criteria gateway placement problem is introduced. The problem is shown to be NP-hard. We formulate it as a linear programming problem, then we develop the Multi-criteria Simulated Allocation (MSAL) heuristic algorithm, for the purpose of cost-effective gateway deployment and power-effective wireless connection management. Finally, we evaluate the efficiency of the algorithm by comparison with the exact method.

Erratum to “The joint gateway placement and spatial reuse problem in wireless mesh networks” [Computer Networks 54 (2010) 231–240

Erratum to “The joint gateway placement and spatial reuse problem in wireless mesh networks” [Computer Networks 54 (2010) 231–240

On Optimizing Gateway Placement for Throughput in Wireless Mesh Networks

An innovative gateway placement scheme is proposed for wireless mesh networks (WMNs) in this paper. It determines the location of a gateway based on a new performance metric called multihop traffic-flow weight (MTW). The MTW computation takes into account many factors that impact the throughput of WMNs, that is, the number of mesh routers, the number of mesh clients, the number of gateways, traffic demand from mesh clients, locations of gateways, and possible interference among gateways. Thus, the proposed gateway placement scheme provides a framework of significantly improving throughput of WMNs through proper placement of gateways. To evaluate the performance of the new gateway placement scheme, a nonasymptotic throughput of WMNs is derived by considering TDMA scheduling. The derivations also provide a guideline for designing scheduling schemes of WMNs. Numeric results show that the proposed gateway placement scheme constantly outperforms other schemes by a large margin.

Minimum-cost gateway placement in wireless mesh networks with QoS constraints

In wireless mesh networks (WMNs), gateway optimal placement is key to network performance, QoS and construction cost. This paper focuses on gateway placement with QoS constraints in WMNs, and aims to minimise the cost of gateway placement. Firstly, a new concept of limited dominating set (LDS) in graph is presented to address the minimum-cost gateway placement problem, which is converted to find the minimum weighted LDS in a graph. Secondly, we propose a heuristic algorithm WMB-LDS to find the minimum weighted LDS for a graph, which takes the performance/cost ratio of gateway candidates as heuristic information. Furthermore, we design a genetic algorithm GA-LDS to search for the global optimal solution. At last, simulation is done, and the experimental results show that, compared with previous work, WMB-LDS has better performance and lower computing complexity, and GA-LDS has the best experiment result at the price of the increasing computing complexity.

The joint Gateway Placement and Spatial Reuse Problem in Wireless Mesh Networks

A Wireless Mesh Network (WMN) is composed of multiple Access Points (APs) that are connected together using the radio channel and by a limited number of gateway APs connected to the Internet. In this paper, we address the problem of gateway placement that consists of minimizing the number of gateways while satisfying system performance requirements. Along with the placement problem, the formulation includes joint routing and scheduling to account for the problem of interference and to enable spacial reuse. The problem, which we coined GPSRP (Gateway Placement and Spatial Reuse Problem), allows a much more efficient use of the available resources and reduces overall gateway costs. This article presents for the first time a mathematical formulation of the problem and discusses its advantages and limitations with respect to other approaches.

Cost-Sensitive and Load-Balancing Gateway Placement in Wireless Mesh Networks with QoS Constraints

In wireless mesh networks (WMNs), gateway placement is the key to network performance, QoS and construction cost. This paper focuses on the optimization of the cost and load balance in the gateway placement strategy, ensuring the QoS requirements. Firstly, we define a metric for load balance on the gateways, and address the minimum cost and load balancing gateway placement problem. Secondly, we propose two algorithms for gateway placement. One is a heuristic algorithm, which is sensitive to the cost, selects the gateway candidates according to the capacity/cost ratio of the nodes, and optimizes the load balance on the gateways through scanning and shifting methods. The other is a genetic algorithm, which can find the global optimal solution. The two algorithms differ in their computing complexity and the quality of the generated solutions, and thus provide a trade-off for WMN design. At last, simulation is done, and experimental results show that the two algorithms outperform the others. Compared with OPEN/CLOSE, the average cost of gateway placement generated by our algorithms is decreased by 8%~32%, and the load variance on the gateways decreased by 77%~86%. For the genetic algorithm, the performance improvement is at the price of the increase of the CPU execution time.

Free-Space Optical Gateway Placement in Hybrid Wireless Mesh Networks

The capacity of wireless mesh networks (WMN) must usually be upgraded as usage demands evolve over time. This is normally done by adding gateways which serve to increase the backhaul capacity of the network. In this paper we consider adding capacity in this manner using free-space optical (FSO) backhaul links. To accomplish this, we formulate a joint clustering and gateway placement problem which includes the strong rate-distance dependence of practical FSO links. The formulation incorporates the positions of existing wireline gateways and minimizes the number of additional hybrid-FSO/RF gateways which are needed to satisfy the target capacity requirements. After showing the complexity of the problem, a solution that is motivated by genetic algorithms is proposed. The performance of our algorithm is then compared to an optimal solution generated via an integer linear program (ILP) for small WMNs. The proposed algorithm is then modified to allow for balancing the traffic load that is carried by each gateway in the WMN. Many scenarios are considered which demonstrate the value of using FSO backhaul links to obtain post-deployment capacity upgrades in response to changes in user traffic.

A Traffic Engineering Approach for Placement and Selection of Network Services

Network services are provided by means of dedicated service gateways, through which traffic flows are directed. Existing work on service gateway placement has been primarily focused on minimizing the length of the routes through these gateways. Only limited attention has been paid to the effect these routes have on overall network performance. We propose a novel approach for the service placement problem, which takes into account traffic engineering considerations. Rather than trying to minimize the length of the traffic flow routes, we take advantage of these routes in order to enhance the overall network performance. We divide the problem into two subproblems: finding the best location for each service gateway, and selecting the best service gateway for each flow. We propose efficient algorithms for both problems and study their performance. Our main contribution is showing that placement and selection of network services can be used as effective tools for traffic engineering.

Gateways Placement in Backbone Wireless Mesh Networks

This paper presents a novel algorithm for the gateway placement problem in Backbone Wireless Mesh Networks (BWMNs). Different from existing algorithms, the new algorithm incrementally identifies gateways and assigns mesh routers to identified gateways. The new algorithm can guarantee to find a feasible gateway placement satisfying Quality-of-Service (QoS) constraints, including delay constraint, relay load constraint and gateway capacity constraint. Experimental results show that its performance is as good as that of the best of existing algorithms for the gateway placement problem. But, the new algorithm can be used for BWMNs that do not form one connected component, and it is easy to implement and use.