Gateway Selection Research Articles

GBC-TD: Gateway Based Congestion and Traffic Distribution Model for Load Sharing in WMN

Effective communication can be categorized by its approaches used to handles the uncertainties and especially in wireless medium. Wireless mesh network is one of the ad-hoc networks having huge applicability with variety of protocols supporting different routing situations. Load balancing over the gateway is one of the key issues related to optimal routing in WMN. In case of multiple networks inter communication; WMN suffers from the gateway selection problem and its load distribution commonly taken as NP-Hard complexity. Mainly these gateway nodes are having the maximum traffic flows due to their central locations and bridge functionality, also the traffic distribution is uneven at those gateways. This paper proposes a novel GBC-TD (Gateway Based Congestion and Traffic Distribution) model from overcoming the above issues of gateway selection problem by using a load balancer through relaying information, TTL values and flag bits status. The approach is capable of distributing the load over the network. At the primary level of work the approach is proving its efficiency and will shows its strong presence in near future. Index Terms: WMN (Wireless Mesh Network), Routing, Load Balancing Gateway Selection, Congestion, Traffic Divergence, GBC-TD (Gateway Based Congestion and Traffic Distribution); I. INTRODUCTION Wireless medium is gaining popularity these days due to their wide applicability in several areas such as: healthcare, transportation, military, telecommunication etc. Wireless mesh network is a ad-hoc network consists of mesh routers and clients. Here each node will acts as a router as well as client. The transmission is of supportive communication in which the nodes transfer the packets with the help of some other node in the range of source to destination. Since the deployment effort required with WMN is very less thus taken as most effective means for establishing the communication is disaster affected areas. Thus in such cases where the number of routers or intermediately nodes are less the traffic flow form them is very high causes congestion at their gateways. Hence a new mechanism has to be designed for resolving those load balancing issues of underutilized and over-utilized mesh nodes. Distribution of traffic from those nodes can be made after analysis of traffic patterns which might be affected by different parameters such as: mesh router location, channel assignment, scheduling and transmissions etc. In most of the cases of static networks the topology is fixed so as the gateway selection and connections diverts the network performance factors. Largely there are some problems which continuously affects such situations and includes the problems of congestion, load balancing, gateway selection, and flow and topology control. Consider wireless mesh network having routers and a base station, which is directly connected to external network by some gateway node. Now the in above situation the node transmitting the maximum number of packets between two different networks is taken as a gateway node. Here the base station is located at some central position after gateway selection is performed from the existing mesh nodes with larger relaying data. These selected gateways are collaborated by a common communication channel between them. In this the managing node is termed as a base station and is located at the centre of the wireless mesh network. This station chooses a certain number of wireless mesh routers as sink or gateways, and creates connections among them. The purpose of this work is to effortlessly and promptly discover the candidate gateways that maximize the system throughput with solvable optimization issues. It also includes number of evaluating parameters and involves intense computation load values. The performance of the proposed scheme is evaluated by numerical analysis, and demonstrated through computer simulations. In future the results show that our proposed scheme can determine the appropriate candidate gateway with high accuracy when there is a certain variance in the amount of traffic generated by users at each wireless mesh router. II. BACKGROUND Ad-hoc network provides wide area of applicability and range of communication options for several technologies to ease the networking usages. These technologies still suffers from many issues and challenges to make this communication more effective, performance oriented and secure. Among them routing is considered to be a major task required for such improvements. Routing involves source to destination communication via

Review paper of gateway selection schemes for MANET of NEMO (MANEMO)

The fast growth of Internet applications brings with it new challenges for researchers to provide new solutions that guarantee better Internet access for mobile hosts and networks. The globally reachable, Home-Agent based, infrastructure Network Mobility (NEMO) and the local, multi-hop, and infrastructure-less Mobile Ad hoc Network (MANET) developed by Internet Engineering Task Force (IETF) support different topologies of the mobile networks. A new architecture was proposed by combining both topologies to obtain Mobile Ad Hoc NEMO (MANEMO). However, the integration of NEMO and MANET introduces many challenges such as network loops, sub-optimal route, redundant tunnel problem, absence of communication without Home Agent reachability, and exit router selection when multiple Exit Routers to the Internet exist. This paper aims to review the different proposed models that could be used to implement the gateway selection mechanism and it highlights the strengths as well as the limitations of these approaches.

