A nonpreemptive priority-based access control scheme for broadbandad hoc wireless ATM local area networks

The DQRUMA (distributed-queueing request update multiple access) protocol has been considered as an access protocol for the BAHAMA (broadband ad hoc wireless ATM local area network). However, it cannot support the service discipline of integrated multimedia traffic since it does not include any priority and access control policy. In this paper, we propose a nonpreemptive priority-based access control scheme for the DQRUMA protocol. Under such a scheme, modifying the CSMA/CA protocol in the contention period supports many levels of priorities such that user mobility (handoff) can be supported in BAHAMA. Besides, the proposed transmit-permission policy and adaptive bandwidth allocation scheme provide various QoS (quality-of-service) guarantees while maintaining high bandwidth utilization. Simulations show that it provides a good performance in ad hoc wireless ATM LAN environments     

Distributed Flow Admission Control for Multimedia Services Over Wireless Ad Hoc Networks

In this paper we propose a novel Priority-based Distributed flow Admission Control (PDAC) protocol to provide Quality of Service (QoS) to multimedia applications over the Dynamic Source Routing (DSR) protocol-based wireless ad hoc networks. In contrast to short-term packet forwarding, medium and long-term multimedia and real-time traffic may benefit from ‘flow’-based transmission due to the reduction in the packet-level control overhead. In this paper, we introduce a new DSR option called the “Admission Control Option” for flow establishment, and present a new scalable transmission rate reservation protocol to support bandwidth-constrained traffic flows in interference-limited wireless ad hoc networks. It allows a node in the wireless ad hoc network to establish or discard a traffic flow state based on the global knowledge of traffic flow priority, and local knowledge in the form of interference and effective transmission rate. The PDAC scheme can also operate in a ‘cross-layer’ protocol architecture that encompasses the network layer and the MAC layer.     

Self-regulating network utilization in mobile ad hoc wireless networks

In mobile ad hoc wireless LANs, it is very difficult to maintain a targeted network utilization due to the time-varying nature of the contention-based medium access control protocol and the lack of a central control. Furthermore, previous research has been mainly focusing on the aspect of optimizing the performance at each station. But doing so may result in a very low overall network utilization. Therefore, self-regulating network utilization is very important to provide quality-of-service (QoS) in mobile ad hoc wireless networks. Through self-disciplining its own behaviors locally, each station will optimize its protocol parameters to meet the targeted overall network utilization, which is very important for QoS provisioning to multimedia services. This paper proposes and evaluates a fully distributed scheme for each station to self-regulate its behaviors through adapting the local protocol parameters to meet the targeted overall network utilization with the changes in the network environment such as the number of stations and channel quality.     

A hexagonal-tree TDMA-based QoS multicasting protocol for wireless mobile ad hoc networks

The mobile multimedia applications have recently generated much interest in wireless ad hoc networks with supporting the quality-of-service (QoS) communications. The QoS metric considered in this work is the reserved bandwidth, i.e., the time slot reservation. We approach this problem by assuming a common channel shared by all hosts under a TDMA (Time Division Multiple Access) channel model. In this paper, we propose a new TDMA-based QoS multicast routing protocol, namely hexagonal-tree QoS multicast protocol, for a wireless mobile ad hoc network. Existing QoS routing solutions have addressed this problem by assuming a stronger multi-antenna model or a less-strong CDMA-over-TDMA channel model. While more practical and less costly, using a TDMA model needs to face the challenge of radio interference problems. The simpler TDMA model offers the power-saving nature. In this paper, we propose a new multicast tree structure, namely a hexagonal-tree, to serve as the QoS multicasting tree, where the MAC sub-layer adopts the TDMA channel model. In this work, both the hidden-terminal and exposed-terminal problems are taken into consideration to possibly exploit the time-slot reuse capability. The hexagonal-based scheme offers a higher success rate for constructing the QoS multicast tree due to the use of the hexagonal-tree. A hexagonal-tree is a tree whose sub-path is a hexagonal-path. A hexagonal-path is a special two-path structure. This greatly improves the success rate by means of multi-path routing. Performance analysis results are discussed to demonstrate the achievement of efficient QoS multicasting.     

