188 research outputs found

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

    Get PDF
     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

    VoIP Call Admission Control in WLANs in Presence of Elastic Traffic

    Get PDF
    VoIP service over WLAN networks is a promising alternative to provide mobile voice communications. However, several performance problems appear due to i) heavy protocol overheads, ii) unfairness and asymmetry between the uplink and downlink flows, and iii) the coexistence with other traffic flows. This paper addresses the performance of VoIP communications with simultaneous presence of bidirectional TCP traffic, and shows how the presence of elastic flows drastically reduces the capacity of the system. To solve this limitation a simple solution is proposed using an adaptive Admission and Rate Control algorithm which tunes the BEB (Binary Exponential Backoff) parameters. Analytical results are obtained by using an IEEE 802.11e user centric queuing model based on a bulk service M=G[1;B]=1=K queue, which is able to capture the main dynamics of the EDCA-based traffic differentiation parameters (AIFS, BEB and TXOP). The results show that the improvement achieved by our scheme on the overall VoIP performance is significant

    Adaptive delayed channel access for IEEE 802.11n WLANs

    Get PDF
    Abstract— In this paper we investigate potential benefits that an adaptive delayed channel access algorithm can attain for the next-generation wireless LANs, the IEEE 802.11n. We show that the performance of frame aggregation introduced by the 802.11n adheres due to the priority mechanism of the legacy 802.11e EDCA scheduler, resulting in a poor overall performance. Because high priority flows have low channel utilization, the low priority flows throughputs can be amerced further. By introducing an additional delay at the MAC layer, before the channel access scheduling, it will retain aggregate sizes at higher numbers and consequently a better channel utilization. Also, in order to support both UDP and TCP transport layer protocols, the algorithm’s operational conditions are kept adaptive. The simulation results demonstrate that our proposed adaptive delayed channel access outperforms significantly the current 802.11n specification and non-adaptive delayed channel access

    IEEE 802.11n MAC frame aggregation mechanisms for next-generation high-throughput WLANs [Medium access control protocols for wireless LANs]

    Get PDF
    IEEE 802.11n is an ongoing next-generation wireless LAN standard that supports a very highspeed connection with more than 100 Mb/s data throughput measured at the medium access control layer. This article investigates the key MAC enhancements that help 802.11n achieve high throughput and high efficiency. A detailed description is given for various frame aggregation mechanisms proposed in the latest 802.11n draft standard. Our simulation results confirm that A-MSDU, A-MPDU, and a combination of these methods improve extensively the channel efficiency and data throughput. We analyze the performance of each frame aggregation scheme in distinct scenarios, and we conclude that overall, the two-level aggregation is the most efficacious
    corecore