A distributed admission control scheme for Wireless Mesh Networks

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

The wireless mesh network is a new emerging technology that will change the world of industrial networks connectivity to more efficient and profitable. Mesh networks consist of static wireless nodes and mobile customer; have emerged as a key technology fornew generation networks. The Quality of Service (QOS) is designed to promote and support multimedia applications (audio and video), real time. However guarantee of QoS on wireless networks is a difficult problem by comparison at its deployment in a wired IP network. In this paper, we present an efficient routing protocol named as “QoS- Cluster Based Routing Protocol” (Q-CBRP) to support QoS in Wireless Mesh Network.

The wireless mesh network is a new emerging technology that will change the world of industrial networks connectivity to more efficient and profitable. Mesh networks consist of static wireless nodes and mobile customer; have emerged as a key technology for new generation networks. The Quality of Service (QOS) is designed to promote and support multimedia applications (audio and video), real time. However guarantee of QoS on wireless networks is a difficult problem by comparison at its deployment in a wired IP network. In this paper, we present an efficient routing protocol named as “QoS-Cluster Based Routing Protocol” (Q-CBRP) to support QoS in Wireless Mesh Network.

Due to recent advances in wireless technologies, wireless mesh networks (WMNs) are expected in the near future to fully handle content-rich multimedia services with various quality of services (QoS) guarantee. Unlike traditional data applications, multimedia applications require QoS support in order to satisfy the user's service requirements. Admission control has been advocated as a promising approach to tackle this challenging issue since it is a key management function for which a new flow is admitted based on the condition that the QoS requirements of all flows in the network can still be met after the new flow begins. In this paper, a Rate Adaptive Routing on Cliques Admission Control protocol (so-called RA-RCAC) for WMNs is proposed, which is able to provide feedbacks to the application layer whenever congestion occurs in the network. The RA-RCAC scheme merges the design features of two chosen benchmarking schemes, namely, an Interference-Aware Admission Control and QoS routing protocol in WMN (so-called IAAC) and a distributed admission control protocol for WMNs (so-called RCAC) to produce a protocol design that satisfies the QoS guarantee. Our proposed RA-RCAC protocol is evaluated using simulation analysis. The performance evaluation results demonstrate its superiority over the aforementioned benchmark schemes in terms of throughput, end-to-end delay, packet delivery ratio, and loss ratio performance evaluation metrics.

While more and more real-time applications are expected in wireless mesh networks (WMNs), Quality of Service (QoS) provision is of foremost importance in order to support such real-time applications. In this paper, we proposed QRBC (QoS Routing protocol with Bandwidth Consideration), a protocol using a bandwidth guaranteed routing metric towards enhancing QoS support for the real-time applications in WMNs. The routing metric accurately reflects the available bandwidth of a route with the consideration of the interference caused by the hidden terminals in WMNs. During the route discovery process of QRBC, the routing metric is updated and used with the cooperation of admission control decision to find a bandwidth guaranteed routing path. Simulation results demonstrate that QRBC can find a less interfering and bandwidth guaranteed routing path for real-time applications by avoiding “hot-spots” with severe interference, which enhances the performance of such applications significantly.

Wireless Mesh Networks (WMNs) provide a novel network architecture to extend broadband network coverage with low costs. Additionally, we see an increased interest in supporting demanding multimedia applications in next-generation wireless mesh networks. Provision of Quality of Service (QoS) in wireless mesh networks requires end-to-end support for routing packets via a suitable multihop route to the destination. However, in wireless mesh networks, if the medium access control layer does not support mechanisms for QoS support at a per-link level, all efforts for providing end-to-end QoS are futile. Hence, we see a trend towards standards for wireless mesh networks which support QoS at the Medium Access Control (MAC) level on a per-link basis.

In this paper, we design an efficient scheduler for Mesh Deterministic Access (MDA) in IEEE 802.11s-based Wireless Mesh Networks (WMNs), called Enhanced Differentiated MDA (ED-MDA). ED-MDA is combined with an Efficient Admission Control algorithm, called EAC, that guarantees QoS for different service classes and provides higher capacity in WMNs. EAC processes both new and HandOver (HO) calls to maintain a balance between two conflicting requirements: maximizing the resource utilization and minimizing the dropping rate. To establish priority between new and HO calls, especially to avoid the forced termination of an ongoing call, ED-MDA coupled with EAC reserves the minimum amount of necessary resources while maintaining an acceptable HO call dropping rate and high resource utilization. Particularly, our model provides an efficient adaptive adjustment of the Contention Free Period (CFP) duration to make efficient use of the scarce wireless resources while supporting different services with different QoS requirements, such as delay. Simulations show that ED-MDA together with EAC outperforms existing schemes.KeywordsWireless mesh networksmuti-servicesadmission controlmedium access control and quality of service