How to Select Optimal Gateway in Multi-Domain Wireless Networks: Alternative Solutions without Learning

Gateways are a crucial part of wireless networks. In multi-domain wireless networks, the existing solution to the problem of optimal gateway selection is based on distributed learning. While such a solution is interesting and useful, it has a fundamental limitation: the learning algorithm may stay for long time in a Nash Equilibrium that does not correspond to the optimal gateway selection. This stay can be so long that people can hardly wait for the convergence of the learning algorithm to the optimal gateway selection. In this paper, we present a systematic study of the gateway selection problem. We distinguish three cases and present an alternative solution to the problem in each of these cases: for public link costs, an algorithm to compute the optimal gateway selection directly; for two domains with private link costs, a cryptographic protocol; for three or more domains with private link costs, a perturbation-based protocol. In all the three cases, our solutions accurately compute the optimal gateway selection within reasonable amounts of time, although we emphasize that our solutions are NOT improvements to the gateway selection solutions based on distributed learning (mainly because our solutions are centralized instead of distributed).

Joint Routing and Scheduling in Mobile Aeronautical Ad Hoc Networks

In this paper, we formulate the joint Internet gateway allocation, routing, and scheduling problem in wireless ad hoc networks with the goal of minimizing the average packet delay in a space-time-division multiple-access (STDMA) network. We first propose a mathematical programming approach consisting of two steps: the minimization of the weighted hop count (mWHC) subject to scheduling constraints, followed by average delay minimization for the previously computed routes. Since the computational complexity of this approach is prohibitive for larger networks, we also formulate a genetic algorithm (GA) that can be applied to larger networks and mobile networks. We analyze the performance of both approaches by means of simulations and compare the solution that they provide to a simple hop-count-based routing and gateway selection solution. It is shown that the performance of the GA is comparable with the mathematical programming approach in terms of delay and packet delivery ratio (PDR) at lower complexity and is significantly better than the hop-count-based solution.

Simplified gateway selection scheme for multihop relay in vehicular ad hoc network

SUMMARYIntegrating vehicular ad hoc network (VANET) and universal mobile telecommunication system (UMTS) could be a promising architecture for future machine‐to‐machine applications. This integration can help vehicles have steady Internet connection through the UMTS network and in communicating with other vehicles. However, dead spot areas and unsuccessful handoff processes caused by the high speed of vehicles can disrupt the implementation of this kind of architecture. In this paper, a new simplified gateway selection (SGS) scheme for multihop relay in a VANET‐UMTS integration network is proposed. The proposed scheme extends the coverage or/and calming of the frequent handoff process and allows vehicles to continue to be connected to the UMTS infrastructure network. An integrated simulation environment that combines VanetMobiSim and NS2 is used to simulate and evaluate the proposed scheme. The simulation results show that the SGS scheme performed better when it was implemented with ad hoc on a demand distance vector routing and destination‐sequenced distance vector routing protocols. Furthermore, the SGS scheme is compared with other cluster‐based gateway selections used in the previous works. The results show that our SGS scheme outperforms other cluster‐based gateway selections scheme in terms of selection delay, control packet overhead, packet delivery ratio, and overall throughput. Copyright © 2013 John Wiley & Sons, Ltd.

GSM: gateway selection mechanism for strengthening inter-cluster coordination in cognitive radio ad hoc networks

Abstract In the open access spectrum paradigm, the dynamics of the available spectrum heterogeneity due to the geographical location of various cognitive radio/secondary users (SUs) and primary users (PUs) prevent the assignment of a single common control channel to every SU. Thus, depending on channel availability, SUs are forced to form clusters to solve the problem of control channel assignment. However, the sudden appearance of a PU may lead to loss of intra-cluster or inter-cluster connectivity among SUs. This problem can be resolved by improving the cluster formation process and selecting suitable gateway nodes for inter-cluster coordination. In this paper, our goal is to improve inter-cluster connectivity by selecting more appropriate gateway nodes for inter-cluster coordination. We therefore propose an inter-cluster gateway node selection mechanism that strengthens inter-cluster coordination. Our scheme shows significant improvement in terms of inter-cluster connectivity compared with related work.

