基于IEEE 802.11高速无线局域网的速率自适应MAC协议研究

目前的IEEE 802.11标准在物理层提供了对多种发送速率的支持,然而在MAC层却没有规定速率自适应的方法。该文研究了高速IEEE 802.11 无线局域网中的速率自适应方案。首先,提出了EACK协议,EACK使用基本速率发送MAC头,并在ACK帧中携带信道信息,因而能够较快速地响应信道的变化,同时具有少的开销;其次,在EACK基础上,提出了一种恒定发送时间(CEACK)的策略,CEACK能够克服传统IEEE 802.11 DCF MAC协议的理论吞吐量上限,并且具有更好的时间公平性能,能够应用于高速的无线局域网。     

Design of Fair Scheduling Schemes for the QoS-Oriented Wireless LAN

How to simultaneously achieve fairness and quality-of-service (QoS) guarantee in QoS-oriented wireless local area networks (LANs) is an important and challenging issue. Targeting at this goal and jointly taking priority setting, fairness, and cross-layer design into account, four scheduling schemes designed for the QoS-oriented wireless LAN mainly based on concepts of deficit count and allowance are proposed in this paper to provide better QoS and fairness. Using multiple deficit count to interframe space (IFS) and allowance to IFS mappings for different priorities, enhanced distributed deficit round robin (EDDRR) and enhanced distributed elastic round robin (EDERR) schemes are designed to reduce (or even eliminate) possible collisions, while EDDRR with backoff interval and EDERR with backoff interval schemes still keep the backoff procedure but dynamically adjust backoff intervals for nonfailure events (the events excluding collisions and failed transmissions) depending on the priority setting and deficit count or allowance with a cross-layer design. Through extensive numerical examples, we show that the proposed schemes outperform the closest scheduling schemes in the literature and exhibit much better QoS as well as station-level and flow-level fairness.     

Fair Bandwidth Allocation in Optical Burst Switching Networks

Optical burst switching (OBS) is a promising switching technology for next-generation Internet backbone networks. One of the design challenges is how to provide fair bandwidth allocation in OBS networks; the schemes proposed for general store-and-forward IP switching networks can not be used because of the non-buffering and un-fully utilized bandwidth characteristics of OBS networks. We propose a rate fairness preemption (RFP) scheme to achieve approximately weighted max-min fair bandwidth allocation in OBS networks. We present an analysis of the burst loss probability in RFP-based OBS networks. The analysis and simulation results show that the RFP scheme provides fair bandwidth allocation in OBS networks.      

Achieving inter-session fairness for layered video multicast

The Internet is increasingly used to deliver multimedia services. Since there are heterogeneous receivers and changing network conditions, it has been proposed to use adaptive rate control techniques such as layered video multicast to adjust the video traffic according to the available Internet resources. A problem of layered video multicast is that it is unable to provide fair bandwidth sharing between competing video sessions. We propose two schemes, layered video multicast with congestion sensitivity and adaptive join-timer (LVMCA) and layered video multicast with priority dropping (LVMPD), to achieve inter-session fairness for layered video multicast. Receiver-driven layered multicast (RLM), layer-based congestion sensitivity, LVMCA, and LVMPD are simulated and compared. Results show both proposed schemes, especially LVMPD, are fairer and have shorter convergence time than the other two schemes.     

An active queue management scheme based on a capture-recapture model

One of the challenges in the design of switches/routers is the efficient and fair use of the shared bottleneck bandwidth among different Internet flows. In particular, various active queue management (AQM) schemes have been developed to regulate transmission control protocol traffic in response to router congestion. In addition, in order to provide fair bandwidth sharing, these AQM must protect the well-behaved flows from the misbehaving flows. However, most of the existing AQM schemes cannot provide accurate fair bandwidth sharing while being scalable. The key to the scalability and fairness of the AQM schemes is the accurate estimation of certain network resources without keeping too much state information. We propose a novel technique to estimate two network resource parameters: the number of flows in the buffer and the data source rate of a flow by using a capture-recapture (CR) model. The CR model depends on simply the random capturing/recapturing of the incoming packets, and as a result, it provides a good approximation tool with low time/space complexity. These network resource parameters are then used to provide fair bandwidth sharing among the Internet flows. Our experiments and analysis will demonstrate that this new technique outperforms the existing mechanisms and closely approximates the "ideal" case, where full state information is needed.     

