TDMAとDCFの組み合わせによるアドホックネットワーク上でのQoS通信の実現方式

　An ad hoc network does not rely on the fixed network infrastructure; it uses a distributed network management method. With the popularity of the smart devices, ad hoc network has received more and more attention, supporting QoS in ad hoc network has become inevitable. Many researches have been done for provision of QoS in ad hoc networks. These researches can be divided into three types.　The first type is contention-based approach which is the most widely used. IEEE 802.11e MAC (media access control) protocol belongs to this type which is an extension of IEEE 802.11 DCF(Distributed Coordination Function). It specifies a procedure to guarantee QoS by providing more transmission opportunities for high priority data. However, since IEEE 802.11eis designed based on the premise that access points are used, when the number of QoS flows increases, packet collisions could occur in multi-hop ad hoc network.　The second type is using TDMA-based approach. The TDMA approach can provide contention-free access for QoS traffics through the appropriate time slot reservation. The current TDMA approaches reserve time slots for both QoS traffics and best-effort traffics. However, it is difficult for TDMA as the only approach to allocating channel access time for best-effort traffics sincet he required bandwidth of the best-effort traffics changes frequently.　We propose a QoS scheme, which takes advantage of both contention-based approach and TDMA-based approach. In the proposed scheme, contention-based approach DCF provides easy and fair channel time for best-effort traffics, and TDMA approach serves the QoS traffics. A time frame structure is designed to manage the bandwidth allocation. A time frame is divided into two periods, specifically the TDMA periods and the DCF periods. The proportion of two periods is decided by QoS traffics. Therefore the QoS traffics are given absolutely higher priority than best-effort traffics. In order to guarantee the transmission of each QoS packet in TDMA period, a time slot assignment algorithm based on QoS data rate has been proposed. The proposed scheme also employs an admission control scheme, which rejects the new QoS user when the channel capacity is reached. In addition, we provide the configuration of the proposed scheme in the mobile environment. The procedures are designed for route changes and new-adding users. 　The proposed scheme is simulated in the QualNet simulator. In the static environment, the performance of the proposed scheme is evaluated in the case of a gradual increase in the number TCP flows and in the case of gradual increase in QoS data rate. Simulation results show that in the static environment the proposed scheme can not only provide effective QoS performance, but also can provide good support for best-effort flows. In the mobile environment, we simulated the performance of the proposed scheme at different moving speed (maximum is 5 Km/h) when the ARF (Auto Rate Fallback) is available. From the simulation results, in a specific mobile environment, the proposed scheme can support the QoS transmission well.電気通信大学201

Towards the Quality of Service for VoIP traffic in IEEE 802.11 Wireless Networks

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

Design of rate-adaptive MAC and medium aware routing protocols for multi-rate, multi-hop wireless networks