Quality-of-service in ad hoc carrier sense multiple access wirelessnetworks

Carrier sense multiple access (CSMA) is one of the most pervasive medium access control (MAC) schemes in ad hoc, wireless networks. However, CSMA and its current variants do not provide quality-of-service (QoS) guarantees for real-time traffic support. This paper presents and studies black-burst (BB) contention, which is a distributed MAC scheme that provides QoS real-time access to ad hoc CSMA wireless networks. With this scheme, real-time nodes contend for access to the channel with pulses of energy-so called BBs-the durations of which are a function of the delay incurred by the nodes until the channel became idle. It is shown that real-time packets are not subject to collisions and that they have access priority over data packets. When operated in an ad hoc wireless LAN, BB contention further guarantees bounded and typically very small real-time delays. The performance of the network can approach that attained under ideal time division multiplexing (TDM) via a distributed algorithm that groups real-time packet transmissions into chains. A general analysis of BB contention is given, contemplating several modes of operation. The analysis provides conditions for the scheme to be stable. Its results are complemented with simulations that evaluate the performance of an ad hoc wireless LAN with a mixed population of data and real-time nodes     

Wireless ATM LAN with and without infrastructure

We consider wireless ATM concepts for small LANs, especially for SOHO and future consumer applications. We describe a wireless ATM LAN framework architecture that supports wireless ATM communications in environments with and without fixed ATM infrastructure. For the configuration with an ATM infrastructure, a distributed ATM switched backbone is proposed, which enables a smart ATM switching element to be embedded in every wireless and fixed access point. For bandwidth efficiency and ease of operation (place-and-play), we also propose an ad hoc wireless ATM LAN concept based on the same 5 GHz wireless ATM air interface as is currently under standardization in the ETSI/BRAN and ATM Forum. Unlike CSMA-based ad hoc systems such as HIPERLAN and IEEE802.11, our ad hoc wireless ATM system makes QoS management feasible in an infrastructureless environment by using resource reservation and scheduled medium access protocol. Since cost scalability is essential throughout our system design, we consider forwarding between ad hoc subnets and interworking with the fixed network as important but optional features     

A Dynamic Alternate Path QoS Enabled Routing Scheme in Mobile Ad hoc Networks

A mobile ad hoc network (MANET) is a collection of self-organized mobile nodes that are capable of communicating with each other without the aid of any established infrastructure or centralized administration. Routing algorithm has been a challenge task in the wireless ad hoc network for a long time due to the dynamic nature of network topology. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. The on-demand routing protocol for ad hoc network is appealing because of its low routing overhead and its effectiveness when the frequency of route re-establishment and the demand of route queries are not high. However, considering the increasing demand of Quality-of-Service (QoS) requirements in many applications, the current on-demand routing protocols used for ad-hoc network should be adapted appropriately to effectively meet the stringent QoS requirements of specific multimedia traffic. We thus propose a routing protocol which tries its best to satisfy QoS requirements of specific multimedia traffic in the volatile environments of a MANET. The results of a series of simulations exhibit the practicability and feasibility of our approaches. This research was partially supported by National Science Council under grant NSC 93-2213-E-026-001     

移动自组网QoS路由协议研究

移动自组网是由一组带有无线收发装置的移动节点组成的一个多跳的临时性的自治系统。随着无线通信中多媒体业务的增加,在移动自组网中提供QoS(Quality of Sevice服务质量)保障具有越来越重要的意义,而QoS路由技术则是其中的核心技术和热点问题。文章指出移动自组网QoS路由的困难,对移动自组网典型QoS路由协议进行了详细的分析与比较,并对几种较新的移动自组网QoS路由协议进行了介绍,末了对移动自组网QoS路由协议的发展进行了展望。     

Delay constraint multipath routing for wireless multimedia ad hoc networks

