Conference Paper

Analyzing Gateway Association in Wireless Mesh Network

Authors:
To read the full-text of this research, you can request a copy directly from the authors.

Abstract

Wireless Mesh Networks (WMNs) have received attention in wireless network users. Low cost, easy deploy ability, access to the Internet, are few of the several reasons for it. It is also capturing major share of attention amongst researchers as it is in its evolutionary stage. The performance of WMN is still under observation. In this paper, we have tried to analyze the performance of wireless mesh network where each individual cluster of client nodes is associated with cluster head which serves as default Gateway for Internet access. The performance is evaluated on the basis of throughput with varying transmission rate. Also end to end to delay with different transmission rates is analyzed. Performance of a cluster with one Gateway is compared with four clusters scenario. Number of nodes in the cluster is kept same as in the first case. Network Simulator NS-2 is used for evaluation. The results show that Multiple Gateway scenarios provide better results as compared to Single Gateway as the density of nodes goes on reducing per cluster.

No full-text available

Request Full-text Paper PDF

To read the full-text of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
Wireless mesh networks have the potential to deliver Internet broadband access, wireless local area net-work coverage and network connectivity for stationary or mobile hosts at low costs both for network operators and customers. The core technology involves a network of wireless routers relaying each others' packets in a multihop fashion. Many variations on targeted applications and implementation choices offer different opportunities to emerging companies in this emerging area. In this article, we will present an introduction to wireless mesh networks and present both the benefits enabled by this technology and the main hurdles that have to be overcome.
Conference Paper
Full-text available
We present a new metric for routing in multi-radio, multi-hop wireless networks. We focus on wireless networks with stationary nodes, such as community wireless networks.The goal of the metric is to choose a high-throughput path between a source and a destination. Our metric assigns weights to individual links based on the Expected Transmission Time (ETT) of a packet over the link. The ETT is a function of the loss rate and the bandwidth of the link. The individual link weights are combined into a path metric called Weighted Cumulative ETT (WCETT) that explicitly accounts for the interference among links that use the same channel. The WCETT metric is incorporated into a routing protocol that we call Multi-Radio Link-Quality Source Routing.We studied the performance of our metric by implementing it in a wireless testbed consisting of 23 nodes, each equipped with two 802.11 wireless cards. We find that in a multi-radio environment, our metric significantly outperforms previously-proposed routing metrics by making judicious use of the second radio.
Conference Paper
Full-text available
This paper presents a study of the gateway access-point selection problem for the wireless infrastructure mesh network (WIMNET). WIMNET is a wireless mesh network composed of multiple access-points (APs) that communicate mutually using radio transmissions, and all the traffics to/from the Internet go through the limited number of gateway APs. Thus, the selection of these gateway APs often determines the whole performance of WIMNET, because heavy congestions at gateway APs and their peripheries can drastically increase the delay and the link failure due to radio interferences. In this paper, we define a cost function to minimize the total traffic in WIMNET in order to reduce congestions and present a simple algorithm. Through simulations using the newly developed WIMNET simulator, we show the effectiveness of our approach.
Conference Paper
Full-text available
Even though multiple non-overlapped channels exist in the 2.4 GHz and 5 GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a result, these networks rarely can fully exploit the aggregate bandwidth available in the radio spectrum provisioned by the standards. This prevents them from being used as an ISP's wireless last-mile access network or as a wireless enterprise backbone network. In this paper, we propose a multi-channel wireless mesh network (WMN) architecture (called Hyacinth) that equips each mesh network node with multiple 802.11 network interface cards (NICs). The central design issues of this multi-channel WMN architecture are channel assignment and routing. We show that intelligent channel assignment is critical to Hyacinth's performance, present distributed algorithms that utilize only local traffic load information to dynamically assign channels and to route packets, and compare their performance against a centralized algorithm that performs the same functions. Through an extensive simulation study, we show that even with just 2 NICs on each node, it is possible to improve the network throughput by a factor of 6 to 7 when compared with the conventional single-channel ad hoc network architecture. We also describe and evaluate a 9-node Hyacinth prototype that Is built using commodity PCs each equipped with two 802.11a NICs.
Article
Wireless mesh networks (WMNs) consist of mesh routers and mesh clients, where mesh routers have minimal mobility and form the backbone of WMNs. They provide network access for both mesh and conventional clients. The integration of WMNs with other networks such as the Internet, cellular, IEEE 802.11, IEEE 802.15, IEEE 802.16, sensor networks, etc., can be accomplished through the gateway and bridging functions in the mesh routers. Mesh clients can be either stationary or mobile, and can form a client mesh network among themselves and with mesh routers. WMNs are anticipated to resolve the limitations and to significantly improve the performance of ad hoc networks, wireless local area networks (WLANs), wireless personal area networks (WPANs), and wireless metropolitan area networks (WMANs). They are undergoing rapid progress and inspiring numerous deployments. WMNs will deliver wireless services for a large variety of applications in personal, local, campus, and metropolitan areas. Despite recent advances in wireless mesh networking, many research challenges remain in all protocol layers. This paper presents a detailed study on recent advances and open research issues in WMNs. System architectures and applications of WMNs are described, followed by discussing the critical factors influencing protocol design. Theoretical network capacity and the state-of-the-art protocols for WMNs are explored with an objective to point out a number of open research issues. Finally, testbeds, industrial practice, and current standard activities related to WMNs are highlighted.
Article
With the standardization of IEEE 802.11, there has been an explosive growth of wireless local area networks (WLAN). Recently, this cost effective technology is being developed aggressively for establishing metro-scale “cellular Wi-Fi” network to support seamless Internet access in the urban area. We envision a large scale WLAN system in the future where Access Points (APs) will be scattered over an entire city enabling people to use their mobile devices ubiquitously. The problem addressed in this paper involves finding the minimum number of gateways and their optimal placement so as to minimize the network installation costs while maintaining reliability, flexibility and an acceptable grade of service. The problem is modeled taking a network graph, where the nodes represents either the Access Points of IEEE 802.11 or wired backbone gateways. In this paper, we present two methods (1) an innovative approach using integer linear programming (ILP) for gateway selection in the cellular Wi-Fi network, and (2) a completely new heuristic (OPEN/CLOSE) to solve the gateway selection problem. In the ILP model, we developed a set of linear inequalities based on various constraints. The ILP model is solved by using lp-solve, a simplex-based software for linear and integer programming problems. The second approach is an OPEN/CLOSE heuristic, tailored for cellular Wi-Fi, which arrives at a sub-optimal solution. Java programming language is used for simulation in OPEN/CLOSE heuristic. Extensive simulations are carried out for performance evaluation. Simulation results show that the proposed approaches can effectively identify a set of gateways at optimal locations in a cellular Wi-Fi network, resulting in an overall cost reduction of up to 50%. The technique presented in this paper is generalized and can be used for gateway selection for other networks as well.