This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.The IEEE 802.11 standard conformant wireless communication stations have multi-rate transmission capability. To achieve greater communication efficiency, multi-rate capable stations use rateadaptation to select appropriate transmission rate according to variations in the channel quality. The thesis presents two rate-adaptation schemes, each belonging to one of the two classes of rateadaptation schemes i.e.(1) the frame-transmission statistics based schemes, and (2) Signal-to-Noise Ratio (SNR) based, closed loop schemes. The SNR-based rate-adaptation scheme, proposed in this thesis uses a novel mechanism of delivering a receiver’s feedback to a transmitter; without requiring any modification in the standard frames as suggested by existing research. The frame-transmissionstatistics based rate adaptation solution uses an on-demand incremental strategy for selecting a rate-selection threshold. This solution is based on a cross-layer communication framework, where the rate-adaptation module uses information to/from the Application layer along with relevant information from the Medium Access Control (MAC) sub-layer. The proposed solutions are highly responsive when compared with existing rate-adaptation schemes; responsiveness is one of the key factors in the design of such protocols. The novel feedback mechanism makes it possible to achieve frame-loss differentiation with just three frames, avoiding the use of Request To Send/ Clear To Send (RTS/CTS) frames and further delays in this process. Performance tests have affirmed that the proposed rate-adaptation schemes are energy efficient; with efficiency up to 19% in specific test scenarios. In terms of throughput and frame loss-differentiation mechanisms, the proposed schemes have shown significantly better performance.Routing protocols for Mobile Ad-Hoc Networks (MANETs) use broadcast frames during the route discovery process. The 802.11 mandates the use of different transmission rates for broadcast and unicast (data-) frames. In many cases it causes creation of communication gray zones, where stations which are marked as ‘reachable neighbours’ using the broadcast frames (using lower transmission rate) are not accessible during normal, unicast communication (mainly at a higher rate). Similarly, higher device density, interference and mobility cause variable medium access delays. The IEEE 802.11e introduces four different MAC level queues for four access categories, maintaining service priority within the queues; which implies that frames from a higher priority queue are serviced more frequently than those belonging to lower priority queues. Such an enhancement at the MAC sub-layer introduces uneven queuing delays. Conventional routing protocols are unaware of such MAC specific constraints and as a result these factors are not considered which result in severe performance deterioration. To meet such challenges, the thesis presents a medium aware distance vector (MADV) routing protocol for MANETs. MADV uses MAC and physical layer (PHY) specific information in the route metric and maintains a separate route per-AC-per-destination in its routing tables. The MADV-metric can be incorporated into various routing rotocols and its applicability is determined by the possibility of provision of MAC dependent arameters that are used to determine the hop-by-hop MADV-metric values. Simulation tests and omparison with existing MANET protocols demonstrate the effectiveness of incorporating the medium dependent parameters and show that MADV is significantly better in terms of end-to-end delay and throughput

An admission control scheme for IEEE 802.11e wireless local area networks

Includes bibliographical references (leaves 80-84).Recent times has seen a tremendous increase in the deployment and use of 802.11 Wireless Local Area Networks (WLANs). These networks are easy to deploy and maintain, while providing reasonably high data rates at a low cost. In the paradigm of Next-Generation-Networks (NGNs), WLANs can be seen as an important access network technology to support IP multimedia services. However a traditional WLAN does not provide Quality of Service (QoS) support since it was originally designed for best effort operation. The IEEE 802. 11e standard was introduced to overcome the lack of QoS support for the legacy IEEE 802 .11 WLANs. It enhances the Media Access Control (MAC) layer operations to incorporate service differentiation. However, there is a need to prevent overloading of wireless channels, since the QoS experienced by traffic flows is degraded with heavily loaded channels. An admission control scheme for IEEE 802.11e WLANs would be the best solution to limit the amount of multimedia traffic so that channel overloading can be prevented. Some of the work in the literature proposes admission control solutions to protect the QoS of real-time traffic for IEEE 802.11e Enhanced Distributed Channel Access (EDCA). However, these solutions often under-utilize the resources of the wireless channels. A measurement-aided model-based admission control scheme for IEEE 802.11e EDCA WLANs is proposed to provide reasonable bandwidth guarantees to all existing flows. The admission control scheme makes use of bandwidth estimations that allows the bandwidth guarantees of all the flows that are admitted into the network to be protected. The bandwidth estimations are obtained using a developed analytical model of IEEE 802.11e EDCA channels. The admission control scheme also aims to accept the maximum amount of flows that can be accommodated by the network's resources. Through simulations, the performance of the proposed admission control scheme is evaluated using NS-2. Results show that accurate bandwidth estimations can be obtained when comparing the estimated achievable bandwidth to actual simulated bandwidth. The results also validate that the bandwidth needs of all admitted traffic are always satisfied when the admission control scheme is applied. It was also found that the admission control scheme allows the maximum amount of flows to be admitted into the network, according the network's capacity

Traffic Control and Quality of Service in Wireless LANs

