Securing Remote Access Inside Wireless Mesh Networks

Wireless Mesh Network (WMN) is recently emerged network having robustness. It supports clients to communicate with different types of networks, Internet etc which provides a better service to next generation. It consists of mesh routers and mesh clients. These mesh routers are minimal mobile and mesh clients are totally mobile. The protocols of Ad hoc network are used in WMN. These protocols assume that every node is mobile. But as the mesh routers are minimal mobile or not mobile, the protocols brings overhead for the mesh routers. Our task is to relieve mesh routers using ad hoc network protocol from the overhead and define a better protocol which will fit in WMN efficiently. To do so, we've found that the existing architecture of WMN is needed to be changed slightly. We have proposed a new architecture for Wireless Mesh Network. In our proposal WMN is relieved from overhead being caused by using ad hoc network protocol. Our architecture use unicasting technique in lieu of broadcasting technique for route discovery as well as route maintenance. We will first describe the overview of WMN, its existing architecture. Later we will go to our proposed architecture.

There is a growing interest in ad hoc wireless networking internationally, due to the great cost in infrastructure and the time delay for deployment for new traditional wireless networks for a specific purpose (i.e. cellular systems). The interest arises from the possibility of delivering telecommunication services rapidly and with the reduced needs for costly generic infrastructure. Examples of such services include, among others, a convention where a large number of people are concentrated in a limited geographical area, a university campus with a great density of telecommunication users, or even a disaster area where the fixed infrastructure have been damaged. In most examples, ad hoc wireless networks may complement or replace the existing wireless telecommunications infrastructure. One flavor of ad hoc wireless networks that is of interest in this context, and is well adapted to the Lebanese market, are wireless mesh networks (WMN). We propose that the proliferation of WiFi hotspots in high-density areas of population in Lebanon forms the basis of deployment of mesh routers for a WMN. Of specific interest is to be able to use the dense infrastructure of GSM-EDGE (and in the future HSUPA) cellular networks in Lebanon to interconnect those routers in specific locations where it will be hard to deploy additional fixed and cumbersome cellular infrastructure. Locations where hotspots are already deployed (commercial centers, university campuses, business areas, etc.) or could be deployed for special events (conventions, concerts, etc.) could thus be interconnected in a hybrid wireless network, resulting in significantly increased capacity of the network for local voice and data traffic at little additional infrastructure cost. Furthermore, this could a preliminary step for direct connection between the mesh routers and not via the cellular network, into what will become a full- fledged WMN. The structure of the paper is as follows: section the author gives an introduction on ad hoc wireless networks; section II describes WMN and define the design issues of WMN; in section III, we look at a proposed scenario for deployment of WMNs in the Lebanese market and the issues of interconnection with the GSM networks. We will conclude in section IV.

The wireless mesh network is emerging as a promising technology in providing economical and scalable broadband Internet accesses to communities. The backbone of the wireless mesh network consists of mesh routers, which connect each other in an ad hoc manner via wireless links. The presence of backbone mesh routers and utilization of multiple channels and interfaces allow the wireless mesh network to have better capacity than that of the infrastructure-free ad hoc network formed by mesh clients directly. A special type of the mesh routers, referred to as gateway nodes, is capable of Internet connection, and other mesh routers and associated terminal clients have to access the Internet through the gateway nodes. In this paper, we present the analytically traceable stochastic models to characterize the average delay and throughput performance in wireless mesh networks. We model the forwarding mesh routers as an open queuing network. The analytical model takes into account the mesh router density, the random packet arrival process, the degree of locality of traffic and the collision avoidance mechanism of the IEEE802.11 DCF random access MAC. Our simulation results suggest that the analytical results are quite accurate, which can provide valuable insights in system performance and an effective guideline for the scalable design and optimization in wireless mesh networks.

