Queuing network models for delay analysis of multihop wireless ad hoc networks

In this paper we analyze the average end-to-end delay and maximum achievable per-node throughput in random access multihop wireless ad hoc networks with stationary nodes. We present an analytical model that takes into account the number of nodes, the random packet arrival process, the extent of locality of traffic, and the back off and collision avoidance mechanisms of random access MAC. We model random access multihop wireless networks as open G/G/1 queuing networks and use the diffusion approximation in order to evaluate closed form expressions for the average end-to-end delay. The mean service time of nodes is evaluated and used to obtain the maximum achievable per-node throughput. The analytical results obtained here from the queuing network analysis are discussed with regard to similarities and differences from the well established information-theoretic results on throughput and delay scaling laws in ad hoc networks. We also investigate the extent of deviation of delay and throughput in a real world network from the analytical results presented in this paper. We conduct extensive simulations in order to verify the analytical results and also compare them against NS-2 simulations.     

Distributed Transmit Power Control for Maximizing End-to-End Throughput in Wireless Multi-hop Networks

Wireless multi-hop networks have a solidarity property, in which each multi-hop link interferes mutually and so an increase in one link’s rate results in a decrease of the other links’ rate. In a multi-hop link, the end-to-end throughput between a source and destination is restricted by the lowest link rate, so the max-min fair allocation on the link rates is an optimal strategy to maximize the end-to-end throughput. In this paper, we verify that if the wireless links have a solidarity property, the max-min fair allocation has all link rates equal, so we propose a transmit power control (TPC) algorithm that decides the transmit power of multi-hop nodes to equalize all link rates. The proposed algorithm operates in a distributed manner, where each node averages the recognized link rates around itself, allocates its transmit power to achieve this average rate, and iterates this operation until all link rates become equal. Intensive simulation shows that the proposed TPC algorithm enables all link rates to converge on the same value, and thus maximizes the multi-hop end-to-end throughput while decreasing the power consumption of multi-hop nodes.     

Enabling End-to-End QoS over Hybrid Wired-Wireless Networks

Providing end-to-end parameterized QoS is desirable for many network applications and has received a lot of attention in recent years. However, it remains a challenge, especially over hybrid networks involving both wired networks and wireless access segments (such as IEEE 802.11 Wireless Local Area Networks (WLANs)). The difficulty in achieving such QoS arises mainly because wireless segments often constitute “gaps" in terms of resource guarantee, due to the lack of efficient resource scheduling and management ability over shared wireless media, as well as the lack of an appropriate QoS signaling interface to seamlessly embed these wireless segments into an end-to-end QoS signaling system. In this paper, we consider the scenario where an IEEE 802.11 wireless node wishes to make an end-to-end resource reservation to a remote wired Internet node and vice versa. We propose Wireless Subnet Bandwidth Manager (Wireless SBM), an extension of SBM protocol to WLANs, to provide seamless end-to-end resource reservations. Wireless SBM utilizes the enhanced resource management ability provided by Hybrid Coordination Function (introduced in the upcoming IEEE 802.11e standard) to provide parameterized resource reservation and admission control.     

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.     

A Novel Wireless TCP and its Steady State Throughput Model

1　Introduction　WiththegrowthofwirelessnetworksandtheInter net,thedatatransmissionserviceoverwirelessnet worksbecomesmoreattractive .InthecurrentInternet,TCPiswidelyusedinpopularapplicationslikeTelnet,FTP ,andHTTP .　TCPisareliableconnection oriented protocolthatimplementscongestioncontrolbymeansofaslidingwindowalgorithm .TCPTahoeandReno[1～ 2 ] ,whichmakeuseoftheSlowStart (SS)andCongestionAvoid ance (CA)algorithmstoadjustthewindowsize ,havegotmuchsuccessintheInternet.Inparticular…     

Performance Modelling of TCP Enhancements in Terrestrial–Satellite Hybrid Networks

In this paper, we focus on the performance of TCP enhancements for a hybrid terrestrial–satellite network. While a large body of literature exists regarding modeling TCP performance for the wired Internet, and recently over a single-hop wireless link, the literature is very sparse on TCP analysis over a hybrid wired–wireless (multi-hop) path. We seek to make a contribution to this problem (where the wireless segment is a satellite uplink) by deriving analytical estimates of TCP throughput for two widely deployed approaches: TCP splitting and E2E (End-to-End) TCP with link layer support as a function of key parameters such as terrestrial/satellite propagation delay, segment loss rate and buffer size. Our analysis is supported by simulations; throughput comparisons indicate superiority of TCP splitting over E2E scheme in most cases. However, in situations where end-to-end delay is dominated by terrestrial portion and buffering is very limited at intermediate node, E2E achieves higher throughput than TCP splitting.     