A Novel Gateway Selection Technique for Throughput Optimization in Configurable Wireless Mesh Networks

Wireless mesh networks (WMNs) have attracted much attention due to their low up-front cost, easy network deployment, stable topology, robustness, reliable coverage, and so forth. These advantages are suitable for the disaster recovery applications in disaster areas, where WMNs can be advantageously utilized to restore network collapse after the disaster. In this paper, based on a new network infrastructure for WMNs, to guarantee high network performance, we focus on the issue of throughput optimization to improve the performance for WMNs. Owing to selecting different mesh router (MR) as the gateway will lead to different network throughput capacity, we propose a novel gateway selection technique to rapidly select the optimal MR as the gateway, in order to maximize the network throughput. In addition, we take into account the traffic distribution for the MR to eliminate traffic congestion in our method. The performance of our proposed method is evaluated by both numerical and simulated analysis. The simulation results demonstrate that the gateway selection method is effective and efficient to optimize the throughput for WMNs.

Scalable multi-hop routing in wireless networks

Infrastructure-less wireless multi-hop networks have long been proposed for natural disaster and warfare scenarios. However, the current demand of such networks has been towards social networking, gaming and ultimately, ubiquitous computing. In fact, the increasing number of users that own wireless capable devices is taking these networks to an entirely different scale. Existing routing protocols do not scale and do not consider the context wherein services operate. By presenting an alternative routing scheme that appropriately handles mobility of users among different contexts, large-scale clustered wireless networks are designed, using an efficient gateway selection with load-balancing capabilities. This approach uses a virtual hierarchy of clusters to explore the contextual-proximity of nodes, while reducing the total overhead of routing traffic even when compared with other cluster-based approaches. Moreover, it is capable of predicting gateway link disconnections, increasing the total amount of delivered data. The obtained results reveal that this routing scheme outperforms existing routing protocols regardless of the mobility pattern being used, being consistently lighter in overhead and delivering up to 50% more data traffic. These results motivate a new era of large-scale wireless multi-hop networks suitable for hand-held devices exchanging data amongst themselves.

Joint gateway selection, transmission slot assignment, routing and power control for wireless mesh networks

Wireless mesh networks (WMNs) provide cost effective solutions for setting up a communications network over a certain geographic area. In this paper, we study strategic problems of WMNs such as selecting the gateway nodes along with several operational problems such as routing, power control, and transmission slot assignment. Under the assumptions of the physical interference model and the tree-based routing restriction for traffic flow, a mixed integer linear programming (MILP) formulation is presented, in which the objective is to maximize the minimum service level provided at the nodes. A set of valid inequalities is derived and added to the model in an attempt to improve the solution quality. Since the MILP formulation becomes computationally infeasible for larger instances, we propose a heuristic method that is aimed at solving the problem in two stages. In the first stage, we devise a simple MILP problem that is concerned only with the selection of gateway nodes. In the second stage, the MILP problem in the original formulation is solved by fixing the gateway nodes from the first stage. Computational experiments are provided to evaluate the proposed models and the heuristic method.

Optical and Wireless Hybrid Access Networks: Design and Optimization

The performance of optical/wireless hybrid networks is largely limited by the wireless part. To reduce the wireless transmission, we configure virtual channels in the optical infrastructure as “shortcuts” between selected gateways. Adding virtual channels changes the network topology and affects the optimality of gateway deployment. Meanwhile, the gateway locations dictate the traffic distribution that affects the selection of gateways for virtual-channel placement. We propose to jointly optimize the gateways and virtual channels, and formulate the optimization as a mixed integer programming problem. In addition, we design an efficient heuristic algorithm based on k-means clustering to iteratively optimize these two aspects. Our schemes are evaluated using various network settings (network size, number of gateways, etc.). In particular, a random topology with Ethernet traffic is studied for delay and throughput. Numerical results show that our design and optimization effectively reduce the wireless transmission, which leads to better scalability, smaller traffic delay, and larger throughput.

Gateway discovery algorithm based on multiple QoS path parameters between mobile node and gateway node