TFRC friendliness and the case of ECN

The TFRC protocol has been proposed as a TCP‐friendly protocol to transport streaming media over the Internet. However, its deployment is still questionable because it has not been compared to other important protocols, analysed in the presence of important mechanisms, such as the explicit congestion notification (ECN), and studied under more realistic network conditions. In this paper, we address these three aspects, including other congestion control protocols not considered before in the same investigation, such as TCP Tahoe, Reno, Newreno, Vegas, Sack, GAIMD, and the Binomial algorithms, the effect of using ECN in the friendliness of the protocols, and the fairness of the protocols under static and dynamic network conditions. We found that TFRC can be safely deployed in the Internet if competing with TCP Tahoe, New Reno and SACK since fairness is achieved under all scenarios considered. We also found that ECN actually helps in achieving better fairness. However, fairness problems arise when TFRC competes with TCP Reno, GAIMD, SQRT or IIAD in static or dynamic conditions, or both. We used normalized throughput, fairness index, and convergence time as the main performance metrics for comparison. Copyright © 2004 John Wiley & Sons, Ltd.     

End-to-end TCP-friendly streaming protocol and bit allocation for scalable video over wireless Internet

With the convergence of wired-line Internet and mobile wireless networks, as well as the tremendous demand on video applications in mobile wireless Internet, it is essential to an design effective video streaming protocol and resource allocation scheme for video delivery over wireless Internet. Taking both network conditions in the Internet and wireless networks into account, in this paper, we first propose an end-to-end transmission control protocol (TCP)-friendly multimedia streaming protocol for wireless Internet, namely WMSTFP, where only the last hop is wireless. WMSTFP can effectively differentiate erroneous packet losses from congestive losses and filter out the abnormal round-trip time values caused by the highly varying wireless environment. As a result, WMSTFP can achieve higher throughput in wireless Internet and can perform rate adjustment in a smooth and TCP-friendly manner. Based upon WMSTFP, we then propose a novel loss pattern differentiated bit allocation scheme, while applying unequal loss protection for scalable video streaming over wireless Internet. Specifically, a rate-distortion-based bit allocation scheme which considers both the wired and the wireless network status is proposed to minimize the expected end-to-end distortion. The global optimal solution for the bit allocation scheme is obtained by a local search algorithm taking the characteristics of the progressive fine granularity scalable video into account. Analytical and simulation results demonstrate the effectiveness of our proposed schemes.     

Proportional bandwidth allocation with consideration of delay constraint over IEEE 802.11e-based wireless mesh networks

Wireless mesh networks (WMNs) extend the limited transmission coverage of wireless LANs by enabling users to connect to the Internet via a multi-hop relay service provided by wireless mesh routers. In such networks the quality of experience (QoE) depends on both the user location relative to the Internet gateway and the traffic load. Various channel access or queue management schemes have been proposed for achieving throughput fairness among WMN users. However, delay and bandwidth utilization efficiency of such schemes may be unacceptable for real-time applications. Accordingly, the present study proposes a proportional bandwidth allocation scheme with a delay constraint consideration for enhancing the QoE of users of WMNs based on the IEEE 802.11e standard. An analytical model of the proposed scheme is provided. Moreover, the performance of the proposed scheme is systematically compared with that of existing bandwidth allocation methods. The simulation results show that the proposed scheme outperforms previously proposed schemes in terms of both an improved throughput fairness among the WMN users and a smaller end-to-end transmission delay.     

A cross-layer multihop data delivery protocol with fairness guarantees for vehicular networks