In multi-channel wireless mesh networks (WMNs), it is significantly important to achieve efficient channel utilization. The channel assignment problem, which investigates how to seek a proper mapping between available channels and network interface cards (NICs) on mesh routers (MRs), is attracting more and more attention from the research community. However, most proposed channel assignment approaches assume that NICs are evenly placed on the MRs, and its amount is also pre-determined. Due to the non-uniform distribution of WMN traffic, the equal interface placement will inevitably cause that the bottleneck MRs suffer from NIC shortage, and MRs with less load only have a low utilization of NICs. Hence, in order to improve network performance and reduce network cost, interface placement should be considered carefully in the process of planning a WMN. In this paper, we investigate the joint interface placement and channel assignment problem, i.e., how to appropriately place NICs on MRs and assign channels to them. We first formulate the problem as a mixed integer linear programming (MILP) model, which aims to minimize the total number of NICs while satisfying logical link, link bandwidth, link interference and traffic demand constraints. Then, we propose an MILP-based heuristic algorithm, using iterated local search to obtain sub-optimal solutions efficiently. Finally, we conduct simulation experiments to compare the heuristic solutions with the optimal solutions, and the results show that our proposed heuristic algorithm can achieve good sub-optimal solutions. Moreover, the simulation results also demonstrate that the algorithm can be well applied in large-scale WMNs where the optimal solutions cannot be obtained, and can perform well under different traffic demands.

In recent years, wireless mesh network (WMN) is a compelling topic to many network researchers due to its low cost in deployment, simplicity in installation and robustness in operation. However, existing routing protocols designed for MANET can not work efficiently in WMN because backbone in WMN formed by Mesh Router has very low mobility and are not put under power and memory constraint. In addition, they just concentrate on finding single path from the source to the destination while the characteristics of robustness of WMN require that every intermediate Mesh Router should establish several paths from itself to its desired destination. In our paper, we design a routing protocol that permits each MR to quickly discover multiple paths based on Hop Count metric to the Internet Gateways. Unfortunately, Hop Count does not take packet loss or bandwidth into account. It results in low throughput of a flow that follows the shortest path. A bandwidth estimation technique has been proposed to apply at each Mesh Router to allow it to predict congestion risk over its connected links and to select high available bandwidth link for forwarding packets. A detailed performance evaluation shows that the throughput increases greatly compared to pure AODV and AOMDV in high-loaded traffic scenario.

Wireless Mesh Network (WMN) is a multi hop low cost, with easy maintenance robust network providing reliable service coverage. WMNs consist of mesh routers and mesh clients. In this architecture, while static mesh routers form the wireless backbone, mesh clients access the network through mesh routers as well as directly meshing with each other. Different from traditional wireless networks, WMN is dynamically self-organized and self-configured. In other words, the nodes in the mesh network automatically establish and maintain network connectivity. Over the years researchers have worked, to reduce the redundancy in broadcasting packet in the mesh network in the wireless domain for providing reliable service coverage, the source node deserves to broadcast or flood the control packets. The redundant control packet consumes the bandwidth of the wireless medium and significantly reduces the average throughput and consequently reduces the overall system performance. In this paper I study the optimization problem in Wireless Mesh Networks. We have proposed a novel approach to reduce the broadcast redundant packet in the wireless mesh network. Also we have shown, a novel procedure to forward the control packet to the destination nodes and efficiently minimize the transmitted control packet in the wireless mesh cloud , that covers the domain.

Wireless Mesh Networks (WMNs) consist of a high-density of hundreds to thousands of mesh routers (MRs) deployed in corporate offices and university campuses. The main purpose of this deployment is to meet user demands for high bandwidth, mobility, and reliability. However, our recent consideration of such networks revealed that they are rarely used at their peak capacity besides the fact that the entire MRS remains active continuously. Thus, during lower traffic periods the energy consumption is the same as in busy hours, while it would be possible to save a large amount of power. Green networking has recently been proposed; consist of rethink how networks are constructed and operated so that not only the cost and performance are taken into consideration but also their energy consumption and carbon footprint. In this paper, we draw attention that a large part of idle MRs results in considerable energy losses. Thousands of WMNs worldwide jointly aggravate this problem, while raising serious worry about the energy wastage that will happen in the future. In response to this problem, we first propose an optimal approach called Optimal Energy Efficiency Management Design (OEEMD) by formulating the problem as a Mixed Integer Linear Program (MILP) model to investigate the power consumption in WMN. As this problem is known to be NP-hard, we then propose an efficient heuristic algorithm called Green Energy Efficiency Management Design (GEEMD) for wireless mesh networks. GEEMD uses a sleep mechanism to power on/off underutilized MRs, based on the traffic load and solar energy generation. For the performance evaluation, we used OEEMD and GEEMD to study the performance of WMN deployment scenario in the university and campus area of Tlemcen city in Algeria over dynamic traffic profiles. Illustrative numerical examples show that, with suitable design parameters, we can efficiently reduce energy consumption in WMN without significantly impacting the network performance.

