In this paper, we present a generic plug-and-play controller that ensures fair and efficient operation of IEEE 802.11 infrastructure wireless local area networks with multiple co-channel access points, without any change to hardware firmware of the network devices. Our controller addresses performance issues of TCP transfers in multi-AP WLANs, by overlaying a coarse time-slicing scheduler on top of a cascaded fair queuing scheduler. The time slices and queue weights, used in our controller, are obtained from the solution of a constrained utility optimization formulation. A study of the impact of coarse time-slicing on TCP is also presented in this paper. We present an improved algorithm for adaptation of the service rate of the fair queuing scheduler and provide experimental results to illustrate its efficacy. We also present the changes that need to be incorporated to the proposed approach, to handle short-lived and interactive TCP flows. Finally, we report the results of experiments performed on a real testbed, demonstrating the efficacy of our controller.
In our earlier work @cite_9 , we had introduced ADWISER (vanced iFi nternet ervice nhance); a device for WLAN performance management. ADWISER is located between the WLAN and LAN (see Fig. ) so that all packets to and from the wireless STAs pass through it. ADWISER uses virtual servers and queues to pull into itself the queues from two bottleneck resources: the WLAN medium and the Internet access link. As a result, ADWISER was able to mitigate infrastructure WLAN performance anomalies, such as throughput inefficiency due to multi-rate association, unfairness between downlink and uplink TCP controlled file transfers, and throughput unfairness between intranet and Internet downloads.
@cite_9
2018652527 2032824989 2120239653 2126345586 2129374252 2162966576 2107403026 2104935654 2164675070 2136340918 2096568537 2165683708 2435603672 2035804590 2139528262 2165715302 2035894106 2167712047 2096110307 2059400705
We present a centralized integrated approach for: 1) enhancing the performance of an IEEE 802.11 infrastructure wireless local area network (WLAN), and 2) managing the access link that connects the WLAN to the Internet. Our approach, which is implemented on a standard Linux platform, and which we call ADvanced Wi-fi Internet Service EnhanceR (ADWISER), is an extension of our previous system WLAN Manager (WM). ADWISER addresses several infrastructure WLAN performance anomalies such as mixed-rate inefficiency, unfair medium sharing between simultaneous TCP uploads and downloads, and inefficient utilization of the Internet access bandwidth when Internet transfers compete with LAN-WLAN transfers, etc. The approach is via centralized queueing and scheduling, using a novel, configurable, cascaded packet queueing and scheduling architecture, with an adaptive service rate. In this paper, we describe the design of ADWISER and report results of extensive experimentation conducted on a hybrid testbed consisting of real end-systems and an emulated WLAN on Qualnet. We also present results from a physical testbed consisting of one access point (AP) and a few end-systems. This paper addresses the problem of fairness in wireless ad-hoc networks. Usually, the problem of fairness in wireless ad-hoc networks is addressed in a classic approach inherited from wired networks. The common assumption is that nodes flows have pre-assigned fair shares. The task becomes then to modify wired networks' fair queueing algorithms to address wireless network nature. Wired networks have efficient means of allocating fiar shares through admission control and additionally, the fair shares remain constant throughout the session duration due to the static nature of the nodes. In ad-hoc networks, it is meaningless to assume statically pre-assigned fair shares, since on one hand, not only the nodes move, but also the routers are mobile, and on the other hand, contention is location dependent, such that in terms of absolute guarantees, fairness would at most mean "avoiding starvation": thus applying rate proportional fiar queueing algorithms is beyond the original goal of such algorithm, viz. flow isolation protection and bandwidth guarantee. In this work we argue in favor of multi-level scheduling for wireless ad-hoc networks with max-min fair allocation of the fair shares at the lower-most layer (MAC layer). This paper, mainly lays down the theoretical framework by which one can calculate the fair shares that would achieve max-min fairness in an ad-hoc network. We design distributed algorithms that allow each node to determine its max-min per-link fair share in a global ad-hoc network without knowledge of the global topology of the network. The results are then used in conjunction with a novel practical scheduling algorithm for IEEE 802.11 to show how fairness is achieved WiFi-based wireless LANs (WLANs) are widely used for Internet access. They were designed such that an Access Points (AP) serves few associated clients with symmetric uplink downlink traffic patterns. Usage of WiFi hotspots in locations such as airports and large conventions frequently experience poor performance in terms of downlink goodput and responsiveness. We study the various factors responsible for this performance degradation. We analyse and emulate a large conference network environment on our testbed with 45 nodes. We find that presence of asymmetry between the uplink downlink traffic results in backlogged packets at WiFi Access Point's (AP's) transmission queue and subsequent packet losses. This traffic asymmetry results in maximum performance loss for such an environment along with degradation due to rate diversity, fairness and TCP behaviour. We propose our solution WiFox, which (1) adaptively prioritizes AP's channel access over competing STAs avoiding traffic asymmetry (2) provides a fairness framework alleviating the problem of performance loss due to rate-diversity fairness and (3) avoids degradation due to TCP behaviour. We demonstrate that WiFox not only improves downlink goodput by 400-700 but also reduces request's average response time by 30-40 . 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. 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. 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 We consider the following two views of an IEEE 802.11 based Wireless LAN: (i) as seen by the WLAN medium and (ii) as seen by a user. In the system centric view, we model the WLAN medium as a server that allocates its resources to users in a round Robin manner. This resource sharing model not only provides a simple model for the system, it also enables us to derive the channel service rate and the total delay incurred in transmitting a packet. For Poisson arrivals, the resource sharing model takes the form of an M G 1 PS system with the mean delay being the same as that in an equivalent M M 1 system. We then take a user centric view and model each user's queue as a separate G G 1 queue. We derive the probability distributions for the different delay sources, i.e., random back-off time, random number of collisions and random number of successful transmissions from other users. This user centric model can provide insights into understanding access and queuing delays in 802.11 DCF. Finally, we discuss the utility of these models for functions such as capacity analysis, admission control and QoS enforcement. We consider wireless LANs such as IEEE 802.11 operating in the unlicensed radio spectrum. While their nominal bit rates have increased considerably, the MAC layer remains practically unchanged despite much research effort spent on improving its performance. We observe that most proposals for tuning the access method focus on a single aspect and disregard others. Our objective is to define an access method optimized for throughput and fairness, able to dynamically adapt to physical channel conditions, to operate near optimum for a wide range of error rates, and to provide equal time shares when hosts use different bit rates.We propose a novel access method derived from 802.11 DCF [2] (Distributed Coordination Function) in which all hosts use similar values of the contention window CW to benefit from good short-term access fairness. We call our method Idle Sense, because each host observes the mean number of idle slots between transmission attempts to dynamically control its contention window. Unlike other proposals, Idle Sense enables each host to estimate its frame error rate, which can be used for switching to the right bit rate. We present simulations showing how the method leads to high throughput, low collision overhead, and low delay. The method also features fast reactivity and time-fair channel allocation. 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. We consider the problem of resource allocation in downlink OFDMA systems for multi service and unknown environment. Due to users' mobility and intercell interference, the base station cannot predict neither the Signal to Noise Ratio (SNR) of each user in future time slots nor their probability distribution functions. In addition, the traffic is bursty in general with unknown arrival. The probability distribution functions of the SNR, channel state and traffic arrival density are then unknown. Achieving a multi service Quality of Service (QoS) while optimizing the performance of the system (e.g. total throughput) is a hard and interesting task since it depends on the unknown future traffic and SNR values. In this paper we solve this problem by modeling the multiuser queuing system as a discrete time linear dynamic system. We develop a robust H∞ controller to regulate the queues of different users. The queues and Packet Drop Rates (PDR) are controlled by proposing a minimum data rate according to the demanded service type of each user. The data rate vector proposed by the controller is then fed as a constraint to an instantaneous resource allocation framework. This instantaneous problem is formulated as a convex optimization problem for instantaneous subcarrier and power allocation decisions. Simulation results show small delays and better fairness among users. In this paper we study the problem of jointly performing scheduling and congestion control in mobile ad-hoc networks so that network queues remain bounded and the resulting flow rates satisfy an associated network utility maximization problem. In recent years a number of papers have presented theoretical solutions to this problem that are based on combining differential-backlog scheduling algorithms with utility-based congestion control. However, this work typically does not address a number of issues such as how signaling should be performed and how the new algorithms interact with other wireless protocols. In this paper we address such issues. In particular: ldr We define a specific network utility maximization problem that we believe is appropriate for mobile adhoc networks. ldr We describe a wireless greedy primal dual (wGPD) algorithm for combined congestion control and scheduling that aims to solve this problem. ldr We show how the wGPD algorithm and its associated signaling can be implemented in practice with minimal disruption to existing wireless protocols. ldr We show via OPNET simulation that wGPD significantly outperforms standard protocols such as 802.11 operating in conjunction with TCP. This work was supported by the DARPA CBMANET program. Wireless LANs (WLANs) have been deployed at a remarkable rate at university campuses, office buildings, airports, hotels, and malls. Providing efficient and reliable wireless communications is challenging due to inherent lossy wireless medium and imperfect packet scheduling that results in packet collisions. In this paper, we develop an efficient retransmission scheme (ER) for wirless LANs. Instead of retransmitting the lost packets in their original forms, ER codes packets lost at different destinations and uses a single retransmission to potentially recover multiple packet losses. We develop a simple and practical protocol to realize the idea and implement it in both simulation and testbed, and our results demonstrate the effectiveness of this approach. In this paper, we address the following question: given a specific placement of wireless nodes in physical space and a specific traffic workload, what is the maximum throughput that can be supported by the resulting network? Unlike previous work that has focused on computing asymptotic performance bounds under assumptions of homogeneity or randomness in the network topology and or workload, we work with any given network and workload specified as inputs.A key issue impacting performance is wireless interference between neighboring nodes. We model such interference using a conflict graph, and present methods for computing upper and lower bounds on the optimal throughput for the given network and workload. To compute these bounds, we assume that packet transmissions at the individual nodes can be finely controlled and carefully scheduled by an omniscient and omnipotent central entity, which is unrealistic. Nevertheless, using ns-2 simulations, we show that the routes derived from our analysis often yield noticeably better throughput than the default shortest path routes even in the presence of uncoordinated packet transmissions and MAC contention. This suggests that there is opportunity for achieving throughput gains by employing an interference-aware routing protocol. To deploy a multi-cell 802.11 wireless local area network (WLAN), access point (AP) placement and channel assignment are two primary design issues. For a given pattern of traffic demands, we aim at maximizing not only the overall system throughput, but also the fairness in resource sharing among mobile terminals. A novel method for estimating the system throughput of multi-cell WLAN is proposed. An important feature of this method is that co-channel overlapping is allowed. Unlike conventional approaches that decouple AP placement and channel assignment into two phases, we propose to jointly solve the two problems for better performance. The optimal solution can be found using exhaustive searching. Due to the high computational complexity involved in exhaustive searching, an efficient local searching algorithm, called patching algorithm, is designed. Numerical results show that for a typical indoor environment, patching algorithm can provide a close-to-optimal performance with much lower time complexity than exhaustive searching 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 multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users in a fair manner, proportional fair or time-based fair scheduling has been proposed to apply at each access point (AP). However, since a realistic deployment of wireless LANs can consist of a network of APs, this paper considers proportional fairness in this much wider setting. Our technique is to intelligently associate users with APs to achieve optimal proportional fairness in a network of APs. We propose two approximation algorithms for periodical offline optimization. Our algorithms are the first approximation algorithms in the literature with a tight worst-case guarantee for the NP-hard problem. Our simulation results demonstrate that our algorithms can obtain an aggregate throughput which can be as much as 2.3 times more than that of the max-min fair allocation in 802.11b. While maintaining aggregate throughput, our approximation algorithms outperform the default user-AP association method in the 802.11b standard significantly in terms of fairness. Recent advances in signal processing have demonstrated in-band full-duplex capability at WiFi ranges. In addition to simultaneous two-way exchange between two nodes, full-duplex access points can potentially support simultaneous uplink and downlink flows. However, the atomic three-node topology, which allows simultaneous uplink and downlink, leads to inter-client interference. In this paper, we propose a random-access medium access control protocol using distributed power control to manage inter-client interference in wireless networks with full-duplex-capable access points that serve half-duplex clients. Our key contributions are two-fold. First, we identify the regimes in which power control provides sum throughput gains for the three-node atomic topology, with one uplink flow and one downlink flow. Second, we develop and benchmark PoCMAC, a full 802.11-based protocol that allows distributed selection of a three-node topology. The proposed MAC protocol is shown to achieve higher capacity as compared to an equivalent half-duplex counterpart, while maintaining similar fairness characteristics in single contention domain networks. We carried out extensive simulations and software-defined radio-based experiments to evaluate the performance of the proposed MAC protocol, which is shown to achieve a significant improvement over its half-duplex counterpart in terms of throughput performance. In this paper, we propose a cross-layer deflect routing scheme that improves effective throughput of multi-hop millimeter-wave wireless personal area network (mmWave WPAN) system. The upcoming mmWave WPAN is designed to provide Gbps-order transmission capability, targeting applications like high definition TV (HDTV) transmission, high speed wireless docking and gaming etc. Adopting multi-hop relay offers solutions to the issues existing in mmWave WPAN system such as limited coverage range caused by the significant path loss, dramatic communication link change due to the unexpected blockage of the line-of-sight (LOS) path etc. However, multi-hop relay on the other hand decreases the effective throughput because of the required extra time. As a result, the compromised throughput may not be able to support the above applications which are greedy for data rate. Inspired by the fact that the significant path loss of millimeter-wave environment can provide good space isolation, our proposed scheme manages to improve the multi-hop throughput by sharing time slots for relay path with direct path for other transmissions. We also propose two algorithms, namely random fit deflect routing (RFDR) and best fit deflect routing (BFDR), to find the relay path on which the interference due to time slot sharing is low enough to guarantee the concurrent transmissions. Computer simulations show that, in realistic 60GHz environment, the effective multi-hop throughput can be improved up to 45 . Mobile devices interact wirelessly with a growing proliferation of cloud-based applications. Due to significant traffic growth and a wide variety of multimedia solutions, enterprise IT departments are demanding more fine-grained visibility and control of mobile traffic. They want to deliver optimal performance and a high quality of experience to a variety of users and applications. In the wired world, Software-Defined Networking (SDN) is a technology being embraced to deliver performance guarantees to end users by dynamically orchestrating quality of service (QoS) policies on edge switches and routers. Guaranteeing performance in a wired access network does not require any network control on clients, because the last hop between the network edge and wired device is a dedicated point-to-point link (e.g. Ethernet). However, this is not the case with wireless LANs (WLAN), since the last hop is a shared half-duplex medium and the WiFi MAC protocol does not allow access points to coordinate client uplink transmissions or 802.11 QoS settings. Hence, we argue that the SDN paradigm needs to be extended to mobile clients to provide optimal network performance between the cloud and wirelessly-connected clients. In this paper, we propose a framework called meSDN and demonstrate that it enables WLAN virtualization, application-aware QoS and improves power-efficiency from our prototype on Android phones. Summary 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 the hiddenterminal and the erroneous reservation problems but also allows more concurrent transmission receipt 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 although the channel division incurs some cost, the advantages of being free from the erroneous reservation and the hidden-terminal problems, and the benefits of more concurrent transmissions will compensate the cost and provide higher channel utilization when data frame size is median or large. Copyright # 2004 John Wiley & Sons, Ltd.