Final report on the evaluation of RRM/CRRM algorithms

Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin

Performance analysis of a threshold-based dynamic TXOP scheme for intra-AC QoS in wireless LANs

PublishedJournal ArticleThis is the author accepted manuscript. The final version is available from Elsevier via the DOI in this record.The IEEE 802.11e Enhanced Distributed Channel Access (EDCA) protocol has been proposed for provisioning of differentiated Quality-of-Service (QoS) between various Access Categories (ACs), i.e., inter-AC QoS, in Wireless Local Area Networks (WLANs). However, the EDCA lacks the support of the intra-AC QoS provisioning, which is indispensable in practical WLANs since the network loads are always asymmetric between traffic flows of ACs with the same priority. To address the intra-AC QoS issue, this paper proposes a Threshold-Based Dynamic Transmission Opportunity (TBD-TXOP) scheme which sets the TXOP limits adaptive to the current status of the transmission queue based on the pre-setting threshold. An analytical model is further developed to evaluate the QoS performance of this scheme in terms of throughput, end-to-end delay, and frame loss probability. NS-2 simulation experiments validate the accuracy of the proposed analytical model. The performance results demonstrate the efficacy of TBD-TXOP for the intra-AC QoS differentiation. © 2013 Elsevier B.V. All rights reserved

An analytical model for performance evaluation of multimedia applications over EDCA in an IEEE 802.11e WLAN

We extend the modeling heuristic of (Harsha et al. 2006. In IEEE IWQoS '06, pp 178-187) to evaluate the performance of an IEEE 802.11e infrastructure network carrying packet telephone calls, streaming video sessions and TCP controlled file downloads, using Enhanced Distributed Channel Access (EDCA). We identify the time boundaries of activities on the channel (called channel slot boundaries) and derive a Markov Renewal Process of the contending nodes on these epochs. This is achieved by the use of attempt probabilities of the contending nodes as those obtained from the saturation fixed point analysis of (Ramaiyan et al. 2005. In Proceedings ACM Sigmetrics, '05. Journal version accepted for publication in IEEE TON). Regenerative analysis on this MRP yields the desired steady state performance measures. We then use the MRP model to develop an effective bandwidth approach for obtaining a bound on the size of the buffer required at the video queue of the AP, such that the streaming video packet loss probability is kept to less than 1%. The results obtained match well with simulations using the network simulator, ns-2. We find that, with the default IEEE 802.11e EDCA parameters for access categories AC 1, AC 2 and AC 3, the voice call capacity decreases if even one streaming video session and one TCP file download are initiated by some wireless station. Subsequently, reducing the voice calls increases the video downlink stream throughput by 0.38 Mbps and file download capacity by 0.14 Mbps, for every voice call (for the 11 Mbps PHY). We find that a buffer size of 75KB is sufficient to ensure that the video packet loss probability at the QAP is within 1%

VoIP Call Admission Control in WLANs in Presence of Elastic Traffic

VoIP service over WLAN networks is a promising alternative to provide mobile voice communications. However, several performance problems appear due to i) heavy protocol overheads, ii) unfairness and asymmetry between the uplink and downlink flows, and iii) the coexistence with other traffic flows. This paper addresses the performance of VoIP communications with simultaneous presence of bidirectional TCP traffic, and shows how the presence of elastic flows drastically reduces the capacity of the system. To solve this limitation a simple solution is proposed using an adaptive Admission and Rate Control algorithm which tunes the BEB (Binary Exponential Backoff) parameters. Analytical results are obtained by using an IEEE 802.11e user centric queuing model based on a bulk service M=G[1;B]=1=K queue, which is able to capture the main dynamics of the EDCA-based traffic differentiation parameters (AIFS, BEB and TXOP). The results show that the improvement achieved by our scheme on the overall VoIP performance is significant

Adaptive traffic signal control using approximate dynamic programming