According to the disadvantages of real time and continuity for multimedia services in ad hoc networks, a delay constraint multipath routing protocol for wireless multimedia ad hoc networks, which can satisfy quality of service (QoS) requirement (QoS multipath optimized link state routing [MOLSR]), is proposed. The protocol firstly detects and analyzes the link delay among the nodes and collects the delay information as the routing metric by HELLO message and topology control message. Then, through using the improved multipath Dijkstra algorithm for path selection, the protocol can gain the minimum delay path from the source node to the other nodes. Finally, when the route is launched, several node‐disjoint or link‐disjoint multipaths will be built through the route computation. The simulation and test results show that QoS‐MOLSR is suitable for large and dense networks with heavy traffic. It can improve the real time and reliability for multimedia transmission in wireless multimedia ad hoc networks. The average end‐to‐end delay of QoS‐MOLSR is four times less than the optimized link state routing. Copyright © 2014 John Wiley & Sons, Ltd.     

On Throughput Guarantee of Aloha-Like Multi-Hop Wireless Networks

Providing Quality of Service (QoS) is one of significant issues for multimedia traffic. One approach to achieve the requested QoS is to characterize the traffic flows and guarantee their committed throughput. In a typical multi-hop wireless ad hoc network, determining the feasibility for a given set of flow characteristics is challenging due to the multi-user interference problem. To that end, this paper presents the following contributions. First, we describe a simple Aloha-like Medium Access Control (MAC) protocol that enables each flow to maintain its requested bandwidth, and thus is suitable for multimedia traffic. Second, we propose a bandwidth feasibility algorithm based on the Variable Elimination (VE) technique. The bandwidth feasibility algorithm determines whether or not a given network can support a set of flows of certain bit rates. Simulations indicate that our solution can precisely control the bit rates over all hosts while providing the throughput guarantees.     

On-demand SIR and bandwidth-guaranteed routing with transmit power assignment in ad hoc mobile networks

In this paper, we propose a novel on-demand quality-of-service (QoS) routing protocol, SBR [signal-to-interference (SIR) and bandwidth routing], which explicitly fulfills both SIR and bandwidth requirements from different multimedia users in ad hoc mobile networks. With SBR, bandwidth reservation is made by allocating time slots and SIR reservation is ensured by assigning adequate powers at the intermediate nodes between a source and a destination. The power-assignment method used in SBR supports finding routes that satisfy the SIR requirements as well as reduces the level of prevailing interference that necessarily occurs in multiple-access wireless networks. SBR also has a new backup capability of establishing multiple paths, even for a single connection, when the route search cannot find a single path that supports the QoS requirements, which contributes to reducing the probability of call denials in constructing the route due to a lack of suitable paths. Extensive simulations show that SBR significantly reduces the ratio of unsuccessful calls with modest routing overhead.     

A bandwidth allocation/sharing/extension protocol for multimediaover IEEE 802.11 ad hoc wireless LANs

We propose a novel bandwidth allocation/sharing/extension (DBASE) protocol to support both asynchronous traffic and multimedia traffic with the characteristics of variable bit rate (VBR) and constant bit rate (CBR) over IEEE 802.11 ad hoc wireless local area networks. The overall quality of service (QoS) will be guaranteed by DBASE. The designed DBASE protocol will reserve bandwidth for real-time stations based on a fair and efficient allocation. Besides, the proposed DBASE is still compliant with the IEEE 802.11 standard. The performance of DBASE is evaluated by analysis and simulations. Simulations show that the DBASE is able to provide almost 90% channel utilization and low packet loss due to delay expiry for real-time multimedia services     

Dynamic bandwidth management in IEEE 802.11-based multihop wireless networks

In this paper, we propose a new protocol named dynamic regulation of best-effort traffic (DRBT) which supports quality of service (QoS) throughput guarantees and provides a distributed regulation mechanism for best-effort traffic in multihop wireless networks. By adapting dynamically the rate of best-effort traffic at the link layer, DRBT increases the acceptance ratio of QoS flows and provides a good use of the remaining resources through the network. Our protocol also provides an accurate method to evaluate the available bandwidth in IEEE 802.11-based ad hoc networks which is able to differentiate QoS applications from best-effort traffic. Through extensive simulations, we compare the performance of our proposal scheme with some others protocols like QoS protocol for ad hoc real-time traffic for instance.     