In this paper, a new cross-layer communication protocol for vehicular Internet access along highways is introduced. The objective of the new Controlled Vehicular Internet Access (CVIA) protocol is to increase the end-to-end throughput while achieving fairness in bandwidth usage between road segments. To achieve this goal, the CVIA protocol eliminates contention in relaying packets over long distances. CVIA creates single-hop vehicle clusters and mitigates the hidden node problem by dividing the road into segments and controlling the active time of each segment. Using an analytical throughput estimation model, the protocol parameters are fine-tuned to provide fairness among road segments. Simulation results confirm that the proposed CVIA protocol provides higher throughput and better fairness in multihop data delivery in vehicular networks when compared with purely IEEE 802.11-based protocols.     

A scalable joint routing and scheduling scheme for large-scale wireless sensor networks

The multihop configuration of a large-scale wireless sensor network enables multiple simultaneous transmissions without interference within the network. Existing time division multiple access (TDMA) scheduling schemes exploit gain based on the assumption that the path is optimally determined by a routing protocol. In contrast, our scheme jointly considers routing and scheduling and introduces several new concepts. We model a large-scale wireless sensor network as a tiered graph relative to its distance from the sink, and introduce the notion of relay graph and relay factor to direct the next-hop candidates toward the sink fairly and efficiently. The sink develops a transmission and reception schedule for the sensor nodes based on the tiered graph search for a set of nodes that can simultaneously transmit and receive. The resulting schedule eventually allows data from each sensor node to be delivered to the sink. We analyze our scheduling algorithm both numerically and by simulation, and we discuss the impact of protocol parameters. Further, we prove that our scheme is scalable to the number of nodes, from the perspectives of mean channel capacity and maximum number of concurrent transmission nodes. Compared with the existing TDMA scheduling schemes, our scheme shows better performance in network throughput, path length, end-to-end delay, and fairness index.     

Cross-layer Scheduling Algorithms for IEEE 802.16 Based Wireless Mesh Networks

Wireless mesh network (WMN) is emerging as an important networking architecture for future wireless communications. The mesh mode supported in IEEE 802.16 protocol provides a TDMA solution for WMN, in which scheduling is an important issue. In this paper, we discuss the issues on how to satisfy a set of bandwidth requests in IEEE 802.16 WMNs using minimal radio resources (or solving minimal schedule length problem). In consideration of transmission overhead and adaptive modulation and coding (AMC), two cross-layer scheduling algorithms are proposed, namely max-transmission and priority-based algorithms. In particular, they are proposed based on a physical interference model, instead of a protocol interference model as suggested in the literature. For the priority-based algorithm, we study several priority criteria based on different cross-layer information. An iterative scheme for QoS traffic is introduced to guarantee fairness when traffic load exceeds the network capacity. Simulation results show that our algorithms outperform the existing schemes based on protocol model, and they also ensure better fairness among different nodes.     

Study of an adaptive frame size predictor to enhance energy conservation in wireless sensor networks

Technological advances in low-power digital signal processors, radio frequency (RF) circuits, and micromechanical systems (MEMS) have led to the emergence of wirelessly interconnected sensor nodes. The new technological possibilities emerge when a large number of tiny intelligent wireless sensor nodes are combined. The sensor nodes are typically battery operated and, therefore, energy constrained. Hence, energy conservation is one of the foremost priorities in design of wireless sensor networks (WSNs) protocols. Limited power resources and bursty nature of the wireless channel are the biggest challenges in WSNs. Link adaptation techniques improve the link quality by adjusting medium access control (MAC) parameters such as frame size, data rate, and sleep time, thereby improving energy efficiency. In This work, our study emphasizes optimizing WSNs by building a reliable and adaptive MAC without compromising fairness and performance. Here, we present link adaptation techniques at MAC layer to enhance energy efficiency of the sensor nodes. The proposed MAC uses a variable frame size instead of a fixed frame size for transmitting data. In order to get accurate estimations, as well as reducing the computation complexity, we utilize the extended Kalman filter to predict the optimal frame size for improving energy efficiency and goodput, while minimizing the sensor memory requirement. Next, we designed and verified different network models to evaluate and analyze the proposed link adaptation schemes. The correctness of the proposed theoretical models have been verified by conducting extensive simulations. We also prototype the proposed scheme with the MAC protocol on Berkeley Motes. Both prototype and simulation results show that the proposed algorithms improve the energy efficiency by up to 15%.     

