End to end delay distribution analysis and interference aware high throughput for Wireless Mesh Networks

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.

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

Wireless mesh networks are popular due to their adaptability, easy-setup, flexibility, cost, and transmission time-reductions. The routing algorithm plays a vital role in transferring the data between the nodes. The network’s performance is significantly impacted by the route opted by the algorithm. The router takes the decision to send the packet to the next router as per the policy of that algorithm. So even though that decision does not favor the right path selection, the router tends to follow its policy. This can be avoided by having intelligent routers that can make routing decisions on the fly. This paper presents the QL-Feed Forward routing algorithm (QFFR), a new generation of routing algorithms that combines reinforcement learning based on the Q-learning algorithm with a Feed Forward neural network. This algorithm (QFFR) can learn from the network environment and make routing decisions based on the algorithm’s learnings. The AI agent’s ability to select the fastest path, which enhances the efficiency of the routing operation, is demonstrated by the working of the suggested QFFR algorithm. This paper also evaluates the performance of traditional algorithms, namely, Ad-hoc On-Demand Distance-Vector, Optimized-Link-State-routing, Destination-Sequenced Distance-Vector and Distance Source routing. The evaluation parameters include throughput, packet delivery ratio, and delay. The parameters are the outcomes of the time the information takes to reach from source to destination. This analysis highlights the improvement in the routing decision ability of a router. As per analysis, Ad hoc On-Demand Distance Vector Algorithm outperforms with throughput 723.13 Kbps, delay 343.73 ns. Q-learning agent identifies the route and reaches the destination in average of 3.7s in non-grid architecture. The Q-learning agent takes 0.49sec with a grid size ten by ten and 0.53sec in three by four grid size. The suggested QFFR takes 7.62s score-over time with stable, consistent performance.

Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. Wireless mesh network which engages broadcasting and contains multiple hops become increasingly vulnerable to problems such as routing problem and rapid increasing of overhead packets. During this progress, the delay on account of multi hop characteristics and redundant packets caused by communication nature potentially existed during communication. Typically, delay will increase in linearity with number of hops. There is a certain minimum level of delay that will be experienced due to the time it takes to transmit a packet through a link. Topology development holds a significant point prior to the data transmission. Without improved topology development protocol, this problem can decrease network’s performance in overall data transmission. We analyze the delay performance of a multi-hop wireless network with a dynamic route between each source and final destination pair. There are fluctuate interference constraints on the set of links that impose a fundamental delay performance of any instant network topology. At first, we present a similar Link State Routing network simulation to derive such referential lower bounds. We conduct extensive simulation studies to suggest that the average delay of multi-hop transmission policy can be made lower compared to the referential bound by using appropriate functions of network metrics. This paper provides a broadcast framework that engages various network metrics and at the same time maintaining connectivity of nodes (mobile terminals). The framework captures the essential features of the wireless network metrics, i.e. bandwidth, throughput, network buffer, direction, and round trip time. This research is useful since, in many cases, it find that the throughput is the most important parameter in reduction of delay transmission. This result is confirmed with another composite simulation result. Most of network hop delay is impacted with this composite metric, particularly in delay minimization on the longer hops. The reduction achievement on average delay by this algorithm is 0.577% and the total average delay reduction for this simulated network is 0.683%. This research will be further designed primarily for achieving maximum throughput in the multiple wireless network area.

An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point.A Mobile Ad hoc NETwork called MANET is a kind of wireless ad-hoc network that is a self configuring network of mobile routers.These mobile routers are connected by wireless links.In MANET there are various routing protocols available.DSR, AODV and DSDV are most popular.Our proposed works are related to examine routing protocol for mobile ad hoc networks -the Destination Sequenced Distance Vector (DSDV) and On Demand protocol that evaluates both protocols based on the packet delivery fraction and average delay while varying number of sources and pause time.In this Improved -DSDV approach we can overcome the problem of state routes, as well as improve the performance of regular DSDV.We compare the performance of our work with DSDV.In our improved DSDV routing protocol, nodes can cooperate together to obtain an objective opinion about another nodes trustworthiness.

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorithms are proposed in this work with a discussion on the difference between them. These algorithms find the shortest route through finding the optimal rate between two nodes in the wireless networks but with bounded end-to-end delay. The Dijkstra-based algorithm is especially favorable in terms of processing time. We also present a comparison between our proposed single-constraint Dijkstra-based routing algorithm and the mesh routing algorithm (MRA) existing in the literature to clarify the merits of the former.

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.