Several gateway selection schemes have been proposed that select gateway nodes based on a single Quality of Service (QoS) path parameter, for instance path availability period, link capacity or end-to-end delay, etc. or on multiple non-QoS parameters, for instance the combination of gateway node speed, residual energy, and number of hops, for Mobile Ad hoc NETworks (MANETs). Each scheme just focuses on the ment of improve only a single network performance, i.e., network throughput, packet delivery ratio, end-to-end delay, or packet drop ratio. However, none of these schemes improves the overall network performance because they focus on a single QoS path parameter or on set of non-QoS parameters. To improve the overall network performance, it is necessary to select a gateway with stable path, a path with the maximum residual load capacity and the minimum latency. In this paper, we propose a gateway selection scheme that considers multiple QoS path parameters such as path availability period, available capacity and latency, to select a potential gateway node. We improve the path availability computation accuracy, we introduce a feedback system to updated path dynamics to the traffic source node and we propose an efficient method to propagate QoS parameters in our scheme. Computer simulations show that our gateway selection scheme improves throughput and packet delivery ratio with less per node energy consumption. It also improves the end-to-end delay compared to single QoS path parameter gateway selection schemes. In addition, we simulate the proposed scheme by considering weighting factors to gateway selection parameters and results show that the weighting factors improve the throughput and end-to-end delay compared to the conventional schemes.

Multi-criteria Gateway Selection and Multipath Routing Protocol for Hybrid MANETs

mobile ad hoc network (MANET), the mobility of the ad hoc nodes can cause route failures and necessitates the new route discovery. Also the mobility can result in delay and overhead. In this paper, we propose a multi-criteria gateway selection and multipath routing protocol for hybrid MANET that considers mobility metric as one of the criterion for the selecting the gateway. For gateway selection, a combined weight value is determined based on the metrics mobility, inter and intra MANET traffic load and residual energy using simple additive weighing (SAW) technique. Among the selected path from the multiple paths, the gateway with maximum weight is selected. If such a gateway does not exist, alternate path is selected from the multi path set. By simulation results, we show that our proposed protocol is more efficient technique for gateway selection.

Ad Hoc Access Gateway Selection Algorithm

Abstract With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. For mobile nodes in Ad Hoc network to internet, internet communications in the peer nodes must be achieved through the gateway. Therefore, the key Ad Hoc Access Networks will focus on the discovery gateway, as well as gateway selection in the case of multi-gateway and handover problems between different gateways. This paper considers the mobile node and the gateway, based on the average number of hops from an average access time and the stability of routes, improved gateway selection algorithm were proposed. An improved gateway selection algorithm, which mainly considers the algorithm can improve the access time of Ad Hoc nodes and the continuity of communication between the gateways, were proposed. This can improve the quality of communication across the network.

A Novel Algorithm for Power Saving and Over Head Reduction in the Wireless Networks

The majority of the nodes connected and operating as an today are Wireless networks, because of its own advantage. In the Adhoc networks nodes are not connected with any fixed infrastructure and are operated by battery power. Each node consumes a large amount of energy while transmission or reception of packets, among the nodes. While the nodes depend on each other for efficient transferring of packets, it is a key issue in networks to have efficient methods for forwarding of packets between any given pair of nodes, with minimum power consumption and less number of intermediate nodes . In this study we propose an optimal routing protocol called MARI (Mobile Agent with Routing Intelligence). The MARI Topology proposed for power management is novel and is used for the consumption of minimum power in an wireless network, at each node. The Protocol groups the network into distinct networks with the selection of MARI nodes and Gateways for efficient packet transmission between any member node pair. The operational cycle at each node is classified into four distinct operations, i.e., transmitting, receiving, idle and sleep cycle, in order to achieve efficient power management in a wireless network. Keywords -Adhoc Networks, MARI, Power management, Nodes, Transmission.

Research of Ad Hoc Networks Access Algorithm

Abstract With the continuous development of mobile communication technology, Ad Hoc access network has become a hot research, Ad Hoc access network nodes can be used to expand capacity of multi-hop communication range of mobile communication system, even business adjacent to the community, improve edge data rates. When the ad hoc network is the access network of the internet, the gateway discovery protocol is very important to choose the most appropriate gateway to guarantee the connectivity between ad hoc network and IP based fixed networks. The paper proposes a QoS gateway discovery protocol which uses the time delay and stable route to the gateway selection conditions. And according to the gateway discovery protocol, it also proposes a fast handover scheme which can decrease the handover time and improve the handover efficiency.