This thesis presents a study on an adaptive traffic signal controller for real-time operation. An approximate dynamic programming (ADP) algorithm is developed for controlling traffic signals at isolated intersection and in distributed traffic networks. This approach is derived from the premise that classic dynamic programming is computationally difficult to solve, and approximation is the second-best option for establishing sequential decision-making for complex process. The proposed ADP algorithm substantially reduces computational burden by using a linear approximation function to replace the exact value function of dynamic programming solution. Machine-learning techniques are used to improve the approximation progressively. Not knowing the ideal response for the approximation to learn from, we use the paradigm of unsupervised learning, and reinforcement learning in particular. Temporal-difference learning and perturbation learning are investigated as appropriate candidates in the family of unsupervised learning. We find in computer simulation that the proposed method achieves substantial reduction in vehicle delays in comparison with optimised fixed-time plans, and is competitive against other adaptive methods in computational efficiency and effectiveness in managing varying traffic. Our results show that substantial benefits can be gained by increasing the frequency at which the signal plans are revised. The proposed ADP algorithm is in compliance with a range of discrete systems of resolution from 0.5 to 5 seconds per temporal step. This study demonstrates the readiness of the proposed approach for real-time operations at isolated intersections and the potentials for distributed network control

Performance Analysis and Design of Mobile Ad-Hoc Networks

We focus on the performance analysis and design of a wireless ad-hoc network using a virtual-circuit or reservation based medium access layer. In a reservation based MAC network, source nodes reserve a session's link capacity end-to-end over the entire path before sending traffic over the established path. An example of a generic reservation based MAC protocol is Unifying Slot Assignment Protocol (USAP). Any reservation based medium access protocol (including USAP) uses a simple set of rules to determine the cells or timeslots available at a node to reserve link capacity along the path to the next node. Given inputs of node locations, traffic pattern between nodes and link propagation matrices, we develop models to estimate blocking probability and throughput for reservation based wireless ad-hoc networks. These models are based on extending reduced load loss network models for a wireless network. For generic USAP with multiple frequency channels, the key effect of multiuser interference on a link is modeled via reduced available link capacity where the effects of transmissions and receptions in the link neighborhood are modeled using USAP reservation rules. We compare our results with simulation and obtain good results using our extended reduced load loss network models but with reduced available link capacity distribution obtained by simulation. For the case of generic USAP using a single frequency channel, we develop models for unicast traffic using reduced load loss network models but with the sharing of the wireless medium between a node and its neighbors modeled by considering cliques of neighboring interfering links around a particular link. We compare results of this model with simulation and show good match. We also develop models to calculate source-destination throughput for the reservation MAC as used in the Joint Tactical Radio System to support both unicast and multicast traffic. These models are based on extending reduced load loss network models for wireless multicast traffic with the sharing of the wireless medium between a node and its (upto 2 hop) neighbors modeled by considering cliques of interfering nodes around a particular node. We compare results of this model with simulation and show good match with simulation. Once we have developed models to estimate throughput and blocking probabilities, we use these models to optimize total network throughput. In order to optimize total throughput, we compute throughput sensitivities of the reduced load loss network model using an implied cost formulation and use these sensitivities to choose the routing probabilities among multiple paths so that total network throughput is maximized. In any network scenario, MANETs can get disconnected into clusters. As part of the MANET design problem, we look at the problem of establishing network connectivity and satisfying required traffic capacity between disconnected clusters by placing a minimum number of advantaged high flying Aerial Platforms (APs) as relay nodes at appropriate places. We also extend the connectivity solution in order to make the network single AP survivable. The problem of providing both connectivity and required capacity between disconnected ground clusters (which contain nodes that can communicate directly with each other) is formulated as a summation-form clustering problem of the ground clusters with the APs along with inter-AP distance constraints that make the AP network connected and with complexity costs that take care of ground cluster to AP capacity constraints. The resultant clustering problem is solved using Deterministic Annealing to find (near) globally optimal solutions for the minimum number and locations of the APs to establish connectivity and provide required traffic capacity between disconnected clusters. The basic connectivity constraints are extended to include conditions that make the resultant network survivable to a single AP failure. In order to make the network single AP survivable, we extend the basic connectivity solution by adding another summation form constraint so that the AP network forms a biconnected network and also by making sure that each ground cluster is connected to atleast two APs. We establish the validity of our algorithms by comparing them with optimal exhaustive search algorithms and show that our algorithms are near-optimal for the problem of establishing connectivity between disconnected clusters