End-to-end fair rate optimization in wired-cum-wireless networks

In this paper, we address the end-to-end rate optimization problem in a wired-cum-wireless network, where CSMA/CA based wireless LANs extend a wired backbone and provide access to mobile users. The objective is to achieve proportional fairness amongst the end-to-end sessions in the network. Since the network contains wireless links whose attainable throughput is a (non-convex and non-separable) function of MAC protocol parameters, the problem requires joint optimization at both the transport and the link layers. A dual-based algorithm is proposed in this paper to solve this cross-layer rate optimization problem. It is implemented in the distributed manner, and works at the link layer to adjust scheduling rates for the wireless links in the basic service sets, and at the transport layer to adjust end-to-end session rates. We prove rigorously that the proposed algorithm converges to the globally optimal rates. Simulation results are provided to support our conclusions.     

Designing multihop wireless backhaul networks with delay guarantees

As wireless access technologies improve in data rates, the problem focus is shifting towards providing adequate backhaul from the wireless access points to the Internet. Existing wired backhaul technologies such as copper wires running at DSL, T1, or T3 speeds can be expensive to install or lease, and are becoming a performance bottleneck as wireless access speeds increase. Longhaul, non-line-of-sight wireless technologies such as WiMAX (802.16) hold the promise of enabling a high speed wireless backhaul as a cost-effective alternative. However, the biggest challenge in building a wireless backhaul is achieving guaranteed performance (throughput and delay) that is typically provided by a wired backhaul. This paper explores the problem of efficiently designing a multihop wireless backhaul to connect multiple wireless access points to a wired gateway. In particular, we provide a generalized link activation framework for scheduling packets over this wireless backhaul, such that any existing wireline scheduling policy can be implemented locally at each node of the wireless backhaul. We also present techniques for determining good interference-free routes within our scheduling framework, given the link rates and cross-link interference information. When a multihop wireline scheduler with worst case delay bounds (such as WFQ or Coordinated EDF) is implemented over the wireless backhaul, we show that our scheduling and routing framework guarantees approximately twice the delay of the corresponding wireline topology. Finally, we present simulation results to demonstrate the low delays achieved using our framework.     

Performance Evaluation of Video,Voice and Web Traffic Over Heterogeneous Access Networks

By simulation using NS-3 we evaluated the performance of voice, video and web traffic sharing a wireless access network connected to a wired core. We compared the performance in terms of end-to-end delay, end-to-end delay variation, average throughput and loss percentage. For the wireless access network, we considered cases when it consisted of a single technology type, e.g., WiFi (IEEE 802.11), WiMAX (IEEE 802.16) and LTE, and when it was heterogeneous, i.e., when the three technologies coexisted and simultaneously shared the same IP core. We attempted to ascertain the impact of this type of heterogeneity on end-to-end performance. It was found that this heterogeneity in the wireless access portion of the network can improve, degrade or have no impact on application performance depending on the network conditions and the application itself. Some key research challenges in Fifth Generation wireless communications are heterogeneous Cloud Radio Access Networks (HC-RANS), backward compatiblity with 4G/3G networks and providing low-latency and QoE. To achieve end-to-end QoS guarantees in such settings the interface with the core must also be addressed, especially when backward compatibility is to be assured. This simulation study attempts to highlight the impact of this type of heterogeneity on network performance.     

分布式队列服务算法在无线网状网包调度中的应用

根据无线网状网的包调度特点,结合已有的差分队列服务算法和分布式贝尔曼-福特算 法,将有线网络中的差分队列服务算法改进为分布式队列服务算法（DQS）,使之实用于无 线网状网中多任务条件下实现系统的吞吐量最大化。仿真实验证明了DQS算法能有效地避免 传统多径传输中的按“类”或 “流”来进行调度的缺陷,有效地减少了数据包的端到端 延时和缓冲区需求,尤其是DQS算法的实际平均吞吐量性能有了很大的提高。     

ARC: the analytical rate control scheme for real-time traffic in wireless networks

