The high bandwidth demand of Internet applications has recently driven the need of increasing the residential download speed. A practical solution to the problem has been proposed aggregating the bandwidth of 802.11 Access Points (APs) backhauls in range via 802.11 connections. Since 802.11 devices are usually single-radio, the communication to multiple APs on different radio-channels requires the introduction of a time-division multiple access (TDMA) policy at the client station. Current investigation in this area supposes that there is a sufficient number of TCP flows to saturate the Asymmetric Digital Subscriber Line (ADSL) behind the APs. However, this may be not guaranteed according to the user traffic pattern. As a consequence, a TDMA policy introduces additional delays in the end-to-end transmissions that will cause degradation of the TCP throughput and an under-utilization of the AP backhauls. In this paper, we first perform an in-depth experimental analysis with a customized 802.11 driver of how the usage of multi-AP TDMA affects the observed Round-Trip-Time (RTT) of TCP flows. Then, we introduce a simple analytical model that accurately predicts the TCP RTT when accessing the wireless medium with a Multi-AP TDMA policy. Based on this model, we propose a resource allocation algorithm that runs locally at the station and it greatly reduces the observed TCP RTT with a very low computational cost. Our proposed scheme can improve up to 1:5 times the aggregate throughput observed by the station compared to state-of-the-art multi-AP TDMA allocations. We also show that the throughput performance of the algorithm is very close to the theoretical upper-bound in key simulation scenarios.
Although overlay solutions are easy to be implemented, they are often sub-optimal and difficult to scale because of the overlapping and duplication of similar functionalities at different layers (e.g. in the driver and in the card firmware). The VirtualWiFi project @cite_6 proposed an architecture that abstracts a single 802.11 WLAN card to appear as multiple virtual clients to the user. Each client instance adopts standard PHY MAC protocols, but it can be separately configured at the driver level. An interesting application was the idea of connecting to multiple APs through a single radio interface. The authors rely on the 802.11 Power Save (PS) mode feature to switch among different 802.11 WLAN nodes in a time-division fashion. A station can inform the current 802.11 WLAN node that it is going into PS mode --- so that it can buffer packets directed to it --- and switch the radio-frequency to other 802.11 WLAN nodes, only to come back to the original node before the PS period expires.
@cite_6
1992067851 2164675070 2129374252 2111854969 1965360590 2162966576 2133114791 1673008520 2126345586 2157709134 2746866883 2143536282 1967383368 1662911496 2144246916 1540457649 2021521923 2114816637 2139528262 1608479615
We focus on energy saving in 802.11-based WLANs. Previous work has shown that, on the one hand, 802.11 wireless interfaces consume a significant amount of energy, on the other hand the use of current power management schemes can severely degrade the QoS performance of several Internet-based applications. Furthermore, the energy spent by wireless devices may even increase when the standard 802.11 power-saving mode (PSM) is implemented. These facts suggest that other solutions to energy saving are highly needed.In this paper, we consider the 802.11 distributed access scheme and we propose a novel approach that enables a station to enter a low-power operational state during channel contention. More specifically, our technique exploits the virtual carrier sense mechanism and the backoff function specified in the IEEE 802.11 DCF, so that a station can dramatically reduce its energy consumption without significant degradation of the QoS performance. To efficiently implement our mechanism, a low-power state with negligible transition time into the active state must be identified. This can be any of the non-standard, low-power states defined by proprietary solutions in the current or next-generation products [7,15,22]. By using the network simulator ns2, we evaluate the performance improvement that is obtained when the proposed mechanism is implemented, against the results attained through the standard DCF. The results show that we can achieve a reduction in energy consumption as large as 80 and 28 under, respectively, UDP and TCP traffic. With the increasing development of IEEE 802.11 based wireless local area network (WLAN) devices, large-scale multi-cell WLANs with a high density of users and access points (APs) have emerged widely in various hotspots. Providing resilient data transmission has been a primary challenge for scaling the WLANs because the high density of users and APs results in too many collisions. In this paper, we analyze and point out the defect of the single association mechanism defined in IEEE 802.11 on transmission reliability from a network perspective. Then, we propose a "multi-AP" architecture with which a MAC layer device called an AP controller (AC) is employed to enable each user to associate and cooperate with multiple APs. In this way, the users can benefit from the diversity effect of multipaths with independent collisions and transmission errors. This paper concentrates on the theoretical analysis of performance comparison between the proposed ldquoMulti-APrdquo architecture and that in IEEE 802.11. Extensive simulation results show that the proposed ldquomulti-APrdquo architecture can obtain much better performance in terms of the throughput per user and the total throughput, and the performance gain is position dependent. Moreover, the unfairness issue in traditional WLANs due to capture effect can be alleviated properly in the ldquomulti-APrdquo framework. The IEEE 802.11 standard for wireless local area networks (WLANs) employs a medium access control (MAC), called distributed coordination function (DCF), which is based on carrier sense multiple access with collision avoidance (CSMA CA). The collision avoidance mechanism utilizes the random backoff prior to each frame transmission attempt. The random nature of the backoff reduces the collision probability, but cannot completely eliminate collisions. It is known that the throughput performance of the 802.11 WLAN is significantly compromised as the number of stations increases. In this paper, we propose a novel distributed reservation-based MAC protocol, called early backoff announcement (EBA), which is backward compatible with the legacy DCF. Under EBA, a station announces its future backoff information in terms of the number of backoff slots via the MAC header of its frame being transmitted. All the stations receiving the information avoid collisions by excluding the same backoff duration when selecting their future backoff value. Through extensive simulations, EBA is found to achieve a significant increase in the throughput performance as well as a higher degree of fairness compared to the 802.11 DCF. The MAC layer of the 802.11 standard, based on the CSMA CA mechanism, specifies a set of parameters to control the aggressiveness of stations when trying to access the channel. However, these parameters are statically set independently of the conditions of the WLAN (e.g. the number of contending stations), leading to poor performance for most scenarios. To overcome this limitation previous work proposes to adapt the value of one of those parameters, namely the CW, based on an estimation of the conditions of the WLAN. However, these approaches suffer from two major drawbacks: i) they require extending the capabilities of standard devices or ii) are based on heuristics. In this paper we propose a control theoretic approach to adapt the CW to the conditions of the WLAN, based on an analytical model of its operation, that is fully compliant with the 802.11e standard. We use a Proportional Integrator controller in order to drive the WLAN to its optimal point of operation and perform a theoretic analysis to determine its configuration. We show by means of an exhaustive performance evaluation that our algorithm maximizes the total throughput of the WLAN and substantially outperforms previous standard-compliant proposals. The Point Coordination Function (PCF) of the IEEE 802.11 standard represents a well-known Medium Access Control (MAC) protocol providing Quality-of Service guarantees in Wireless Local Area Networks (WLANs). However, with the currently employed polling mechanism WLANs consume a significant amount of the energy resources from battery-powered user devices. To provide energy saving, an improved MAC protocol is presented in this paper, where bidirectional transmissions of fixed duration are incorporated into PCF in order to enable dynamic scheduling of real-time traffic. Based on this new strategy, wireless access points (APs) can estimate the proper duration of the Contention Free Period (CFP), in order to allow mobile stations to acknowledge any received data packet with a data packet equal to the received packet in size. Having this information, a mobile station, following the data exchange with the AP, can determine its wake-up timer and activate the sleep mode for the rest of the CFP interval. Comprehensive computer-based simulations demonstrate the feasibility of the proposed MAC improvements to achieve energy efficiency with negligible impact on packet delivery delay. We propose to add a new dimension to existing wireless multimedia communications systems by enabling competing stations to proactively engage in the resource management game by adapting their cross-layer transmission strategies. For this, we model wireless stations (WSTAs) as rational and selfish players competing for available wireless resources in a dynamic game. We focus on polling-based wireless LAN (WLAN) networks, where developing an efficient solution for managing the available transmission opportunities is of paramount importance. The resource allocation game is coordinated by a network moderator, which deploys a novel resource management based on the Vickrey-Clarke-Groves (VCG) mechanism to determine a) the amount of time to be allocated to the various users and b) the transmission cost associated to the allocated resources. The transmission cost is referred to in the VCG mechanism as "transfer" and depends not on the used resources, but rather on the inconvenience (in terms of utility impact) that it causes to other WSTAs. The transfer is introduced in order to discourage WSTAs from lying about their resource requirements. Importantly, this proposed dynamic resource management approach for wireless multimedia applications changes the passive way stations are currently adapting their cross-layer strategies by enabling them to selfishly influence the wireless systems dynamics by proactively adapting their packet scheduling strategies, error protection strategies, etc. Hence, each wireless station can play the resource management game by adapting its multimedia transmission strategy depending on the experienced channel conditions, derived video quality, attitude towards risk, willingness to pay for resources and available information about the wireless network. Our simulations show that using the VCG mechanism the WSTAs do not have any incentives to lie about their resource requirements as otherwise they will be severely penalized by a high transfer. We also show that deploying advanced cross-layer strategies for playing the resource management game significantly benefit the WSTAs' received video quality. The willingness-to-pay for resources is introduced to provide WSTAs a tool to gather additional resources whenever they need to transmit an important (part of a) video sequence by agreeing to pay for resources an increased cost. A novel risk-aware scheduling scheme is also proposed that provides WSTAs the ability to dynamically avoid network congestion and hence, reduce their incurred transfer Due to its simplicity and cost efficiency, wireless local area network (WLAN) enjoys unique advantages in providing high-speed and low-cost wireless services in hot spots and indoor environments. Traditional WLAN medium-access-control (MAC) protocols assume that only one station can transmit at a time: simultaneous transmissions of more than one station cause the destruction of all packets involved. By exploiting recent advances in PHY-layer multiuser detection (MUD) techniques, it is possible for a receiver to receive multiple packets simultaneously. This paper argues that such multipacket reception (MPR) capability can greatly enhance the capacity of future WLANs. In addition, the paper provides the MAC-layer and PHY-layer designs needed to achieve the improved capacity. First, to demonstrate MPR as a powerful capacity-enhancement technique, we prove a "superlinearityrdquo result, which states that the system throughput per unit cost increases as the MPR capability increases. Second, we show that the commonly deployed binary exponential backoff (BEB) algorithm in today's WLAN MAC may not be optimal in an MPR system, and the optimal backoff factor increases with the MPR capability, the number of packets that can be received simultaneously. Third, based on the above insights, we design a joint MAC-PHY layer protocol for an IEEE 802.11-like WLAN that incorporates advanced PHY-layer signal processing techniques to implement MPR. To satisfy the needs of wireless data networking, study group 802.11 was formed under IEEE project 802 to recommend an international standard for Wireless Local Area Networks (WLANs). A key part of standard are the Medium Access Control (MAC) protocol needed to support asynchronous and time bounded delivery of data frames. It has been proposed that unslotted Carrier Sense Multiple Access with Collision Avoidance (CSMA CA) be the basis for the IEEE 802.11 WLAN MAC protocols. We conduct performance evaluation of the asynchronous data transfer protocols that are a part of the proposed IEEE 802.11 standard taking into account the decentralized nature of communication between stations, the possibility of “capture”, and presence of “hidden” stations. We compute system throughput and evaluate fairness properties of the proposed MAC protocols. Further, the impact of spatial characteristics on the performance of the system and that observed by individual stations is determined. A comprehensive comparison of the access methods provided by the 802.11 MAC protocol is done and observations are made as to when each should be employed. Extensive numerical and simulation results are presented to help understand the issues involved. 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. Spatial multiple access holds the promise to boost the capacity of wireless networks when an access point has multiple antennas. Due to the asynchronous and uncontrolled nature of wireless LANs, conventional MIMO technology does not work efficiently when concurrent transmissions from multiple stations are uncoordinated. In this paper, we present the design and implementation of a crosslayer system, called SAM, that addresses the challenges of enabling spatial multiple access for multiple devices in a random access network like WLAN. SAM uses a chain-decoding technique to reliably recover the channel parameters for each device, and iteratively decode concurrent frames with misaligned symbol timings and frequency offsets. We propose a new MAC protocol, called CCMA, to enable concurrent transmissions by different mobile stations while remaining backward compatible with 802.11. Finally, we implement the PHY and MAC layer of SAM using the Sora high-performance software radio platform. Our evaluation results under real wireless conditions show that SAM can improve network uplink throughput by 70 with two antennas over 802.11. Since the inception of IEEE 802.11 wireless local area networks (WLANs) in 1997, wireless networking technologies have tremendously grown in the last few decades. The fundamental IEEE 802.11 physical (PHY) and medium access control (MAC) protocols have continuously been enriched with new technologies to provide the last mile wireless broadband connectivity to end users. Consequently, several new amendments of the basic IEEE 802.11 gradually came up in the forms of IEEE 802.11a, IEEE 802.11b, and IEEE 802.11g. More recently, IEEE 802.11n, IEEE 802.11ac, and IEEE 802.11ad are introduced with enhanced PHY and MAC layers that boost up physical data rates to the order of Gigabit per second. So, these amendments are generally known as high throughput WLANs (HT-WLANs). In HT-WLANs, PHY layer is enhanced with multiple-input multiple-output antenna technologies, channel bonding, short guard intervals, enhanced modulation and coding schemes. The MAC sublayer overhead is reduced by introducing frame aggregation and block acknowledgement technologies. However, several existing studies reveal that, many a time, the aforesaid PHY and MAC enhancements yield negative impact on various upper layer protocols, that is end-to-end transport and application layer protocols. As a consequence, a large number of researchers have focused on improving the coordination among PHY MAC and upper layer protocols. In this survey, we discuss impact of HT-WLAN PHY and MAC layer enhancements on various transport and application layer protocols. This paper also summarizes several research works that use aforesaid enhancements effectively to boost up data rate of end-to-end protocols. We also point out limitations of the existing researches and list down different open challenges that can be meaningfully explored for the development of the next generation HT-WLAN technologies. One critical issue in multihop ad hoc networks is the medium access control (MAC). The IEEE 802.11 MAC protocol is originally designed for fully connected, one-hop ad hoc networks but not for multihop ad hoc networks. In addition to the well known hidden-terminal problem, we found that IEEE 802.11 also suffers from an erroneous reservation problem which occurs when RTS-CTS exchange fails but the channel is incorrectly reserved. In this paper, we propose a jamming-based MAC (JMAC) protocol that is not only free from both hidden-terminal and the erroneous reservation problems but also allows more concurrent transmission reception activities for stations within each other's transmission range. The idea behind the JMAC is to separate source stations' traffic from destination stations' traffic into different channels (i.e., dividing the shared medium into two channels), and explicitly signal the channel status by jamming the channels. Simulation results show that the JMAC can provide higher channel utilization when system is in high traffic load and the frame size is medium or large. Supporting real-time and interactive traffic in addition to traditional data traffic with a best-effort nature represents a constantly rising need in any kind of telecommunications environment. The IEEE 802.11 based WLAN (Wireless Local Area Network) environment does not represent an exception. This is why at different protocol layers, and primarily at the MAC layer, many efforts are being put by both the research community and the standardization bodies to design effective mechanisms for user QoS (Quality of Service) differentiation. Although early results are coming into sight, such as, for example, the IEEE 802.11e standard release, still a thorough research activity is required. Aim of the present paper is to contribute to the cited research issue by proposing an improvement to the "static" traffic prioritisation mechanism foreseen by the IEEE 802.11e MAC (Medium Access Control) protocol. This latter shows a twofold drawback. First, there is no certainty that QoS requirements relevant to a given application are always fulfilled by the "statically" associated priority. Second, resource requests of the applications are not adapted to the (usually highly) variable traffic conditions of a distributed WLAN environment. The algorithm we propose is specifically tailored to "dynamically" assign 802.11e MAC priorities, depending on both application QoS requirements and observed network congestion conditions. It is carefully designed, implemented into a system simulation tool, and its highly effective behaviour assessed under variable traffic and system conditions. Even though multiple non-overlapped channels exist in the 2.4 GHz and 5 GHz spectrum, most IEEE 802.11-based multi-hop ad hoc networks today use only a single channel. As a result, these networks rarely can fully exploit the aggregate bandwidth available in the radio spectrum provisioned by the standards. This prevents them from being used as an ISP's wireless last-mile access network or as a wireless enterprise backbone network. In this paper, we propose a multi-channel wireless mesh network (WMN) architecture (called Hyacinth) that equips each mesh network node with multiple 802.11 network interface cards (NICs). The central design issues of this multi-channel WMN architecture are channel assignment and routing. We show that intelligent channel assignment is critical to Hyacinth's performance, present distributed algorithms that utilize only local traffic load information to dynamically assign channels and to route packets, and compare their performance against a centralized algorithm that performs the same functions. Through an extensive simulation study, we show that even with just 2 NICs on each node, it is possible to improve the network throughput by a factor of 6 to 7 when compared with the conventional single-channel ad hoc network architecture. We also describe and evaluate a 9-node Hyacinth prototype that Is built using commodity PCs each equipped with two 802.11a NICs. In mobile devices, the wireless network interface card (WNIC) consumes a significant portion of overall system energy. One way to reduce energy consumed by a device is to transition its WNIC to a lower-power steep mode when data is not being received or transmitted. In this paper, we investigate client-centered techniques for energy efficient communication, using IEEE 802.11b, within the network layer. The basic idea is to conserve energy by keeping the WNIC in high-power mode only when necessary. We track each connection, which allows us to determine inactive intervals during which to transition the WNIC to sleep mode. Whenever necessary, we also shape the traffic from the client side to maximize sleep intervals-convincing the server to send data in bursts. This trades lower WNIC energy consumption for an increase in transmission time. Our techniques are compatible with standard TCP and do not rely on any assistance from the server or network infrastructure. Results show that during Web browsing, our client-centered technique saved 21 percent energy compared to PSM and incurred less than a 1 percent increase in transmission time compared to regular TCP. For a large file download, our scheme saved 27 percent energy on average with a transmission time increase of only 20 percent This paper analyzes the performance of a duty-cycled polling-based access mechanism that exploits the Transmission Opportunity Power Save Mode (TXOP PSM) defined in the IEEE 802.11ac to improve the energy efficiency of Wireless Local Area Networks (WLANs) based on the IEEE 802.11. The basic idea behind the proposed approach, named GreenPoll, is to enable contention free periods, based on polling with beacons, during which wireless stations can save energy by turning off their radio transceivers after exchanging data with the access point. The closed expression of energy efficiency of GreenPoll is formulated in this paper and is used to evaluate the performance of GreenPoll considering important parameters like the traffic load, packet length, data rate, and number of stations in the network. Both analytical and simulation results show the high energy efficiency of GreenPoll with gains of up to 330 and 110 when compared to the legacy Distributed Coordination Function (DCF) and the Point Coordination Function (PCF) defined in the IEEE 802.11, respectively. 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). We propose a novel power saving strategy called Sleep during Neighbor-Addressed Frame (SNAF) for improving energy efficiency of IEEE 802.11 based wireless networks. IEEE 802.11 (Wi-Fi) radios that employ SNAF mode can turn OFF their wireless transceivers (i.e., put radios in sleep mode) within specific periods of neighbor-addressed frames while they are being received. The sleep duration of transceivers is easy to determine with no loss of packet's critical control information. The proposed SNAF mode operation does not have any negative effect on network throughput and even complements Power Saving Mode (PSM) available in 802.11 standard. We further propose GreenFrame format for next generation wireless networks. In experiments conducted in wireless LAN scenarios, we observed savings as much as 57.8 when we implement SNAF mode in 802.11 standard and up to 49.5 when we implement SNAF mode in 802.11 PSM. In upcoming very high-speed wireless LANs (WLANs), the physical (PHY) layer rate may reach 600 Mbps. To achieve high efficiency at the medium access control (MAC) layer, we identify fundamental properties that must be satisfied by any CSMA- CA-based MAC layers and develop a novel scheme called aggregation with fragment retransmission (AFR) that exhibits these properties. In the AFR scheme, multiple packets are aggregated into and transmitted in a single large frame. If errors happen during the transmission, only the corrupted fragments of the large frame are retransmitted. An analytic model is developed to evaluate the throughput and delay performance of AFR over noisy channels and to compare AFR with similar schemes in the literature. Optimal frame and fragment sizes are calculated using this model. Transmission delays are minimized by using a zero-waiting mechanism where frames are transmitted immediately once the MAC wins a transmission opportunity. We prove that zero-waiting can achieve maximum throughput. As a complement to the theoretical analysis, we investigate the impact of AFR on the performance of realistic application traffic with diverse requirements by simulations. We have implemented the AFR scheme in the NS-2 simulator and present detailed results for TCP, VoIP, and HDTV traffic. The AFR scheme described was developed as part of the IEEE 802.11n working group work. The analysis presented here is general enough to be extended to proposed schemes in the upcoming 802.11n standard. Trends indicated in this paper should extend to any well-designed aggregation schemes. In a cognitive radio scenario, we consider a single secondary user (SU) accessing a multichannel system. The SU senses the channels sequentially to detect if a primary user (PU) is occupying the channels and stops its search to access a channel if it offers a significantly high throughput. The optimal stopping rule and power control problem is considered. The problem is formulated as an SU's throughput-maximization problem under power, interference, and packet delay constraints. We first show the effect of the optimal stopping rule on packet delay and then solve this optimization problem for both the overlay system, where the SU transmits only at the spectrum holes, and the underlay system, where tolerable interference (or tolerable collision probability) is allowed. We provide closed-form expressions for the optimal stopping rule and show that the optimal power control strategy for this multichannel problem is a modified waterfilling approach. We extend the work to a multi-SU scenario and show that when the number of SUs is large, the complexity of the solution becomes smaller than that of the single-SU case. We discuss the application of this problem in typical networks where packets simultaneously arrive and have the same departure deadline. We further propose an online adaptation policy to the optimal stopping rule that meets the packets' hard-deadline constraint and, at the same time, gives higher throughput than the offline policy.