Efficient Multipath DYMO Routing Protocol with Gateway Selection for Hybrid MANETs

Efficient Multipath DYMO Routing Protocol with Gateway Selection for Hybrid MANETs

Simulation-based analysis of a multi-hop integrated UMTS and WLAN network

The next generation communication networks will comprise of third-generation (3G) and fourth-generation (4G) cellular and multi-hop ad hoc networks. In particular, the Universal Mobile Telecommunications System (UMTS) and the IEEE 802.11 ad hoc networks will play a significant role. The UMTS can provide Internet service in wide areas with excellent mobility support while IEEE 802.11 can provide high speed last hop connectivity in indoor environment. The performance of the offered end-to-end TCP connection when these two different technologies come together to serve the users is an important aspect to be studied. In this paper, we build an analytical model to model the complete process of TCP packet transfer over this integrated network. The delay and end-to-end throughput are modeled. We also verify the simulation results considering the usual error rate in UMTS channels. Our analytical results match well with the simulation models that are widely used. Apart from modeling the Internet connectivity, our model can be used for multitude of tasks, such as gateway selection, resource reservation, etc., in the next generation cellular multi-hop networks.

Responsive on-line gateway load-balancing for wireless mesh networks

We propose an adaptive online load-balancing protocol for multi-gateway Wireless Mesh Networks (WMNs) which, based on the current network conditions, balances load between gateways. Traffic is balanced at the TCP flow level and, as a result, the aggregate throughput, average flow throughput and fairness of flows improves. The proposed scheme (referred to as Gateway Load-Balancing, GWLB) is highly responsive, thanks to fast gateway selection and the fact that current traffic conditions are maintained up-to-date at all times without any overhead. It also effectively takes into account intra-flow and inter-flow interference when switching flows between gateway domains. We have found the performance achievable by routes used after gateway selection to be very close to the performance of optimal routes found by solving a MINLP formulation under the protocol model of interference. Through simulations, we analyze performance and compare with a number of proposed strategies, showing that GWLB outperforms them. In particular, we have observed average flow throughput gains of 128% over the nearest gateway strategy.

Dynamic Clustering-Based Adaptive Mobile Gateway Management in Integrated VANET — 3G Heterogeneous Wireless Networks

Coupling the high data rates of IEEE 802.11p-based VANETs and the wide coverage area of 3GPP networks (e.g., UMTS), this paper envisions a VANET-UMTS integrated network architecture. In this architecture, vehicles are dynamically clustered according to different related metrics. From these clusters, a minimum number of vehicles, equipped with IEEE 802.11p and UTRAN interfaces, are selected as vehicular gateways to link VANET to UMTS. Issues pertaining to gateway selection, gateway advertisement and discovery, service migration between gateways (i.e., when serving gateways lose their optimality) are all addressed and an adaptive mobile gateway management mechanism is proposed. Simulations are carried out using NS2 to evaluate the performance of the envisioned architecture incorporating the proposed mechanisms. Encouraging results are obtained in terms of high data packet delivery ratios and throughput, reduced control packet overhead, and minimized delay and packet drop rates.

Local segment-shared protection based on source egress gateway selection for multi-domain optical mesh networks

Survivability for multi-domain optical networks is becoming a key parameter due to expanding network. In order to provide the shared-path-protected lightpath in multi-domain optical mesh networks, we propose a protection solution, called GSLSSP. A new source egress gateway selecting mechanism is adopted in this solution. For each connection request, this mechanism can enable the source node to select a better egress gateway node to the destination domain and compute one inter-domain working path near the optimal path with the cooperating of this gateway node, under scalability and domain privacy constraint of multi-domain networks. And then one intra-domain link-disjoint local segment-backup path for each working-segment path is computed out in each single-domain passed by the working path. Simulation evaluation shows that the proposed scheme can provide 100% protection ability for multiple failures. Besides, it is effective in multi-domain path protection with more efficient resource utilization, lower blocking probabilities and less inter-domain cost than other schemes.