PACE: Simple Multi-hop Scheduling for Single-radio 802.11-based Stub Wireless Mesh Networks

IEEE 802.11-based Stub Wireless Mesh Networks (WMNs) are a cost-effective and flexible solution to extend wired network infrastructures. Yet, they suffer from two major problems: inefficiency and unfairness. A number of approaches have been proposed to tackle these problems, but they are too restrictive, highly complex, or require time synchronization and modifications to the IEEE 802.11 MAC. PACE is a simple multi-hop scheduling mechanism for Stub WMNs overlaid on the IEEE 802.11 MAC that jointly addresses the inefficiency and unfairness problems. It limits transmissions to a single mesh node at each time and ensures that each node has the opportunity to transmit a packet in each network-wide transmission round. Simulation results demonstrate that PACE can achieve optimal network capacity utilization and greatly outperforms state of the art CSMA/CA-based solutions as far as goodput, delay, and fairness are concerned

A GA-based simulation system for WMNs: comparison analysis for different number of flows, client distributions, DCF and EDCA functions

In this paper, we compare the performance of Distributed Coordination Function (DCF) and Enhanced Distributed Channel Access (EDCA) for normal and uniform distributions of mesh clients considering two Wireless Mesh Network (WMN) architectures. As evaluation metrics, we consider throughput, delay, jitter and fairness index metrics. For simulations, we used WMN-GA simulation system, ns-3 and Optimized Link State Routing. The simulation results show that for normal distribution, the throughput of I/B WMN is higher than Hybrid WMN architecture. For uniform distribution, in case of I/B WMN, the throughput of EDCA is a little bit higher than Hybrid WMN. However, for Hybrid WMN, the throughput of DCF is higher than EDCA. For normal distribution, the delay and jitter of Hybrid WMN are lower compared with I/B WMN. For uniform distribution, the delay and jitter of both architectures are almost the same. However, in the case of DCF for 20 flows, the delay and jitter of I/B WMN are lower compared with Hybrid WMN. For I/B architecture, in case of normal distribution the fairness index of DCF is higher than EDCA. However, for Hybrid WMN, the fairness index of EDCA is higher than DCF. For uniform distribution, the fairness index of few flows is higher than others for both WMN architectures.Peer ReviewedPostprint (author's final draft

Class-Based Weighted Window for TCP Fairness in WLANs

The explosive growth of the Internet has extended to the wireless domain. The number of Internet users and mobile devices with wireless Internet access is continuously increasing. However, the network resource is essentially limited, and fair service is a key issue in bandwidth allocation. In this research, the focus is on the issue of fairness among wireless stations having different number and direction of flows for different required bandwidth to ensure that fair channel is fairly shared between wireless stations in the same class of bandwidth. It is shown that the current WLANs allocate bandwidth unfairly. It is also identified that the cause of this problem of unfairness is the TCP cumulative ACK mechanism combined with the packet dropping mechanism of AP queue and the irregular space for each wireless station in AP queue. The proposed method allocate converged bandwidth by introducing a Class-Based Weighted Window method which adjusts the TCP window size based on the current conditions of the network and according to the network’s requirements. This method works in wireless stations without requiring any modification in MAC. It can guarantee fair service in terms of throughput among wireless users whether they require the same or different bandwidth.Wireless LAN, TCP, Fairness

IEEE802.11 アドホックネットワークにおける通信制御に関する研究

東京情報大学201

Local heuristic for the refinement of multi-path routing in wireless mesh networks

We consider wireless mesh networks and the problem of routing end-to-end traffic over multiple paths for the same origin-destination pair with minimal interference. We introduce a heuristic for path determination with two distinguishing characteristics. First, it works by refining an extant set of paths, determined previously by a single- or multi-path routing algorithm. Second, it is totally local, in the sense that it can be run by each of the origins on information that is available no farther than the node's immediate neighborhood. We have conducted extensive computational experiments with the new heuristic, using AODV and OLSR, as well as their multi-path variants, as underlying routing methods. For two different CSMA settings (as implemented by 802.11) and one TDMA setting running a path-oriented link scheduling algorithm, we have demonstrated that the new heuristic is capable of improving the average throughput network-wide. When working from the paths generated by the multi-path routing algorithms, the heuristic is also capable to provide a more evenly distributed traffic pattern

Improving the Performance of Wireless LANs

This book quantifies the key factors of WLAN performance and describes methods for improvement. It provides theoretical background and empirical results for the optimum planning and deployment of indoor WLAN systems, explaining the fundamentals while supplying guidelines for design, modeling, and performance evaluation. It discusses environmental effects on WLAN systems, protocol redesign for routing and MAC, and traffic distribution; examines emerging and future network technologies; and includes radio propagation and site measurements, simulations for various network design scenarios, numerous illustrations, practical examples, and learning aids