Fair QoS multi-resource allocation for uplink traffic in WLAN

In wireless local area network (WLAN), improving the quality of service (QoS) of users is often at odd with striking fairness among users. In this work, we suggest that in WLAN, multiple types of network resources should be jointly allocated to users to achieve “QoS fairness”, which is a new fairness concept targeting at balancing QoS and fairness in WLAN by allocating multiple types of network resources to users. To this end, we first transform user QoS requirements to multi-resource demands and apply the dominant resource fairness scheme to allocate network resources for each user. We prove several salient QoS-based fairness properties based on a model mapping between QoS and resources. We further discuss about more general conditions for diverse mapping models where QoS fairness properties can be satisfied. We find that the QoS fairness properties can be guaranteed as long as the mapping model meets a few practical requirements, indicating the wide applicability of our scheme. To consolidate our multi-resource allocation scheme, we design a practical protocol for WLAN. The simulation results validate that the QoS fairness can be guaranteed in practical WLAN scenario.     

基于射频能量收集的无线中继网络资源分配

针对现有射频能量收集网络资源分配研究局限于单个数据源场景,无法适配于多数据源网络的问题,提出了一种适用于多数据源场景的射频能量收集中继网络传输协议框架,在该框架内节点可作为源节点或中继节点传输自身数据或转发数据,并在其他节点的数据传输过程中完成射频能量收集。以协议框架为基础,分别以系统吞吐量及用户公平性为优化目标设计两种资源分配方案。仿真表明,两种方案可有效改善网络吞吐量及资源分配公平性。     

REFWA: An Efficient and Fair Congestion Control Scheme for LEO Satellite Networks

This paper examines some issues that affect the efficiency and fairness of the Transmission Control Protocol (TCP), the backbone of Internet protocol communication, in multi-hops satellite network systems. It proposes a scheme that allows satellite systems to automatically adapt to any change in the number of active TCP flows due to handover occurrence, the free buffer size, and the bandwidth–delay product of the network. The proposed scheme has two major design goals: increasing the system efficiency, and improving its fairness. The system efficiency is controlled by matching the aggregate traffic rate to the sum of the link capacity and total buffer size. On the other hand, the system min-max fairness is achieved by allocating bandwidth among individual flows in proportion with their RTTs. The proposed scheme is dubbed Recursive, Explicit, and Fair Window Adjustment (REFWA). Simulation results elucidate that the REFWA scheme substantially improves the system fairness, reduces the number of packet drops, and makes better utilization of the bottleneck link. The results demonstrate also that the proposed scheme works properly in more complicated environments where connections traverse multiple bottlenecks and the available bandwidth may change over data transmission time.     

Quality of service for voice over IP in networks with congestion avoidance

This paper assesses the impact of active queue management schemes on the quality of service of voice over Internet protocol applications. A new analytical method based on a fixed point approach to estimate the end-user satisfaction is proposed. The results obtained were validated using discrete event simulation techniques. In all the studied cases, it was observed a great deal of agreement between the analytical results and the results obtained through simulation. The theoretical predictions, as well as the presented empirical evidences confirm, as demonstrated in previous works, that the use of active queue management offers better quality of service than the traditional queue control mechanisms used in Internet. From these results, we may reasonably conclude that the presented method can be used for network design in the presence of voice traffic.     

Complete architecture and demonstration design for a new combined WiMAX/DSRC system with improved vehicular networking efficiency