Cognitive Radio (CR) technology constitutes a promising approach to increase the capacity of Wireless Mesh Networks (WMNs). Using this technology, Mesh Routers (MRs) and the attached Mesh Clients (MCs) are allowed to opportunis- tically transmit on the licensed band, but under the constraint not to interfere with the Primary Users (PUs) of the spectrum. Thus, the effective deployment of CR- WMNs require that each MR must be able to: sense the current spectrum, select an available PU-free channel and perform the spectrum handoff to a new channel in case of PU arrival on the current one. How to coordinate these actions in the optimal way which maximizes the performance of the CR-WMNs while minimizing the interference to the PUs constitutes an open research issue in CR systems. In this paper, we propose an adaptive spectrum scheduling and allocation scheme which allows a MR to identify the best schedule of (i) when to sense the current channel, (ii) when to transmit, (iii) when to perform a spectrum handoff. Due the large number of parameters involved, we propose Reinforcement Learning (RL) techniques to allow a MR to learn by itself the optimal balance between spectrum sensing-exploitation- exploration actions based on network feedbacks coming from the MCs. We perform extensive simulations which confirm the adaptivity and efficiency of our approach in terms of increased throughput when compared with non-learning based schemes for CR-WMNs.

Resource allocation and admission control algorithm based on non-cooperation game in wireless mesh networks

The popularity and the constant improvement of wireless technologies, such as WiFi and WiMAX, have been increasing the usage and applicability of new networking schemes, including Wireless Mesh Networks (WMNs). WMNs are multi-hop wireless networks made by a collection of two types of nodes, mesh routers and mesh clients. Their self-organizing, self-configuring and self-healing proprieties, in conjunction with their low maintenance and implementation costs, make them especially appealing as a solution for Internet access and social networking. The characteristics of WMNs make them more susceptible to malicious attacks than traditional wired networks, namely the scarce bandwidth, the high level of interference, the shared transmission media and the limited physical security. Secure routing and forwarding schemes are a key component to guarantee secure communications in hostile environments. There are however issues that must be considered when developing secure routing and forwarding solutions, namely the overhead introduced by such approaches and the effectiveness of the prediction schemes used. This paper discusses the main solutions for routing security in WMNs and presents a thorough evaluation, comprising a novel way to characterize the effectiveness of such approaches. The evaluation is based on CONFIDANT, a secure routing protocol based on the DSR protocol. The study performed addresses both the issues aforementioned and provides insight on the trade-offs associated with the deployment of secure routing and forwarding mechanisms.

Wireless Mesh Networks (WMNs) integrate the advantages of WLANs and mobile Ad Hoc networks, which have become the key techniques of next-generation wireless networks in the context of emergency recovery. Wireless Mesh Networks (WMNs) are multi-hop wireless networks with instant deployment, self-healing, self-organization and self-configuration features. These capabilities make WMNs a promising technology for incident and emergency communication. An incident area network (IAN) needs a reliable and lively routing path during disaster recovery and emergency response operations when infrastructure-based communications and power resources have been destroyed and no routes are available. Power aware routing plays a significant role in WMNs, in order to provide continuous efficient emergency services. The existing power aware routing algorithms used in wireless networks cannot fully fit the characteristics of WMNs, to be used for emergency recovery. This paper proposes a power aware routing algorithm (PARA) for WMNs, which selects optimal paths to send packets, mainly based on the power level of next node along the path. This algorithm was implemented and tested in a proven simulator. The analytic results show that the proposed power node-type aware routing algorithm metric can clearly improve the network performance by reducing the network overheads and maintaining a high delivery ratio with low latency.

