Analysis of Enhanced Collision Avoidance Scheme Proposed for IEEE 802.11e-Enhanced Distributed Channel Access Protocol

In enhanced distributed channel access (EDCA) protocol, small contention window (CW) sizes are used for frequent channel access by high-priority traffic (such as voice). But these small CW sizes, which may be suboptimal for a given network scenario, can introduce more packet collisions, and thereby, reduce overall throughput. This paper proposes enhanced collision avoidance (ECA) scheme for AC_VO access category queues present in EDCA protocol. The proposed ECA scheme alleviates intensive collisions between AC_VO queues to improve voice throughput under the same suboptimal yet necessary (small size) CW restrictions. The proposed ECA scheme is studied in detail using Markov chain numerical analysis and simulations carried out in NS-2 network simulator. The performance of ECA scheme is compared with original (legacy) EDCA protocol in both voice and multimedia scenarios. Also mixed scenarios containing legacy EDCA and ECA stations are presented to study their coexistence. Comparisons reveal that ECA scheme improves voice throughput performance without seriously degrading the throughput of other traffic types.     

Modified Distributed Laxity Based Priority Scheduling Scheme

This paper proposes a medium access control (MAC) protocol for mobile Adhoc networks (MANET). The MAC layer is responsible for selecting the next packet to be transmitted and the timing of its transmission. Various new factors are introduced to determine the priority of the flow. The back-off mechanism devised by us grants node access to the channel based on the rank of its highest priority packets. It is clear that the proposed algorithm works better than the existing distributed laxity based priority-scheduling scheme and the same is proven using the simulation results using Glomosim.     

A Differentiated Service Model for Enhanced Distributed Channel Access (EDCA) of IEEE 802.11e WLANs

In this paper, we propose a new differentiated service model, referred to as Differentiated Service-EDCA (DS-EDCA), for the Enhanced Distributed Channel Access (EDCA) of IEEE 802.11e wireless local area networks (WLANs). With DS-EDCA, both strict priority and weighted fair service can be provided. The strict priority service is provided for high priority traffic through carefully setting the EDCA parameter sets of lower priority traffic; the proportional fairness service is enabled by determining the backoff intervals according to the distributed scheduling discipline (DFS). We also propose a hierarchical link sharing model for IEEE 802.11e WLANs, in which AP and mobile stations are allocated different amounts of link resource. The performance of DS-EDCA and EDCA is compared via ns-2 simulations. The results show that DS-EDCA outperforms the original EDCA in terms of its support for both strict priority and weighted fair service. More importantly, DS-EDCA can be easily implemented, and is compatible to the IEEE 802.11 Standard.

一种公平输入排队调度算法

输入排队交换结构以其良好的可扩展性被越来越多的高速交换机和路由器所采用。当前的调度算法大都以牺牲公平性来换取最大的吞吐量。但随着对QoS支持的要求增强,适用于输入排队交换结构的高效、公平的调度算法成为迫切需要解决的问题。该文提出了一种具有公平性保证的基于虚服务量的公平调度算法。理论分析和计算机仿真都表明算法在信元时延和公平性方面都能提供较好的保证。算法还具有与iSLIP相同的较低通信开销,以及和iLQF相同的算法复杂度。因此,算法具有较好的实用性。     

Distributed Priority Scheduling and Medium Access in Ad Hoc Networks

Providing Quality-of-Service in random access multi-hop wireless networks requires support from both medium access and packet scheduling algorithms. However, due to the distributed nature of ad hoc networks, nodes may not be able to determine the next packet that would be transmitted in a (hypothetical) centralized and ideal dynamic priority scheduler. In this paper, we develop two mechanisms for QoS communication in multi-hop wireless networks. First, we devise distributed priority scheduling, a technique that piggybacks the priority tag of a node's head-of-line packet onto handshake and data packets; e.g., RTS/DATA packets in IEEE 802.11. By monitoring transmitted packets, each node maintains a scheduling table which is used to assess the node's priority level relative to other nodes. We then incorporate this scheduling table into existing IEEE 802.11 priority backoff schemes to approximate the idealized schedule. Second, we observe that congestion, link errors, and the random nature of medium access prohibit an exact realization of the ideal schedule. Consequently, we devise a scheduling scheme termed multi-hop coordination so that downstream nodes can increase a packet's relative priority to make up for excessive delays incurred upstream. We next develop a simple analytical model to quantitatively explore these two mechanisms. In the former case, we study the impact of the probability of overhearing another packet's priority index on the scheme's ability to achieve the ideal schedule. In the latter case, we explore the role of multi-hop coordination in increasing the probability that a packet satisfies its end-to-end QoS target. Finally, we perform a set of ns-2 simulations to study the scheme's performance under more realistic conditions.     

A Distributed Channel Access Protocol for Ad Hoc Networks with Feedback Power Control