This paper provides a detailed architecture and demonstration system for a new combined Worldwide Interoperability for Microwave Access (WiMAX) and Dedicated Short Range Communications (DSRC) network layer design for providing Internet access to vehicles. The overall design consists of subscriber station (SS) vehicles, cluster head relay station (RS) vehicles, WiMAX base stations (BSs), and Internet access gateways (IAGs). Here RSs serve as intermediate relays for serving virtual WiMAX connections to SS vehicles, relying on a WiMAX backend network for Internet connectivity. Simulation results show that our proposed system significantly improves the overall system efficiency as compared to the conventional WiMAX-only system, motivating a design of a complete WiMAX/DSRC Internet access architecture. The first main focus of this paper is on the layer 3 network protocol (L3NP) operating between the access concentrator (AC) in the SS instances and the Network Server (NS) component of an IAG, which provides Internet service to user applications. The second main focus of this paper is on the WiMAX backend network protocol (WBNP) and backend connection networking for handling traffic between the BS nodes and the IAG node providing the L3NP service to the vehicles. Finally, the third main focus of this paper is on the demonstration system design which takes all of the above mentioned elements, namely SS, RS, BS, and IAG modules, network entry functionality, to network protocol settings and behaviour, and implements them in an object-oriented design for accurate scenario performance and feasibility testing. The demonstration system implements tunnelling of protocols in the same way as an actual implementation, but uses virtual network devices for each module to facilitate communications. We provide example use cases for using our proposed architecture design with our provided demonstration system to serve as a useful tool to vehicular communications and networking engineers/researchers, that can be reconstructed and adapted as needed for derivative designs and scenarios.     

A cross-layer framework for multi-layer-video multicast with QoS requirements in multirate wireless networks

We propose a cross-layer framework for efficient multi-layer-video multicast with rate adaptation and quality-of-service (QoS) requirements in multirate wireless networks. We employ time division multiple access at the physical layer to transmit different video layers' data. The multicast sender then dynamically regulates the transmission rate and time-slot allocation based on the channel state information (CSI) and loss QoS requirements imposed by upper protocol layers. Under our proposed cross-layer framework, we first design a rate adaptation algorithm to fulfill the diverse loss QoS requirements for all video layers while achieving high multicast throughput. We then develop a time-slot allocation scheme which synchronizes data transmission across different video layers. Also conducted are simulation results to validate and evaluate our designed adaptive multicasting schemes under the proposed cross-layer framework.     

Throughput enhanced scheduling (TES) scheme for ultra‐dense networks

This paper proposes two novel packet scheduling schemes, called as throughput enhanced scheduling (TES) and TES plus (TES+), for future ultra‐dense networks. These schemes introduce two novel parameters to the scheduling decision making and reformulate the parameters used by the state‐of‐the‐art schemes. The aim is to have a more balanced weight distribution between delay and throughput‐related parameters at scheduling decisions. Also include a new telecommunications related parameter into scheduling decision making that has not been studied by popular schedulers. The performance of novel schemes is compared with well‐known schemes—proportional fairness (PF), exponential/proportional fairness (EXP/PF), and M‐LWDF. For performance evaluation, five performance metrics—average spectral efficiency and delay, quality of service (QoS) violation ratio, jitter, and Jain's fairness index—are investigated. The simulation results show that proposed schemes can outperform all the compared scheduling schemes.     

A near-optimum cross-layered distributed queuing protocol for wireless LAN [medium access control protocols for wireless LANs]

Distributed queuing collision avoidance (DQCA) is a distributed MAC protocol for WLAN systems that offers near optimum performance. The protocol implements a reservation scheme that ensures collision-free data transmissions for high traffic load and switches smoothly and automatically to a random access mechanism when the traffic load is light, improving the delay performance for this situation. In this article the DQCA protocol operation is thoroughly described, and its algorithm rules are given. Furthermore, an enhanced cross-layer scheduling mechanism is also proposed for inclusion in the protocol procedure. This mechanism employs a virtual priority function to reschedule transmissions according to a cross-layer design. Two possible configurations are described in this article by including a PHY-MAC dialog involving channel stale information and the waiting time of the packets in the system, offering a trade-off between throughput maximization and fairness. The performance in terms of throughput and mean delay of DQCA and the two cross-layer schemes has been evaluated through simulations, and a significant enhancement over legacy IEEE 802.11 operation is achieved. The obtained results emphasize the advantages of the proposed schemes and the importance of cross-layer design in wireless communication systems.