Admission control plays a very important role in guaranteeing the quality-of-service (QoS) in wireless mesh networks (WMNs). In this paper, based on the channel and hidden terminal information, we first estimate the available bandwidth in the operation of medium access control (MAC). We then design an admission control algorithm (ACA) at the MAC layer to address the QoS issue for real-time and nonreal-time traffic. For real-time traffic, all nodes on a route make an admission control decision based on the estimated available bandwidth. For the nonreal-time traffic, a rate adaptation algorithm is proposed to adjust the sending rates of sources to prevent the network from entering the congestion state. Finally, through extensive simulations, we demonstrate the effectiveness of our algorithm.

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.

This work presents an admission control mechanism for multi-hop wireless mesh networks based on the IEEE 802.11e standard and the OLSR routing protocol. This mechanism, called CAC-OLSR, aims at ensuring that traffic flows with quality of service (QoS) requirements are only admitted in the mesh network if it has available resources in order to provide flow requirements. In addition, QoS requirements of previously admitted traffic flows cannot be violated. The proposal was evaluated with NS-2 simulations.

It has been shown that power control is an efficient approacn to achieve me quality of service (QoS) requirement in wireless networks. In this letter, we present a utility function that denotes the QoS and energy efficiency of each wireless terminal. We propose a framework of power control based on the game theory for the QoS of wireless mesh networks (WMNs). In this framework, all players do their best to maximize their own utility. Furthermore, we present a Nash Equilibrium (NE) point of the power control game. We prove that the equilibrium is inefficient, and we propose a distributed power control algorithm that improves the total utility with respect to the NE point. Finally, the proposed framework is evaluated by a numerical experiment, the results of which show the rationality of our system model and the efficiency of our power control algorithm.

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.

Joint admission and power control for quality-of-service in the wireless downlink

Establishing quality of service (QoS) provisions in multirate multihop wireless mesh networks (WMNs) is a challenging task. Locating effective admission control is the foremost need to efficiently utilise the scarce network resources and provide QoS guarantees. In this paper, we propose an Estqos methodology comprising two phases. Phase 1 (ESTAB) computes the available bandwidth of a node considering the hidden terminals' presence. We build an analytical model for ESTAB phase. Phase 2 (ADMISSIONCONTROL) consists of an effective admission control algorithm which defines a data rate adaptive scheme for non realtime flows to ensure efficient use of the channel bandwidth. On the other hand in case of realtime flows, the admission control algorithm ensures that the channel is not overloaded and the delay constraint is satisfied.

The usage of voice over IP (VoIP) traffic in IEEE 802.11 wireless networks is expected to increase in the near future due to widely deployed 802.11 wireless networks and VoIP services on fixed lines. However, the quality of service (QoS) of VoIP traffic in wireless networks is still unsatisfactory. In this thesis, I identify several sources for the QoS problems of VoIP traffic in IEEE 802.11 wireless networks and propose solutions for these problems. The QoS problems discussed can be divided into three categories, namely, user mobility, VoIP capacity, and call admission control. User mobility causes network disruptions during handoffs. In order to reduce the handoff time between Access Points (APs), I propose a new handoff algorithm, Selective Scanning and Caching, which finds available APs by scanning a minimum number of channels and furthermore allows clients to perform handoffs without scanning, by caching AP information. I also describe a new architecture for the client and server side for seamless IP layer handoffs, which are caused when mobile clients change the subnet due to layer 2 handoffs. I also present two methods to improve VoIP capacity for 802.11 networks, Adaptive Priority Control (APC) and Dynamic Point Coordination Function (DPCF). APC is a new packet scheduling algorithm at the AP and improves the capacity by balancing the uplink and downlink delay of VoIP traffic, and DPCF uses a polling based protocol and minimizes the bandwidth wasted from unnecessary polling, using a dynamic polling list. Additionally, I estimated the capacity for VoIP traffic in IEEE 802.11 wireless networks via theoretical analysis, simulations, and experiments in a wireless test-bed and show how to avoid mistakes in the measurements and comparisons. Finally, to protect the QoS for existing VoIP calls while maximizing the channel utilization, I propose a novel admission control algorithm called QP-CAT (Queue size Prediction using Computation of Additional Transmission), which accurately predicts the impact of new voice calls by virtually transmitting virtual new VoIP traffic.