Distributed power control schemes are extensively employed in the cellular networks and are capable of improving the capacity of the network. However, the power control schemes from the cellular networks suffer from performance degradation due to self and direct-interference and hidden-terminal problems when directly employed in ad hoc networks. Most of the existing channel reservation-based power control protocols for ad hoc networks employ incremental power allocation rather than global allocation of the power to the incoming links; thus, they may not effectively utilize the spatial frequency reuse in the network. This paper presents a distributed channel access protocol that couples the channel reservation and the iterative/global transmission power control schemes in ad hoc networks. The designed protocol considers the convergence problem of the global power control in ad hoc networks. The designed access criteria employ the local admission control based on the sufficient criteria for admissibility and global power control for balancing the SIR (signal to interference ratio) of the links. In the performance evaluation study of the designed protocol, an almost twofold increase in the throughput and capacity is observed compared to the existing power-controlled protocol for ad hoc networks.     

A Distributed Opportunistic Access Scheme and its Application to OFDMA Systems

Multiuser systems can provide multiuser diversity gains by assigning channels to users with higher channel gains. To avoid the extensive information exchange with the access point for the uplink access in centralized approaches, we propose in this paper a distributed opportunistic access scheme. Through a judicious design of a novel backoff mechanism to utilize the channel information and reduce collisions, significant multiuser diversity gains are achieved. To a user, the higher the channel gain is, the smaller the backoff time-slot and, hence, the higher the access priority of that user is. In addition, for heterogeneous systems, our proposed scheme can realize multiuser diversity gains and achieve fairness among the users at the same time. Finally, we design two distributed opportunistic access schemes for OFDMA systems. Users contend on all sub-channels in the first scheme and only on several strongest sub-channels in the second scheme. Compared with traditional centralized OFDMA systems and other distributed access schemes, our proposed schemes reduce overhead and achieve a higher throughput.     

A Beacon-Based Collision-Free Channel Access Scheme for IEEE 802.11 WLANs

In IEEE 802.11 based WLAN standard, distributed coordination function is the fundamental medium access control (MAC) technique. It employs a CSMA/CA with random binary exponential backoff algorithm and provides contention-based distributed channel access for stations to share the wireless medium. However, performance of this mechanism drops dramatically due to random structure of the backoff process, high collision probability and frame errors. That is why development of an efficient MAC protocol, providing both high throughput for data traffic and quality of service (QoS) support for real-time applications, has become a major focus in WLAN research. In this paper, we propose an adaptive beacon-based collision-free MAC adaptation. The proposed scheme makes use of beacon frames sent periodically by access point, lets stations enter the collision-free state and reduces the number of idle slots regardless of the number of stations and their traffic load (saturated or unsaturated) on the medium. Simulation results indicate that the proposed scheme dramatically enhances the overall throughput and supports QoS by reducing the delay, delay variation and dropping probability of frames.     

分布式认证智能电网访问控制模型的研究

为实现智能电网数据的安全汇总和访问控制的有效结合,在同态加密的基础上,结合陷门秘密分享技术,提出一种基于多方认证的智能电网访问控制方案。通过对智能电表中数据密文进行同态加密处理,保证数据从智能电表到变电站传输过程的安全,同时对汇总的密文数据进行属性化,可实现对数据访问者的多方认证访问控制。实验数据结果表明,该方案具有可行性和实用性。     

支持优先级与公平策略的队列规程

首先介绍了队列调度算法在流量控制中的关键地位,然后讨论了现有队列调度算法,如基于优先级的调度算法、轮询调度算法与公平队列调度算法,最后提出了一种新的队列规程,该队列规程融合了优先级调度算法与DRR调度算法。在网络正常情况下,不同业务流公平地共享网络带宽,在网络出现拥塞的情况下,高优先级业务流能够抢占带宽,保证其较低的丢包率,并能够实现两种调度算法的快速切换。     

Distributed Detection in Wireless Sensor Networks Using A Multiple Access Channel

Distributed detection in a one-dimensional (1-D) sensor network with correlated sensor observations, as exemplified by two problems-detection of a deterministic signal in correlated Gaussian noise and detection of a first-order autoregressive [AR(1)] signal in independent Gaussian noise, is studied in this paper. In contrast with the traditional approach where a bank of dedicated parallel access channels (PAC) is used for transmitting the sensor observations to the fusion center, we explore the possibility of employing a shared multiple access channel (MAC), which significantly reduces the bandwidth requirement or detection delay. We assume that local observations are mapped according to a certain function subject to a power constraint. Using the large deviation approach, we demonstrate that for the deterministic signal in correlated noise problem, with a specially chosen mapping rule, MAC fusion achieves the same asymptotic performance as centralized detection under the average power constraint (APC), while there is always a loss in error exponents associated with PAC fusion. Under the total power constraint (TPC), MAC fusion still results in exponential decay in error exponents with the number of sensors, while PAC fusion does not. For the AR signal problem, we propose a suboptimal MAC mapping rule which performs closely to centralized detection for weakly correlated signals at almost all signal-to-noise ratio (SNR) values, and for heavily correlated signals when SNR is either high or low. Finally, we show that although the lack of MAC synchronization always causes a degradation in error exponents, such degradation is negligible when the phase mismatch among sensors is sufficiently small     

Priority and Collision Detection with Active Signaling - The Channel Access Mechanism of HIPERLAN