The thesis deals with two aspects of the IEEE 802.11 standard. The first is the so-called “performance anomaly”: the variable bandwidth of the links and the use of multiple transmission rates push the throughput of all stations to align to the slowest one. To tackle this problem we designed and developed a simple channel-aware scheduling algorithm, called DTT, which actualises the proportional fairness concept, thus leading to noteworthy improvements, and in particular to flow isolation. This is achieved by measuring link quality as the time needed to deliver a frame. The resource to share is no longer capacity, but the time the channel is in use. DTT has then been integrated into a prototype Access Point, which is the first working implementation of a scheduler based on proportional fairness. Secondly, we focused on 802.11e networks, which, though enhancing QoS support, still offer scarce reliability of QoS guarantees and suffer from network congestion. We devised two admission control algorithms to assess the maximum number of users allowable to the services while satisfying QoS requirements. Following the studies on DTT, both algorithms centre the admission test on the time occupancy of the medium. The first algorithm builds on an analytical model of the EDCA mode in non-saturation conditions. This closely matches the real behaviour of a network carrying time-sensitive applications, thus overcoming the limits of all previous works, based on saturation models. The second algorithm uses and extends to 802.11e the NUC, a parameter defined and proved effective for 802.11b systems. This scheme needs measures of the actual state of the network. Simulations run within the E-model framework show good accuracy performance for both models

Greediness control algorithm for multimedia streaming in wireless local area networks

This work investigates the interaction between the application and transport layers while streaming multimedia in a residential Wireless Local Area Network (WLAN). Inconsistencies have been identified that can have a severe impact on the Quality of Experience (QoE) experienced by end users. This problem arises as a result of the streaming processes reliance on rate adaptation engines based on congestion avoidance mechanisms, that try to obtain as much bandwidth as possible from the limited network resources. These upper transport layer mechanisms have no knowledge of the media which they are carrying and as a result treat all traffic equally. This lack of knowledge of the media carried and the characteristics of the target devices results in fair bandwidth distribution at the transport layer but creates unfairness at the application layer. This unfairness mostly affects user perceived quality when streaming high quality multimedia. Essentially, bandwidth that is distributed fairly between competing video streams at the transport layer results in unfair application layer video quality distribution. Therefore, there is a need to allow application layer streaming solutions, tune the aggressiveness of transport layer congestion control mechanisms, in order to create application layer QoE fairness between competing media streams, by taking their device characteristics into account. This thesis proposes the Greediness Control Algorithm (GCA), an upper transport layer mechanism that eliminates quality inconsistencies caused by rate / congestion control mechanisms while streaming multimedia in wireless networks. GCA extends an existing solution (i.e. TCP Friendly Rate Control (TFRC)) by introducing two parameters that allow the streaming application to tune the aggressiveness of the rate estimation and as a result, introduce fair distribution of quality at the application layer. The thesis shows that this rate adaptation technique, combined with a scalable video format allows increased overall system QoE. Extensive simulation analysis demonstrate that this form of rate adaptation increases the overall user QoE achieved via a number of devices operating within the same home WLAN

Analysis and enhancement of wireless LANs in noisy channels

Without a doubt, Wireless Local Area Networks (WLANs) technology has been encountering an explosive growth lately. IEEE 802.11 is the standard associated with this promising technology, which enures shared access to the wireless medium through the distributed coordination function (DCF). Recently, the IEEE 802.11e task group has made extensions to WLANs medium access control (MAC) in order to support quality of service (QoS) traffic. An inherited problem for WLANs, is the volatility of the propagation medium, which is a challenging issue that affects the system performance significantly. Consequently, enhancing the operation of the DCF in noisy environments is of great interest, and has attracted the attention of many researchers. Our first major contribution in the presented thesis, is an analytical and simulation analysis for the binary exponential backoff (BEB) scheme of the DCF, in the presence of channel noise. We show that following the BEB procedure when a host encounters erroneous transmission is needed only if the channel was highly loaded. However, incrementing the contention window (CW) upon each packet failure, whether caused by instantaneous transmission (i.e. collision) or channel noise, will result in the waste of air time if the channel was lightly loaded. Accordingly, we present a hybrid access method that adapts the CW according to the channel load along with the frame error rate (FER). Other means to overcome the channel noise is the adjustment of the transmission rate. Many rate adaptation (RA) algorithms were introduced in the past few years, including the Automatic Rate Fallback (ARF) which is currently implemented in the wireless cards. Yet, many drawbacks are associated with these RA algorithms; specifically, in regard to the techniques and events that should trigger the rate change. Moreover, the IEEE 802.11e QoS flows requirements were not considered with the latter schemes. Accordingly, our next major contribution in this work is the presentation of a novel rate adaptation scheme. The simplicity of the introduced rate adaptation scheme is that it relies on the MAC layer parameters rather than those of the PHY layer when adjusting the rate. Furthermore, our algorithm supports the IEEE 802.11e MAC extensions where QoS traffic requirements were integrated in the procedure of adjusting the bit rate. Hence, strict real-time flow parameters such as delay and maximum drop rate are respected. Finally, we enhance the dynamic assignment of transmission opportunities (TXOPs) in order to offer fair air-time for nodes facing high packet loss rat