A QoS Routing Protocol with Bandwidth Allocation in Multichannel Ad Hoc Networks

Mobile multimedia applications have recently generated much interest in mobile ad hoc networks (MANETs) supporting quality-of-service (QoS) communications. Multiple non-interfering channels are available in 802.11 and 802.15 based wireless networks. Capacity of such channels can be combined to achieve higher QoS performance than for single channel networks. The capacity of MANETs can be substantially increased by equipping each network node with multiple interfaces that can operate on multiple non-overlapping channels. However, new scheduling, channel assignment, and routing protocols are required to utilize the increased bandwidth in multichannel MANETs. In this paper, we propose an on-demand routing protocol M-QoS-AODV in multichannel MANETs that incorporates a distributed channel assignment scheme and routing discovery process to support multimedia communication and to satisfy QoS bandwidth requirement. The proposed channel assignment scheme can efficiently express the channel usage and interference information within a certain range, which reduces interference and enhances channel reuse rate. This cross-layer design approach can significantly improve the performance of multichannel MANETs over existing routing algorithms. Simulation results show that the proposed M-QoS-AODV protocol can effectively increase throughput and reduce delay, as compared to AODV and M-AODV-R protocols.     

PCQoS: power controlled QoS tuning for wireless ad hoc networks

Mobile ad hoc networks typically use a common transmission power approach for the discovery of routes and the transmission of data packets. In this paper we present PCQoS; a power-controlled Quality of Service (QoS) scheme for wireless ad hoc networks which builds QoS mechanisms for specific applications that wish to tradeoff better QoS performance for sub-optimal paths. PCQoS allows selected flows to modify their transmit power as a way to add and remove relay nodes from their paths in order to coarsely modify their observed application QoS performance. We present simulation results and show that PCQoS can be used to provide coarse control over traditional QoS metrics (e.g., delay, throughput). To the best of our knowledge the PCQoS protocol represents the first attempt to use variable-range transmission control as a means to provide QoS differentiation to applications in wireless ad hoc networks.     

An enhancement to the IEEE 802.11e EDCA providing QoS guarantees

One of the challenges that must be overcome to realize the practical benefits of ad hoc networks is quality of service (QoS). However, the IEEE 802.11 standard, which undeniably is the most widespread wireless technology of choice for WLANs and ad hoc networks, does not address this issue. In order to support applications with QoS requirements, the upcoming IEEE 802.11e standard enhances the original IEEE 802.11 MAC protocol by introducing a new coordination function which has both contention-based and contention-free medium access methods. In this paper, we consider the contention-based medium access method, the EDCA, and propose an extension to it such that it can be used to provide QoS guarantees in WLANs operating in ad hoc mode. Our solution is fully distributed, uses admission control to regulate the usage of resources and gives stations with high-priority traffic streams an opportunity to reserve time for collision-free access to the medium.     

Block Reservation Time Division Multiple Access (BRTDMA) Protocol for a High Capacity Wireless Network

Next generation high capacity wireless networks need to support various types of traffic, including voice, video and data, each of which have different Quality of Service (QoS) requirements for successful transmission. This paper presents an advanced reservation packet access protocol BRTDMA (Block Reservation Time Division Multiple Access) that can accommodate voice and data traffic with equal efficiency in a wireless network. The proposed BRTDMA protocol has been designed to operate in a dynamic fashion by allocating resources according to the QoS criteria of voice and data traffic. Most of the existing reservation protocols offers reservation to voice traffic while data packets are transmitted using contention mode. In this paper we propose a block reservation technique to reserve transmission slots for data traffic for a short duration, which minimizes the speech packet loss and reduce the end-to-end delay for wireless data traffic. The optimum block reservation length for data traffic has been studied in a cellular mobile radio environment using a simulation model. Simulation results show that the BRTDMA protocol offers higher traffic capacity than standard PRMA protocol for integrated voice and data traffic and offers flexibility in accommodating multimedia traffic.     