Next-generation wireless Internet (NGWI) is expected to provide a wide range of services including real-time multimedia to mobile users. However, the real-time multimedia traffic transport requires rate control deployment to protect shared Internet from unfairness and further congestion collapse. The transmission rate control method must also achieve high throughput and satisfy multimedia requirements such as delay or jitter bound. However, the existing solutions are mostly for the wired Internet, and hence, they do not address the challenges in the wireless environments which are characterized by high bit error rates. In this paper, a new analytical rate control (ARC) protocol for real-time multimedia traffic over wireless networks is presented. It is intended to achieve high throughput and multimedia support for real-time traffic flows while preserving fairness to the TCP sources sharing the same wired link resources. Based on the end-to-end path model, the desired behavior of a TCP source over lossy links is captured via renewal theory. The resulting asymptotic throughput equation is designated as the driving equation for the proposed rate control method. Performance evaluation via simulation experiments reveals that ARC achieves high throughput and meets multimedia traffic expectations without violating good citizenship rules for the shared Internet.     

SDN-based wireless user management system

The degradation of end-to-end quality of service (QoS) on mobile users is becoming a common issue for IEEE 802.11 infrastructure-based networks in crowded areas. This research tackles the issue by employing an SDN framework on an integrated wireless/wired environment. Thereby, we present the development and implementation of a system that performs user management by analyzing the network load from the OpenFlow statistics, as well as the wireless information collected from the associated users. In order to analyse the behaviour of the proposed user migration algorithm, we evaluate the system under scenarios with different traffic load and user session duration. From the experiments, we observed that in several cases wireless users get a considerable QoS improvement at the application layer (up to 30% improvement in throughput and up to 20% in delay in our simulations) once the system is activated. Based on the results, we present an analysis on how and when user migration in multi-access point IEEE 802.11 networks can be most effective.     

Enhanced Active Queue Management for Multi-hop Networks

Wireless networks play a very important role in today’s modern world, convincingly surpassing the wired infrastructure in terms of popularity. Hence, it is important to ensure that services which access wired networks should also be accessible using a wireless network without any performance degradation. One of the most common variants in wireless communications is the Wireless Mesh Network (WMNs). WMNs exploit multi-hop wireless communications between wireless access points. Hence, the effective bandwidth decreases as the number of hops increases in a WMN, thus increasing latency and resulting in reduced performance. This may be due to spatial contention, multipath fading, interference or inefficient queuing mechanisms etc. Here we take queuing mechanisms into consideration and study the QMMN algorithm (Queue Management for Multi-hop Networks) which tends to improve throughput, fairness and reduce global synchronization problems. Based on our study, we implement a modified version of the QMMN algorithm, otherwise called the Enhanced QMMN (EQMMN) algorithm. EQMMN can be considered an effective algorithm which solves the problem of fairness between flows (either responsive or unresponsive) and eventually improves TCP throughput at wireless access points. Our experimental results prove that EQMMN algorithms have better performance characteristics such as throughput (TCP) and fairness index compared to QMMN algorithms.     

Power-aware ad hoc networks with directional antennas: Models and analysis

Directional antennas offer numerous benefits for wireless ad hoc networks, such as extended communication range, better spatial reuse, improved capacity and suppressed interference. In this work, we study analytically the benefits of transmission power control on throughput and energy consumption in a uniformly distributed power-aware ad hoc network where nodes are equipped with directional antennas. We construct an interference model for directional antenna based on a honey grid model to calculate the maximum interference. We further derive a directional collision avoidance model and based on the integrated interference/collision model and signal to interference requirements (SIR), we present the maximum end-to-end throughput under the maximum interference. We further investigate the effect of collision on the energy consumption and propose an energy consumption model that utilizes all aspects of energy wastage.     

An integrated routing and rate adaptation framework for multi-rate multi-hop wireless networks

In this paper, we propose a new integrated framework for joint routing and rate adaptation in multi-rate multi-hop wireless networks. Unlike many previous efforts, our framework considers several factors that affect end-to-end performance. Among these factors, the framework takes into account the effect of the relative positions of the links on a path when choosing the rates of operation and the importance of avoiding congested areas. The key element of our framework is a new comprehensive path metric that we call ETM (for expected transmission cost in multi-rate wireless networks). We analytically derive the ETM metric. We show that the ETM metric can be used to determine the best end-to-end path with a greedy routing approach. We also show that the metric can be used to dynamically select the best transmission rate for each link on the path via a dynamic programming approach. We implement the ETM-framework on an indoor wireless mesh network and compare its performance with that of frameworks based on the popular ETT and the recently proposed ETOP metrics. Our experiments demonstrate that the ETM-framework can yield throughput improvements of up to 253 and 368 % as compared with the ETT and ETOP frameworks.     

AdHoc Probe: end-to-end capacity probing in wireless ad hoc networks