Mac-Phy Cross-Layer analysis and design of Mimo-Ofdm Wlans based on fast link adaptation

The latestWLAN standard, known as IEEE 802.11n, has notably increased the network capacity with respect to its predecessors thanks to the incorporation of the multipleinput multiple-output (MIMO) technology. Nonetheless, the new amendment, as its previous ones, does not specify how crucial configuration mechanisms, most notably the adaptive modulation and coding (AMC) algorithm should be implemented. The AMC process has proved essential to fully exploit the system resources in light of varying channel conditions. In this dissertation, a closed-loop AMC technique, referred to as fast link adaption (FLA) algorithm, that effectively selects themodulation and coding scheme (MCS) for multicarriermultiantennaWLAN networks is proposed. The FLA algorithm determines the MCS that maximizes the throughput while satisfying a quality of service (QoS) constraint, usually defined in the form of an objective packet error rate (PER). To this end, FLA uses a packet/bit error rate prediction methodology based on the exponential effective SNRmetric (EESM). The FLA algorithm performance has been evaluated under IEEE 802.11n systems that thanks to the incorporation of a feedbackmechanismare able to implement closed- loop AMC mechanisms. Initially, this AMC technique relies only on physical layer information but it is subsequently extended to also take into account themediumaccess control (MAC) sublayer performance. At the physical layer, the FLA algorithm has demonstrated its effectivity by performing very close to optimality in terms of throughput, while satisfying a prescribed PER constraint. The FLA algorithm has also been evaluated using imperfect channel information. It has been observed that the proposed FLA technique is rather robust against imperfect channel information, and only in highly-frequency selective channels, imperfect channel knowledge causes a noticeable degradation in throughput. At the MAC sublayer, the FLA algorithm has been complemented with a timeout strategy that weighs down the influence of the available channel information as this becomes outdated. This channel information outdate is caused by the MAC sublayer whose user multiplexing policy potentially results in large delays between acquiring the instant in which the channel state information is acquired and that in which the channel is accessed. Results demonstrate the superiority of FLA when compared to open-loop algorithms under saturated and non-saturated conditions and irrespective of the packet length, number of users, protocol (CSMA/CA or CDMA/E2CA) and access scheme (Basic Access or RTS/CTS). Additionally, several analytical models have been developed to estimate the system performance at the MAC sublayer. These models account for all operational details of the IEEE 802.11n MAC sublayer, such as finite number of retries, anomalous slot or channel errors. In particular, a semi-analytical model that assesses the MAC layer throughput under saturated conditions, considering the AMC performance is first introduced. Then, an analytical model that allows the evaluation of the QoS performance under non-saturated conditions is presented. This model focuses on single MCS and it is able to accurately predict very important system performance metrics such as blocking probability, delay, probability of discard or goodput thanks to the consideration of the finite queues on each station. Finally, the previous non-saturated analytical approach is used to define a semi-analytical model in order to estimate the system performance when considering AMC algorithms (i.e. whenmultiple MCSs are available)La darrera versió de l’estàndard deWLAN, anomenada IEEE 802.11n, ha augmentat la seva capacitat notablement en relació als sistemes anteriors gràcies a la incorporació de la tecnologia de múltiples antenes en transmissió i recepció (MIMO). No obstant això, la nova proposta, al igual que les anteriors, segueix sense especificar com s’han d’implementar elsmecanismes de configuraciómés crucials, un dels quals és l’algoritme de codificació imodulació adaptativa (AMC). Aquests algoritmes ja han demostrat la seva importància a l’hora demaximitzar el rendiment del sistema tenint en compte les condicions canviants del canal. En aquesta tesis s’ha proposat un algoritme AMC de llaç tancat, anomenat adaptació ràpida de l’enllaç (FLA), que selecciona eficientment l’esquema demodulació i codificació adaptativa per xarxes WLAN basades en arquitectures multiportadora multiantena. L’algoritme FLA determina el mode de transmissió capaç de maximitzar el throughput per les condicions de canal actuals, mentre satisfà un requisit de qualitat de servei en forma de taxa d’error per paquet (PER). FLA utilitza una metodologia de predicció de PER basada en l’estimació de la relació senyal renou (SNR) efectiva exponencial (EESM). El rendiment de l’algoritme FLA ha estat avaluat en sistemes IEEE 802.11n, ja que aquests, gràcies a la incorporació d’unmecanisme de realimentació demodes de transmissió, poden adoptar solucions AMC de llaç tancat. En una primera part, l’estudi s’ha centrat a la capa física i després s’ha estès a la subcapa MAC. A la capa física s’ha demostrat l’efectivitat de l’algoritme FLA aconseguint un rendiment molt proper al que ens proporcionaria un esquema AMC òptim en termes de throughput, alhora que es satisfan els requisits de PER objectiu. L’algoritme FLA també ha estat avaluat utilitzant informació imperfecte del canal. S’ha vist que l’algoritme FLA proposat és robust en front dels efectes d’estimació imperfecte del canal, i només en canals altament selectius en freqüència, la informació imperfecte del canal provoca una davallada en el rendiment en termes de throughput. A la subcapa MAC, l’algoritme FLA ha estat complementat amb una estratègia de temps d’espera que disminueix la dependència amb la informació de canal disponible a mesura que aquesta va quedant desfassada respecte de l’estat actual. Aquesta informació de canal desfassada és conseqüència de la subcapa MAC que degut a la multiplexació d’usuaris introdueix grans retards entre que es determina el mode de transmissió més adequat i la seva utilització per a l’accés al canal. Els resultats obtinguts han demostrat la superioritat de FLA respecte d’altres algoritmes de llaç obert en condicions de saturació i de no saturació, i independentment de la longitud de paquet, nombre d’usuaris, protocol (CSMA/CA i CSMA/E2CA) i esquema d’accés (Basic Access i RTS/CTS). Amés, s’han desenvolupat diversosmodels analítics per tal d’estimar el rendiment del sistema a la subcapa MAC. Aquests models consideren tots els detalls de funcionament de la subcapaMAC del 802.11n, comper exemple un nombre finit de retransmissions de cada paquet, l’slot anòmal o els errors introduïts pel canal. Inicialment s’ha proposat unmodel semi-analític que determina el throughtput en condicions de saturació, considerant el rendiment dels algoritmes AMC. Després s’ha presentat un model analític que estima el rendiment del sistema per condicions de no saturació, mitjançat elmodelat de cues finites a cada estació. Aquestmodel consideramodes de transmissió fixes i és capaç de determinar de manera molt precisa mètriques de rendimentmolt importants comsón la probabilitat de bloqueig de cada estació, el retard mitjà del paquets, la probabilitat de descart o la mesura del goodput. Finalment, el model analític de no saturació s’ha utilitzat per definir un model semi-analític per tal d’estimar el rendiment del sistema quan es considera l’ús d’algoritmes AMC