The wireless mesh networks (WMNs) have become one of the popular technologies of the wireless network utilization. WMN provides reliable and scalable wireless network because of its features such as dynamic self-organizing, self-configuring, Self-managing and self-healing. Routing protocols play an essential role in finding and establishing an active route from a source to a destination in WMNs. This article focuses on the performance evaluation and comparison of some routing protocols commonly used in WMNs for VoIP application: AODV, DSR, OLSR and TORA has been investigated over client Wireless Mesh Networks based on OPNET simulation in a different network sizes and mobility. This article presents a background of some designs and solutions based on an elaborated simulation investigation. The performance comparisons are carried out with regard to the node variation in network sizing and mobility. Based on the empirical outputs, the authors suggested that to utilize a specific routing protocol in certain situations.

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.

Wireless Mesh Network (WMN) is emerging concept in wireless networks supporting broadband and high speed multimedia services, so network must guaranteed the Quality-of-Services (QoS). Wireless mesh network characterized by multihop wireless connectivity and frequently changing network topology therefore required efficient and optimal dynamic routing protocols with node authentication for preventing data form networking attacks. AODV is commonly used routing matrix for path discovery in Ad-hoc network. So that, implementing in wireless mesh network, AODV should improve for find optimal shortest path. In this paper, the QoS aware improved AODV routing protocol in wireless mesh network with the node authentication schemas has been discussed.

Intrusion Detection Systems(IDSs) are widely used to detect both known attacks and unknown attacks performed by internal and external attackers in wireless networks. However, challenging issues for developing IDSs in Wireless Mesh Networks (WMNs) are 1) supporting interoperability and 2) handling volatile parameters. In addition, security standards for WMN are still in draft stage, and to protect the WMN, IDSs of similar wireless networks such as wireless sensor, Ad-Hoc, MANET can be adopted, but the best performance is not guaranteed. In this paper, we have classified the existing IDSs for wireless networks into four categories namely single layer IDS, cross-layer IDS, reputation-based IDS, reputation based cross-layer IDS, and analyzed the performance of these IDSs with core-layer attacks and detection methodology. Based on our analysis, we address the loopholes in existing IDSs and specify research directions for strengthening the existing IDSs and for developing new efficient IDSs with respect to backbone mesh and client mesh networks.

Chapter 11 - Wireless Network Security

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.

Mobile Ad hoc Network (MANET) is a kind of wireless ad-hoc network, and is a self-configuring network of mobile routers (and associated hosts) connected by wireless links - the union of which forms an arbitrary topology. The routers are free to move randomly and organize themselves arbitrarily, thus the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion, or may be connected to the larger Internet. There are various routing protocols available for MANETs. The most popular ones are DSR, AODV and DSDV. This paper examines two routing protocols for mobile ad hoc networks- the Destination Sequenced Distance Vector (DSDV and the Ad hoc On- Demand Distance Vector routing (AODV). Generally, the routing algorithms can be classified into Reactive and Proactive. A Hybrid algorithm combines the basic properties of reactive and proactive into one. The proposed approach is a novel routing pattern based on Ant Colony Optimization and Multi Agent System. This pattern integrates two different algorithms together and helps to get optimum routes for a particular radio range. The approaches used here are Ant Colony Optimization (ACO) and Multi Agent System (MAS). The proposed integrated approach has a relatively short route establishment time while using a small number of control messages which makes it a scalable routing approach. The overhead of this routing approach will be inexpensive and also will enable to have an alternate route during route failure. This proposed route finding scheme in order to provide high connectivity of nodes, will minimize the route discovery latency and the end-to-end delay.

Static wireless multi-hop networks, such as wireless mesh networks and wireless sensor networks have proliferated in recent years because of they are easy to deploy and have low installation cost. Two key measures are used to evaluate the performance of a multicast tree algorithm or protocol : end-to-end delay and the number of transmissions. End-to-end delay is the most important measure in terms of QoS because it affects the total throughput in wireless networks. Delay is similar to the hop count or path length from the source to each destination and is directly related to packet success ratio. In wireless networks, each node uses the air medium to transmit data, and thus, bandwidth consumption is related to the number of transmission nodes. A network has many transmitting nodes, which will cause many collisions and queues because of congestion. In this paper, we optimize two metrics through a guaranteed delay scheme. We provide an integer linear programming formulation to minimize the number of transmissions with a guaranteed hop count and preprocessing to solve the aforementioned problem. We extend this scheme not only with the guaranteed minimum hop count, but also with one or more guaranteed delay bounds to compromise two key metrics. We also provide an explanation of the proposed heuristic algorithm and show its performance and results.