新一代高速无线局域网中用户调度及波束成形算法

针对新一代高速无线局域网IEEE 802.11ac协议的多用户多输入多输出正交频分复用(MU-MIMO OFDM)技术,本文主要研究了该高速无线局域网协议反馈机制下的用户调度及波束成形算法。首先描述了新一代高速无线局域网协议的反馈机制,并给出了基于部分信道状态信息的预编码方法。然后利用新一代高速无线局域网的频率选择性信道环境和用户独占所有带宽的特性,提出了一种综合考虑整个带宽信道状况的基于有限反馈的半正交化用户调度算法。为了降低所提算法的计算复杂度,进而提出了一种基于最大特征值的用户调度算法。分析结果表明所提算法可有效实现多载波情况下的用户调度。数值仿真表明,所提算法相比随机调度算法有一定性能增益。      

802.11WLAN中一种基于循环队列的分布式公平队列调度算法

该文在无线局域网现有的802.11 MAC层访问机制的基础上,运用循环队列的思想提出了一种完全分布式的队列调度算法,该算法通过修改802.11的MAC层中的DCF(Distributed Coordination Function)子协议,实现了在分布式环境下控制802.11节点的公平访问无线链路资源的目的。文中通过仿真对算法进行了分析和研究,仿真结果表明该方法可以在一定范围内实现公平队列调度。     

Marvell发布业界最完整的802.11ax无线产品系列

网络和连接半导体解决方案的领导厂商Marvell公司宣布推出业界最完整的802.11ax无线产品组合。Marvell?的802.11ax新产品系列从架构上提供突破性的性能和更高的网络效率,以及低延迟和企业级的可靠性。Marvell在业界率先提供基于最新IEEE 802.11ax标准的完整MUMIMO和OFDMA上行和下行链路,这将帮助满足下一代内容上传(Generation Upload)等高端用户实时的基于云的需求。     

802.11无线网状网中基于时频信道的准动态信道分配算法

该文首次在多天线多信道802.11无线网状网中提出了时频信道的概念。时频信道是通过在时间和频率两个维度划分无线资源取得的。这种划分方法增加了信道数量,使信道划分更加精细,为提高系统的信道利用率做了准备。在时频信道的基础上,提出了准动态信道分配算法。该算法可以和现有的固定信道分配算法结合,实现准动态信道分配,根据链路上负载变化,取得最大的吞吐量。该算法先根据固定信道分配算法为各链路分配相同数量的时频信道,剩余部分当作公共信道。在通信过程中,各链路首先使用分配给自己的信道和空闲的公共信道。如果分配给一个链路的信道不够,且别的链路上的信道有空闲,该链路还可以暂时使用这些空闲信道。理论分析和仿真结果证明该算法可以有效提高系统的吞吐量。     

IEEE引入新的IEEE802.11ac规范

正据国外媒体报道,IEEE宣布批准IEEE 802.11ac TM-2013,目的是在WLAN上实现更高的多用户传输量。本次修订旨在通过提供高达7Gbps(在5GHz频段)的数据速率改善无线局域网的用户体验,这一速度是之前标准的十倍以上。IEEE 802.11ac规范增加了80MHz和160MHz两个信道带宽,其中包括适用于灵活信道配置的连续和非连续160MHz信道。这增加了形式为256正交幅度调制(QAM)的更高阶的调制,将数据速率提高了33%。     

IEEE 802.11ax核心技术及在IoT的使用场景

IEEE 802.11是无线局域网的一项标准,过去的20多年,IEEE 802.11系列每一代标准的发布,都大幅提高了数据传输速率、优化性能。文章首先回顾了IEEE 802.11系列的发展历史,阐述了每一代标准的特点和功能,重点介绍了IEEE 802.11ax标准的核心技术,包括正交频分多址、多用户-多输入多输出、1024-QAM调制、双频设计技术,阐述了IEEE 802.11ax在智能家居、智慧医疗、智慧城市和智慧农业中的使用场景,最后,展望了IEEE 802.11ax在IoT领域未来的使用场景和发展趋势。     