Knowledge of end-to-end path capacity is useful for video/audio stream adaptation, network management and overlay design. Capacity estimation in wired and last-hop wireless networks has been extensively investigated, but a thorough and systematic study in ad hoc, multihop wireless networks is still lacking. Yet the rate of a wireless link can change dynamically (and rapidly) due to changes in interference, distance or energy optimization policy. Timely knowledge of path capacity is key to efficient routing, traffic management and application deployment. In this paper, we present AdHoc Probe, a packet-pair based technique, to estimate end-to-end path capacity in ad hoc wireless networks. We apply AdHoc Probe to path capacity estimation in auto rate wireless networks with variable displacement and interference; and, in remote wireless networks across the Internet. Using analysis, simulation and testbed experiments, we show AdHoc Probe can withstand mobility and is able to trace the rate adaptation of wireless networks timely and correctly. AdHoc Probe is simpler, faster and much less intrusive than current schemes.

A framework for dynamic SLA-based QoS control for UMTS

With the evolution of QoS-capable 3G wireless networks, the wireless community has been increasingly looking for a framework that can provide effective network-independent end-to-end QoS control. In this article we first construct such a framework and then describe how dynamic SLA-based control can be used to achieve end-to-end QoS in a wired and wireless (UMTS) environment. The proposed framework, which is an extension to the IST CADENUS project, offers effective wired-wireless QoS translation, efficient QoS control and management, and dynamic SLA policy-based QoS provisioning.     

Route selection in IEEE 802.11 wireless mesh networks

This paper addresses the problem of route selection in IEEE 802.11 based Wireless Mesh Networks (WMNs). Traditional routing protocols choose the shortest path between two routers. However, recent research reveals that there can be enormous differences between links in terms of quality (link loss ratio, interference, noise etc) and therefore selecting the shortest path (hop count metric) is a poor choice. We propose a novel routing metric—Expected Link Performance (ELP) metric for wireless mesh networks which takes into consideration multiple factors pertaining to quality (link loss ratio, link capacity and link interference) to select the best end-to-end route. Simulation based performance evaluation of ELP against contemporary routing metrics shows an improvement in terms of throughput and delay. Moreover, we propose an extension of the metric called ELP-Gateway Selection (ELP-GS) which is an extension meant for traffic specifically oriented towards the gateway nodes in the mesh network. We also propose a gateway discovery protocol which facilitates the dissemination of ELP-GS in the network. Simulation results for ELP-GS show substantial improvement in performance.     

Optimizing the End-to-End Performance of Reliable Flows over Wireless Links

Pure end-to-end error recovery fails as a general solution to optimize throughput when wireless links form parts of the end-to-end path. It can lead to decreased end-to-end throughput, an unfair load on best-effort networks, and a waste of valuable radio resources. Link layer error recovery over wireless links is essential for reliable flows to avoid these problems. We demonstrate this through an analysis of a large set of block erasure traces measured in different real-world radio environments, with both stationary and mobile hosts. Our analysis is based on a case study of the circuit-switched data service implemented in GSM. We show that the throughput on this wireless channel can be increased by using a larger (fixed) frame size for the reliable link layer protocol. This yields an improvement of up to 25% when the channel quality is good and 18% even under poor radio conditions. Our results suggest that adaptive frame length control could further increase the channel throughput. Finally, we discuss link and transport layer error control mechanisms and their interactions with end-to-end congestion control schemes. For reliable flows, we argue in favor of highly persistent error recovery and lossless handover schemes implemented at the link layer.     

End-to-End Performance Improvement of the Wireless Channel for Video Transmission

Real time video transmission in wireless environment considers various parameters of wireless channel like information rate, error resiliency, security, end-to-end latency, quality of service etc. The available internet protocols are transmission control protocol and user datagram protocol (UDP). But most of the real-time applications uses UDP as their transport protocol. UDP is a fast protocol suitable for delay sensitive applications like video and audio transmission as it does not provide flow control or error recovery and does not require connection management. Due to the tremendous growth in wired and wireless real-time applications, some improvements should be made in the existing systems or protocols. Various techniques to improve end-to-end performance of system for real time video transmission over wireless channel are available in literature. Authors claim that the solution suggested in the paper provide more reliability in wireless video transmission. In the proposed solution, adaptive redundant packets are added in every block (or datagram) transmitted in order to achieve a desired recovery rate at the receiver. The suggested method dose not use any retransmission mechanism. The network simulator NS-2 is used to evaluate the method and the simulation results indicate that the proposed method can guarantee satisfied end-to-end performance by increased packet delivery ratio, reduced end-to-end delay and hence increased network throughput for video transmission in wireless network.