Number Of Active Stations Research Articles

Runtime optimization of IEEE 802.11 wireless lans performance

IEEE 802.11 is the standard for wireless local area networks (WLANs) promoted by the Institute of Electrical and Electronics Engineers. Wireless technologies in the LAN environment are becoming increasingly important and the IEEE 802.11 is the most mature technology to date. Previous works have pointed out that the standard protocol can be very inefficient and that an appropriate tuning of its congestion control mechanism (i.e., the backoff algorithm) can drive the IEEE 802.11 protocol close to its optimal behavior. To perform this tuning, a station must have exact knowledge of the network contention level; unfortunately, in a real case, a station cannot have exact knowledge of the network contention level (i.e., number of active stations and length of the message transmitted on the channel), but it, at most, can estimate it. We present and evaluate a distributed mechanism for contention control in IEEE 802.11 wireless LANs. Our mechanism, named asymptotically optimal backoff (AOB), dynamically adapts the backoff window size to the current network contention level and guarantees that an IEEE 802.11 WLAN asymptotically achieves its optimal channel utilization. The AOB mechanism measures the network contention level by using two simple estimates: the slot utilization and the average size of transmitted frames. These estimates are simple and can be obtained by exploiting information that is already available in the standard protocol. AOB can be used to extend the standard 802.11 access mechanism without requiring any additional hardware. The performance of the IEEE 802.11 protocol, with and without the AOB mechanism, is investigated through simulation. Simulation results indicate that our mechanism is very effective, robust, and has traffic differentiation potentialities.

TRAP: a high performance protocol for wireless local area networks

The fixed number of available random addresses for randomly addressed polling (RAP) poses a significant problem in terms of scalability in case of many active stations. In such cases, the protocol's performance is significantly degraded. In this paper, we propose a TDMA-based randomly addressed polling (TRAP) protocol. The protocol employs a variable-length TDMA-based contention stage with the length based on the number of active stations. At the beginning of each polling cycle, the base station invites all active mobile stations to register their intention to transmit via transmission of a short pulse. The base station uses the aggregate received pulse in order to obtain an estimate of the number of contending stations and schedules the contention stage to comprise an adequate number of time slots for these stations to successfully register their intention to transmit. Then it transmits a READY message carrying the number of time slots P. Each mobile station calculates a random address in the interval [0… P−1], transmits its registration request in the respective time slot and then the base station polls according to the received random addresses. Simulation results are presented that reveal the superiority of TRAP against the RAP protocol in case of medium and high offered loads. Furthermore, the implementation of the proposed protocol is much simpler than that of CDMA-based versions of RAP, since no extra hardware is needed for the orthogonal reception of the random addresses.

Optimization of efficiency and energy consumption in p-persistent CSMA-based wireless LANs

Wireless technologies in the LAN environment are becoming increasingly important. The IEEE 802.11 is the most mature technology for wireless local area networks (WLANs). The limited bandwidth and the finite battery power of mobile computers represent one of the greatest limitations of current WLANs. In this paper, we deeply investigate the efficiency and the energy consumption of MAC protocols that can be described with a p-persistent CSMA model. As already shown in the literature, the IEEE 802.11 protocol performance can be studied using a p-persistent CSMA model (Cali et al. 2000). For this class of protocols, in the paper, we define an analytical framework to study the theoretical performance bounds from the throughput and the energy consumption standpoint. Specifically, we derive the p values (i.e., the average size of the contention window in the IEEE 802.11 protocol (Cali et al.)) that maximizes the throughput, p/sub opt//sup C/, and minimizes the energy consumption, p/sub opt//sup E/. By providing analytical closed formulas for the optimal p values, we discuss the trade-off between efficiency and energy consumption. Specifically, we show that power saving and throughput maximization can be jointly achieved. Our analytical formulas indicate that the optimal p values depend on the network configuration, i.e., number of active stations and length of the messages transmitted on the channel. As network configurations dynamically change, the optimal p values must be dynamically updated. In this paper, we propose and evaluate a simple but effective feedback-based distributed algorithm for tuning the p parameter to the optimal values, i.e., p/sub opt//sup E/ and p/sub opt//sup C/. The performance of the p-persistent IEEE 802.11 protocol, enhanced with our algorithm, is extensively investigated by simulation. Our results indicate that the enhanced p-persistent IEEE 802.11 protocol is very close to the theoretical bounds both in steady-state and in transient conditions.

IEEE 802.11 protocol: design and performance evaluation of an adaptive backoff mechanism

In WLANs, the medium access control (MAC) protocol is the main element that determines the efficiency of sharing the limited communication bandwidth of the wireless channel. The fraction of channel bandwidth used by successfully transmitted messages gives a good indication of the protocol efficiency, and its maximum value is referred to as protocol capacity. In a previous paper we have derived the theoretical limit of the IEEE 802.11 MAC protocol capacity. In addition, we showed that if a station has an exact knowledge of the network status, it is possible to tune its backoff algorithm to achieve a protocol capacity very close to its theoretical bound. Unfortunately, in a real case, a station does not have an exact knowledge of the network and load configurations (i.e., number of active stations and length of the message transmitted on the channel) but it can only estimate it. In this work we analytically study the performance of the IEEE 802.11 protocol with a dynamically tuned backoff based on the estimation of the network status. Results obtained indicate that under stationary traffic and network configurations (i.e., constant average message length and fixed number of active stations), the capacity of the enhanced protocol approaches the theoretical limits in all the configurations analyzed. In addition, by exploiting the analytical model, we investigate the protocol performance in transient conditions (i.e., when the number of active stations sharply changes).

Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit

In wireless LANs (WLANs), the medium access control (MAC) protocol is the main element that determines the efficiency in sharing the limited communication bandwidth of the wireless channel. In this paper we focus on the efficiency of the IEEE 802.11 standard for WLANs. Specifically, we analytically derive the average size of the contention window that maximizes the throughput, hereafter theoretical throughput limit, and we show that: 1) depending on the network configuration, the standard can operate very far from the theoretical throughput limit; and 2) an appropriate tuning of the backoff algorithm can drive the IEEE 802.11 protocol close to the theoretical throughput limit. Hence we propose a distributed algorithm that enables each station to tune its backoff algorithm at run-time. The performances of the IEEE 802.11 protocol, enhanced with our algorithm, are extensively investigated by simulation. Specifically, we investigate the sensitiveness of our algorithm to some network configuration parameters (number of active stations, presence of hidden terminals). Our results indicate that the capacity of the enhanced protocol is very close to the theoretical upper bound in all the configurations analyzed.

IMPLEMENTATION OF BANDWIDTH BALANCING MECHANISM FOR DQDB NETWORK WITH MODIFIED PROTOCOL

A potential problem with DQDB network is the achievement of fair sharing of bandwidth in terms of the location of the access node. For the sake of compensating this unfairness, the IEEE 802.6 Standard recommends to utilize a Bandwidth Balancing (BWB) Mechanism. This paper deals with the implementation of BWB mechanism using the modified DQDB method. We focus on the behavior of this protocol when the network is Heavy load. The effect of BWB mechanism on the fairness problems suffered by a DQDB network with two stations for three different scenarios is investigated analytically through using a graph model which is based on the space time diagram. Simulation is used when the number of active stations is larger than two. Our results provide a deep insight into the equilibrium access of data channel by all the active stations. They also show that the station throughputs are independent on the state of the network when overload occurs.

Optimal controlled ALOHA for two-way data communication in a cable television network

Based on a unified analysis of both pure and slotted ALOHA systems, a new control algorithm for ALOHA systems is proposed. A feature of great practical importance is the algorithm's automatic adjustment to changes in average traffic intensity or the (finite or infinite) number of active stations in the system. In addition, the algorithm has a low-complexity implementation. Computer simulations, concentrating on the use for two-way data communication in a cable television network, have demonstrated that the practical performance of the algorithm closely approximates the theoretical optimum, even under extremely heavy traffic load conditions. Furthermore, dynamic performance simulations have shown that the algorithm assures swift recovery from overload situations. >

Performance analysis of FDDI token ring networks: effect of parameters and guidelines for setting TTRT

The timed token access method on which the FDDI (fiber distributed data interface) network is based is described. The two kinds of performance parameters, fixed and user-settable, that are used to study performance are discussed. Performance metrics are defined, and the performance is analyzed for asynchronous traffic, using simulation and analytical modeling. Guidelines for setting the target token rotation time (TTRT), which is the key network parameter that can be used to optimize the performance of an FDDI ring network, are presented. The effects on performance of the total number of stations, number of active stations, frame size, and total fiber length are examined.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

The IEEE token bus-A performance bound on GM MAP

All versions of the General Motors manufacturing automation protocol (GM MAP) specify that MAP's lower-layer services are to be provided by the IEEE 802.4 token bus. An understanding of 802.4 and its performance aspects is therefore a prerequisite to predicting the performance of MAP. It is shown how total bus capacity is divided among data throughput, token traffic, and propagation delays. The relative contributions of access delay and queuing delay to total message delivery time are discussed. The effects on message delivery times of message size and the number of active stations are also reported. As the token cycle time increases beyond the target rotation time for each of the asynchronous access classes, service to the lower-priority classes is curtailed; a formula that can be used to identity the offered load at which the transition from normal to curtailed service begins is presented. >

Performance of Integrated Packet Voice/Data Token-Passing Rings

This paper presents performance results that indicate that packetized voice service can be provided on a token-passing ring without adversely affecting the performance of data traffic. This is accomplished by introducing a relatively mild priority structure: stations are limited to a single packet transmission per medium access, and voice packets are given access priority over data packets at the same station. In addition, voice traffic is allowed longer packet lengths than data traffic. Several versions of this basic scheme are considered: 1) the number of active stations is constrained so that voice packets are guaranteed access within one packetization period, 2) no guarantee on access time is provided and voice packets are discarded when the waiting time exceeds one packetization period, and 3) no guarantee on access time is provided and voice packets are buffered until they can be transmitted.

Analytic Modelling Of Ring-Type Local Area Networks

AbstractThis paper is concerned mainly with the stochastic modelling and performance comparison of two of the more common ring networks – token rings and slotted rings. New models for the slotted ring and extensions of existing token ring models are presented. Simulation models are used to validate certain assumptions used in the analytic models. Mean delay time is chosen as the performance index. The effect of various ring parameters on the delay time is studied. These parameters include the network load, the number of active stations on the ring and in the case of the slotted ring, the number of slots and the slot size. For the token ring, the effect on performance due to the service discipline (exhaustive and nonexhaustive) and the mode (single and multiple-token) is also analysed.