802.11ax系统中基于传输延迟的多用户调度与资源分配算法

IEEE 802.11ax系统中站点(Station,STA)数量众多和潜在的高数据包冲突率导致无线局域网通信效率显著降低,本文针对上行多用户传输中的无效帧填充问题,以每轮传输中用户组的传输延迟为优化目标,提出一种多用户调度和资源分配算法.基于OFDMA上行调度接入中动态传输时间的帧交互方案,接入点(Access Po...     

MSA在WLAN Mesh网络安全中的应用

随着无线局域网的快速普及,基于IEEE 802.11s的无线Mesh网络也在悄然兴起.然而,针对802.11sMesh网络的安全问题还没有被很好地解决,特别是Mesh节点之间的相互认证和安全链路的建立还没有确定一个适合的安全标准.论文中,作者结合IEEE802.11s的一些草案标准,提出了一种主要基于Mesh安全关联(Mesh Security Association)协议的Mesh网络安全体系架构,并对这种方案进行了安全可行性分析.     

正交频分多址系统中一种面向多业务应用的自适应资源分配算法

针对正交频分多址(OFDMA)系统下行链路多业务自适应调度的问题,该文首先以最大化系统吞吐量为优化目标、每种业务的服务质量(QoS)保证为约束条件,建立了一种通用的多业务自适应资源分配模型。为解决此优化问题,提出了一种具体的自适应资源调度算法。该算法对实时业务按照用户选择最好的信道的原则分配尽可能少的资源以保证其QoS,对非实时业务把尽可能多的剩余资源按照信道选择最好的用户的原则进行分配,充分利用信道资源,提升系统容量。仿真结果表明,该算法保证了下行OFDMA系统吞吐量的同时,在实时业务的延时和丢包率等方面有一定的优越性。     

无线局域网中的OFDM技术

802.11是IEEE最初制定的一个无线局域网(WLAN)标准,主要用于解决办公室局域网和校园网中用户与用户终端的无线接入,业务主要限于数据存取,速率最高只能达到2Mbit/s。由于它在速率和传输距离上都不能满足人们的需要,因此,IEEE小组又相继推出了新的标准。目前802.11b实际上已成为无线局域网     

An Asymmetric Access Point for Solving the Unfairness Problem in WLANs

In a typical deployment of IEEE 802.11 wireless LANs in the infrastructure mode, an access point acts as a bridge between the wireless and the wired part of the network. Under the current IEEE 802.11 DCF access method, which provides equal channel access probability to all devices in a cell, the access point cannot relay all the frames it receives on the downlink. This causes significant unfairness between uplink and downlink flows, long delays, and frame losses. The main problem is that the access point requires more transmission attempt probability than wireless stations for correct operation at the transport layer. In this paper, we propose to solve the unfairness problem in a simple and elegant way at the MAC layer. We define the operation of an Asymmetric Access Point that benefits from a sufficient transmission capacity with respect to wireless stations so that the overall performance improves. The proposed method of operation is intrinsically adaptive so that when the access point does not need the increased capacity, it is used by wireless stations. We validate the proposed access method by simulation to compare it with other solutions based on IEEE 802.11e. Moreover, we provide measurement data gathered on an experimental prototype that uses wireless cards implementing the proposed method.     

Distributed fair scheduling in a wireless LAN

Fairness is an important issue when accessing a shared wireless channel. With fair scheduling, it is possible to allocate bandwidth in proportion to weights of the packet flows sharing the channel. This paper presents a fully distributed algorithm for fair scheduling in a wireless LAN. The algorithm can be implemented without using a centralized coordinator to arbitrate medium access. The proposed protocol is derived from the Distributed Coordination Function in the IEEE 802.11 standard. Simulation results show that the proposed algorithm is able to schedule transmissions such that the bandwidth allocated to different flows is proportional to their weights. An attractive feature of the proposed approach is that it can be implemented with simple modifications to the IEEE 802.11 standard.     

A survey of QoS enhancements for IEEE 802.11 wireless LAN

Quality‐of‐service (QoS) is a key problem of today's IP networks. Many frameworks (IntServ, DiffServ, MPLS etc.) have been proposed to provide service differentiation in the Internet. At the same time, the Internet is becoming more and more heterogeneous due to the recent explosion of wireless networks. In wireless environments, bandwidth is scarce and channel conditions are time‐varying and sometimes highly lossy. Many previous research works show that what works well in a wired network cannot be directly applied in the wireless environment. Although IEEE 802.11 wireless LAN (WLAN) is the most widely used IEEE 802.11 wireless LAN (WLAN) standard today, it cannot provide QoS support for the increasing number of multimedia applications. Thus, a large number of 802.11 QoS enhancement schemes have been proposed, each one focusing on a particular mode. This paper summarizes all these schemes and presents a survey of current research activities. First, we analyze the QoS limitations of IEEE 802.11 wireless MAC layers. Then, different QoS enhancement techniques proposed for 802.11 WLAN are described and classified along with their advantages/drawbacks. Finally, the upcoming IEEE 802.11e QoS enhancement standard is introduced and studied in detail. Copyright © 2004 John Wiley & Sons, Ltd.     

Temporal fairness guarantee in multi-rate wireless LANs for per-flow protection

Wireless LAN technologies such as IEEE 802.11a and 802.11b support high bandwidth and multi-rate data transmission to match the channel condition (i.e., signal to noise ratio). While some wireless packet fair queuing algorithms to achieve the per-flow throughput fairness have been proposed, they are not appropriate for guaranteeing QoS in multi-rate wireless LAN environments. We propose a wireless packet scheduling algorithm that uses the multi-state (multi-rate) wireless channel model and performs packet scheduling by taking into account the channel usage time of each flow. The proposed algorithm aims at per-flow protection by providing equal channel usage time for each flow. To achieve the per-flow protection, we propose a temporally fair scheduling algorithm called Contention-Aware Temporally fair Scheduling (CATS) which provides equal channel usage time for each flow. Channel usage time is defined as the sum of the packet transmission time and the contention overhead time due to the CSMA/CA mechanism. The CATS algorithm provides per-flow protection in wireless LAN environments where the channel qualities of mobile stations are dynamic over time, and where the packet sizes are application-dependent. We also extend CATS to Decentralized-CATS (D-CATS) to provide per-flow protection in the uplink transmission. Using an NS-2 simulation, we evaluate the fairness property of both CATS and D-CATS in various scenarios. Simulation results show that the throughput of mobile stations with stable link conditions is not degraded by the mobility (or link instability) of other stations or by packet size variations. D-CATS also shows less delay and less delay jitter than FIFO. In addition, since D-CATS can coordinate the number of contending mobile stations, the overall throughput is not degraded as the number of mobile stations increases. This work was supported in part by the Brain Korea 21 project of Ministry of Education and in part by the National Research Laboratory project of Ministry of Science and Technology, 2004, Korea.     

A Cross-Layer Framework for Association Control in Wireless Mesh Networks

The user association mechanism specified by the IEEE 802.11 standard does not consider the channel conditions and the AP load in the association process. Employing the mechanism in its plain form in wireless mesh networks we may only achieve low throughput and low user transmission rates. In this paper we design a new association framework in order to provide optimal association and network performance. In this framework we propose a new channel-quality based user association mechanism inspired by the operation of the infrastructure-based WLANs. Besides, we enforce our framework by proposing an airtime-metric based association mechanism that is aware of the uplink and downlink channel conditions as well as the communication load. We then extend the functionality of this mechanism in a cross-layer manner taking into account information from the routing layer, in order to fit it in the operation of wireless mesh networks. Lastly, we design a hybrid association scheme that can be efficiently applied in real deployments to improve the network performance. We evaluate the performance of our system through simulations and we show that wireless mesh networks that use the proposed association mechanisms are more capable in meeting the needs of QoS-sensitive applications.     

A backoff algorithm based on self-adaptive contention window update factor for IEEE 802.11 DCF

The binary exponential backoff (BEB) mechanism is applied to the packet retransmission in lots of wireless network protocols including IEEE 802.11 and 802.15.4. In distributed dynamic network environments, the fixed contention window (CW) updating factor of BEB mechanism can’t adapt to the variety of network size properly, resulting in serious collisions. To solve this problem, this paper proposes a backoff algorithm based on self-adaptive contention window update factor for IEEE 802.11 DCF. In WLANs, this proposed backoff algorithm can greatly enhance the throughput by setting the optimal CW updating factor according to the theoretical analysis. When the number of active nodes varies, an intelligent scheme can adaptively adjust the CW updating factor to achieve the maximal throughput during run time. As a result, it effectively reduces the number of collisions, improves the channel utilization and retains the advantages of the binary exponential back-off algorithm, such as simplicity and zero cost. In IEEE 802.11 distributed coordination function (DCF) protocol, the numerical analysis of physical layer parameters show that the new backoff algorithm performance is much better than BEB, MIMD and MMS algorithm.     

A spatial clustering group division-based OFDMA access protocol for the next generation WLAN

The next generation wireless local area network (WLAN) needs to significantly improve the area throughput in high-dense deployment scenario. Orthogonal frequency division multiple access (OFDMA), considered as the key technology of the next generation WLAN, has been adopted by IEEE 802.11ax. However, most existing studies have one tricky problem: interference extension problem, i.e., the stations (STAs) placed at dispersive locations from one basic service set (BSS) access channel and transmit data simultaneously through OFDMA, thereby interfering a large area and suppressing the potential transmissions around this BSS. Unfortunately, high-dense deployment scenario exacerbates interference extension problem. This article proposes a spatial clustering group division-based OFDMA (SCGD-OFDMA) protocol, which enables the geographically close STAs to form spatial clustering groups, named SCGs. Each SCG has a leader STA and several member STAs. Each SCG’s leader STA contends for channel resources. After that, the leader STAs that successfully contending channel are scheduled by the access point one by one to trigger its member STAs to transmit uplink data by using OFDMA. Therefore, the geographical interference area is reduced and the area throughput is improved since the concurrent STAs in one SCG are located in limited area. This article theoretically analyzes the optimal SCG establishment, and throughput and area throughput of SCGD-OFDMA. Theoretical analysis is consistent with simulation results. The simulation results also show that when the number of STAs is 200 and all resource units are used for random access, SCGD-OFDMA outperforms IEEE 802.11ax and OMAX in area throughput by 56.13% and 190.97%, respectively.

     

On-line learning algorithm for dynamic sensitivity control in IEEE 802.11ax network

The popularity of IEEE 802.11 based Wireless Local Area Network (WLAN) increased significantly in recent years and resulted in the dense deployment of WLANs. While densification can contribute to increasing coverage, it could also lead to increasing interference and cannot insure high spatial reuse due to the current physical carrier sensing of IEEE 802.11. To tackle these challenges, the dynamic sensitivity control (DSC) is considered in IEEE 802.11ax, which dynamically selects the appropriate carrier sensing threshold (CST) to improve spectrum efficiency and enhance spatial reuse in densely deployed network. A dynamic Q-learning based CST selection method is proposed to enable a network to select the optimal CST according to the channel condition. Simulation results show that the propsoed scheme provides 40% aggregate throughput gain of a dense network when compared with legacy IEEE 802.11.     

Improving throughput through dynamically tuning contention window size in dense wireless network

With the boom of wireless devices, the number of wireless users under wireless local area networks (WLANs) has increased dramatically. However, the standard backoff mechanism in IEEE 802.11 adopts fixed initial contention window (CW) size without considering changes of network load, which leads to a high collision probability and low channel utilization in bursty arrivals. In this paper, a novel CW dynamic adjustment scheme is proposed to achieve high throughput performance in dense user environment. In the proposed scheme, the initial CW size is dynamically adjusted to optimum according to the measured packet collision probability. Simulation results show that the proposed scheme can significantly improve the throughput performance.