HIPERLAN will provide a 23.5 Mbps data rate transmission to radio channel user. The medium access control is based on carrier sense (CSMA) and on active signaling. Active signaling is an original feature which makes it possible to merge priority contention and collision detection into an elegant and efficient channel access mechanism. In particular it is expected to boost the performance of HIPERLAN above the level of IEEE 8802.3 standard (Ethernet). It also gives the opportunity to mix time constraint traffics (like voice) with non-time constraint traffics (data) by making use of access priorities.     

Analysis and optimisation of the HIPERLAN Channel Access Contention Scheme

This paper analyses the HIPERLAN channel access mechanism. Both a purely mathematical and a simulation model are built in order to evaluate the two successive phases of the contention scheme. Several optimisations, based on the choice of parametric values, are proposed, evaluated and compared.     

Modeling and Performance Evaluation of the IEEE 802.15.4K CSMA/CA with Priority Channel Access Mechanism Under Fading Channel

Wireless Personal Communications - The IEEE 802.15.4 is a well-known standard that is widely utilized for Wireless Sensor Networks due to its low rate and energy efficiency. A novel amendment IEEE...     

An Adaptive Learning Scheme for Medium Access with Channel Reservation in Wireless Networks

Providing effective medium access for wireless networks is a challenging task. Most of the existing protocols of IEEE 802.11 Medium Access Control (MAC) work towards the goal of achieving effective channel access by developing various backoff procedures. In this paper, we make an attempt to develop a new medium access protocol named Learning Automata (LA) based Wireless Channel Reservation (LAWCR). We use an LA approach to implement reservation for channel access for single hop wireless networks. Also, sequence procedure is used to improve the reservation mechanism. The performance of the proposed LAWCR scheme show significant improvements over the legacy DCF protocol with respect to important criteria such as the average time spent in the buffer and the throughput.     

具有QoS保证的分布式服务组合策略

现有的服务组合方法多是获取候选服务节点的信息,在集中式组合引擎上搜索路径.这种集中式方法不仅具有单点失效、可扩展性差等缺点,而且候选服务的QoS没有保证,服务搜索空间过大,组合效率较低.文章提出了一种分布式的服务组合方法(BDDSC),将分散在网络中性能有保证的服务节点构建成服务覆盖网络,使各个节点协作执行进行动态服务...     

HFC上行信道的通信容量与多址接入方案的比较

HFC上行通信是构建宽带HFC接入网的关键。本文将SCDMA多址接入方案引入HFC通信系统中,在对HFC信道分析的基础上,通过建立Simulink仿真模型比较了SCDMA与TDMA的性能。     

Channel Access Scheme for MIMO-Enabled Ad Hoc Networks with Adaptive Diversity/Multiplexing Gains

Transmission power control (TPC) is used in wireless networks to improve channel reuse and/or reduce energy consumption. It has been often applied to single-input single-output (SISO) systems, where each node is equipped with a single antenna. Multi-input multi-output (MIMO) systems can improve the throughput or the signal-to-noise ratio (SNR) by providing multiplexing or diversity gains, respectively. In this paper, we incorporate a power-controlled MAC protocol for a wireless network with two antennas per node. Our protocol, coined CMAC, combines different types of MIMO gains, allowing for dynamic switching between diversity and multiplexing modes so as to maximize a utility function that depends on both energy consumption and throughput. CMAC adapts the “antenna mode,” the transmission power, and the modulation order on a per-packet basis. By “antenna mode” we mean one of five possible transmit/receive antenna configurations: 1 × 1 (SISO), 2 × 1 (MISO-D), 1 × 2 (SIMO-D), 2 × 2 (MIMO-D), and 2 × 2 (MIMO-M). The second, third, and fourth configurations offer a diversity gain, whereas the last configuration offers a multiplexing gain. By using control packets to bound the transmission power of potentially interfering terminals, CMAC allows for multiple interference-limited transmissions to take place in the vicinity of a receiving terminal. We study via simulations the performance of CMAC in ad hoc topologies. Our results indicate that relative to non-adaptive protocols, CMAC achieves a significant improvement in both the overall energy consumption and the throughput.

分布式Alamouti空时码的信道容量及最优资源分配方案

该文针对基于译码转发协议的分布式Alamouti空时码(DF-DASTC)系统的信道容量以及最优资源分配策略问题。利用退化中继信道模型,推导得到了DF-DASTC系统在衰落信道下的信道容量闭式解。以DF-DASTC信道容量最大化为目标,对该系统在固定带宽分配时,中继及信源节点的最优功率分配方案进行了研究,推导得到了DF-DASTC系统的最优功率分配方案的闭式解。利用凸优化理论,将以DF-DASTC信道容量最大化为目标函数的多目标优化问题转换为非线性不等式约束的单目标凸优化问题,进一步得到了可变带宽分配时的DF-DASTC系统的最优带宽和功率分配策略。理论分析和系统仿真表明,该文所提出的资源分配策略,比平均分配的资源方案具有更大的信道容量。另外,该文的最优资源分配策略适用于具有多个中继节点的无线中继网络,具有普适性。