Dynamic bandwidth management and adaptive applications for avariable bandwidth wireless environment

This article describes an approach for providing dynamic quality of service (QoS) support in a variable bandwidth network, which may include wireless links and mobile nodes. The dynamic QoS approach centers on the notion of providing QoS support at some point within a range requested by applications. To utilize dynamic QoS, applications must be capable of adapting to the level of QoS provided by the network, which may vary during the course of a connection. To demonstrate and evaluate the dynamic QoS concept, we have implemented a new protocol called dynamic resource reservation protocol (dRSVP) and a new QoS application program interface (API). The paper describes this new protocol and API and also discusses our experience with adaptive streaming video and audio applications that work with the new protocol in a testbed network, including wireless local area network connectivity and wireless link connectivity emulated over the wired Ethernet. Qualitative and quantitative assessments of the dynamic RSVP protocol are provided     

The integration of ad hoc sensor and cellular networks for multi-class data transmission

This paper targets mobile telemedicine applications that can be supported using third generation (3G) cellular networks, to provide highly flexible medical services. On the other hand, large-scale Ad hoc Sensor Networks (ASN), when deployed among mobile patients who may carry different kinds of micro-sensors to measure ECG, blood pressure, basal temperature or other physiological data, can provide a dynamic data query architecture to allow the medical specialists to monitor patients at any place. So far very little research has been conducted to explore the possibility of integrating ASN with mobile telemedicine. In this paper: 1. we suggest an integrated architecture that takes advantage of the low cost mobile sensor networks and 3G cellular networks to support multimedia medical calls with differentiated Quality-of-Service (QoS) requirements. 2. We propose a low-energy, distributed, concentric-zone-based data query mechanism that has the advantages of both proactive and reactive ad hoc routing algorithms to collect medical results from large-scale mobile patients for medical specialists who use cellular network to report patient data to the medical center. 3. In order to minimize the ambulance wireless call-dropping rate, we adopt accurate resource reservation call admission control (CAC) scheme to allocate the necessary bandwidth in the destination cell. 4. In order to meet the QoS requirements of patients’ wireless calls, we use dynamic guard channel CAC scheme to keep their handoff-call dropping rate below a certain threshold. We evaluate the validity of our schemes through simulations and analyze their performance. Our results clearly indicate the efficiency of the proposed CAC and sensor network query algorithms to meet the multimedia telemedicine QoS requirements.     

An efficient QoS routing algorithm for solving MCP in ad hoc networks

Providing guaranteed quality of service (QoS) in wireless networks is a key issue for deploying multimedia applications. To support such a QoS, an arduous problem concerning how to find a feasible end to end path to satisfy multiple QoS constraints should be studied. In general, multi-constrained path selection, with or without optimization, is an NP-complete problem that cannot be exactly solved in polynomial time. Approximation algorithms and heuristics with polynomial and pseudo-polynomial time complexities are often used to deal with this problem. However, existing solutions suffer either from excessive computational complexities that cannot be used for multimedia applications in ad hoc networks characterized by mobility and performance constraints (e.g., limited energy, wireless medium, etc.). Recently a promising heuristic algorithm H_MCOP using a non linear Lagrange relaxation path functions has demonstrated an improvement in its success rate and in finding feasible paths. However, the H_MCOP is not suitable for ad hoc networks and has not exploited the full capability that a Lagrange relaxation could offer. In this paper, we propose an efficient multi-constrained path heuristic called E_MCP, which exploits efficiently the Lagrange relaxation and enhances the path search process to be adequate to mobile ad hoc networks. Using extensive simulations on random mobile network with correlated and uncorrelated link weights, we show that the same level of computational complexity, E_MCP can achieve a higher success ratio of finding feasible paths.