Wireless mesh network is a network implemented over a wireless local area network (LAN), and its infrastructure type is decentralized, relatively inexpensive, reliable, and resilient since the wireless routers are often static and not powered by batteries. In addition, the access points (routers) seldom change their positions in wireless mesh networks, and some wireless nodes have gateway functions to provide the connectivity to the Internet. Therefore, such networks behave almost like wired networks with infrequent topology changes and limited node failures. Due to these good properties and potential applications such as providing commercial Internet access to residents and local businesses, wireless mesh networks have drawn a lot of attention in recent years. For example, wireless mesh networks are being used as the last mile for extending the Internet connectivity for mobile nodes. In addition, some commercial deployments of multihop wireless meshes are already in the works. For instance, a number of mesh networks have been deployed in some cities of the United States, including Medford, Oregon, and cities in Minnesota [4]. Unlike traditional wired network, close-by mesh routers share certain wireless channels and the capacity of wireless mesh network will be increased tremendously when extending from a single channel model to a multiradio, multichannel, multihop model. For example, if two nodes vi and v j could communicate with each other by channel f1, and both nodes have at least one more available network interface cards, which could operate on another channel f2, if f2 is also available for both nodes, vi and v j could use both f1 and f2 to communicate simultaneously. When such cases are applied to more wireless nodes, the throughput of a wireless network will be increased tremendously.

The ‘Wireless Mesh Networks (WMNs)' is utilized to enhance the networking services and internet access in metropolitan regions, campuses, local and personal. The ‘Mesh Routers (MR)' creates the connectivity backbone while performing multiple packet transmission tasks along with providing network ingress to the mesh users. This issue can be minimized by incorporating cognitive radio that focuses on inventing the spectrum management and sensing mechanisms. Hence, there is a demand to implement a framework for the ‘optimal Dynamic Spectrum Access' (DSA) in WMN beside with cognitive thoughts. In this paper, the optimization techniques are utilized to exploit the spectral and energy effectiveness of DSA in WMN. So, a novel hybrid approach, called the Iteration-based Position of Fire Hawk and Coyote Optimization (IPFHCO) is developed in this work. The developed hybrid model, IPFHCO can effectively maximize the energy and spectral efficacy in the WMN system than the other conventional approaches while performing several analyses. The simulation outcomes shows that the spectral efficiency of the offered DSA system in WMN is enhanced by 37.5% than the DHOA, 62.5% than the Jaya, 16.66% than the FHO, and 45.83% than the COA, while taking the transmission power value as 25 bps\\Hz.

Nowadays there are inexpensive WiFi devices that have fostered the deployment of wireless communities. Well known routing protocols used in the Internet do not fit well to time varying characteristic of wireless networks. This has motivated an intensive research on routing protocols for wireless mesh networks. At this time there are a number of mature and stable implementations that are being deployed in production networks. In this paper we focus on the experimental evaluation of a production Wireless Mesh network being deployed in a testbed at Universitat Politecnica de Catalunya (UPC) and a quarter of the city of Barcelona, Spain. To our best knowledge, this is the first paper where a production community wireless network using 802.11an is analyzed.

An infrastructure wireless mesh network (WMN) is a hierarchical network consisting of mesh clients, mesh routers and gateways. Mesh routers constitute a wireless mesh backbone, to which mesh clients are connected as a star topology, and gateways are chosen among mesh routers providing Internet access. In this paper, the throughput capacity of infrastructure WMNs is studied. For such a network with Nc randomly distributed mesh clients, Nr regularly placed mesh routers and Ng gateways, assuming that each mesh router can transmit at W bits/s, the per-client throughput capacity has been derived as a function of Nc , Nr , Ng and W . The result illustrates that, in order to achieve high capacity performance, the number of mesh routers and the number of gateways must be properly chosen. It also reveals that an infrastructure WMN can achieve the same asymptotic throughput capacity as that of a hybrid ad hoc network by choosing only a small number of mesh routers as gateways. This property makes WMNs a very promising solution for future wireless networking.