On scaling the IEEE 802.11 to facilitate scalable wireless networks

The IEEE 802.11 MAC protocol has gained widespread popularity and has been adopted as the de-facto layer 2 protocol for wireless local area networks (WLANs). However, it is well known that as the number of competing stations increases, the performance of the protocol degrades dramatically. Given the explosive growth in WLANs’ usage, the question of how to sustain each user’s perceived performance when a large number of competing stations are present, is an important and challenging open research problem.Motivated by this, in this paper we analyze the behavior of 802.11-based WLANs as the number of competing stations increases, and attempt to provide concrete answers to the following fundamental questions: (i) is there a set of system and protocol parameters that we can scale in order to sustain each individual user’s perceived performance, and (ii) what is the minimum scaling factor?Using theoretical analysis coupled with extensive simulations we show that such a set of parameters exists, and that the minimum scaling factor is equal to the factor by which the number of users increases. Our results reveal several important scaling properties that exist in today’s 802.11-based wireless networks, and set guidelines for designing future versions of such networks that can efficiently support a very large number of users.     

Competitive Call Control in Mobile Networks

Abstract. In this paper we deal with competitive local on-line algorithms for non-preemptive channel allocation in mobile networks. The signal interferences in a network are modeled using an interference graph G . We prove that the greedy on-line algorithm is Δ -competitive, where Δ is the maximum degree of G . We employ the ``classify and randomly select" paradigm [5], [17], and give a 5 -competitive randomized algorithm for the case of planar interference graphs, a 2 -competitive randomized algorithm for trees, and a (2c) -competitive randomized algorithm for graphs of arboricity c . We also show that the problem of call control in mobile networks with multiple available frequencies reduces to the problem of call control in mobile networks with a single frequency. Using this reduction, we present on-line algorithms for general networks with a single frequency. We give a local on-line algorithm which is (α (δ +1 + α )/(1/2+α ) ² )-competitive, where α is the independence number of G , and δ is the average degree of G . The above results hold in the case when the duration of each request is infinite, and the benefit the algorithm gains by accepting each request is equal to one. They are extended to handle requests of arbitrary durations, and arbitrary benefits.     

A Statistical Metadata Model for Simultaneous Manipulation of both Data and Metadata

There is a growing demand for more cost-efficient production processes in Statistical Institutes. One way to address this need is to equip Statistical Information Systems (SIS) with the ability to automatically produce statistical data and metadata of high quality and deliver them to the user via the Internet. Current approaches, although provide for the storage of appropriate metadata, do not use process metadata for guiding the production process. In this paper we present an approach on creating SISs that permits metadata-guided statistical processing based on an object-based, statistical metadata model. The model is not domain specific and can accommodate both microdata and macrodata. We have equipped the model with a set of transformations that can be used to automatically manipulate data and metadata. We show the applicability of transformations with some examples using actual statistical data for R&D expenditures. Finally, we demonstrate how the presented framework can be exploited for the construction of a web site that offers ad hoc query capabilities to the users of statistical data.     

Performance analysis of BitTorrent-like systems with heterogeneous users

Among all peer-to-peer (P2P) systems, BitTorrent seems to be the most prevalent one. This success has drawn a great deal of research interest on the system. In particular, there have been many lines of research studying its scalability, performance, efficiency, and fairness. However, despite the large body of work, there has been no attempt mathematically to model, in a heterogeneous (and hence realistic) environment, what is perhaps the most important performance metric from an end user’s point of view: the average file download delay.

In this paper we propose a mathematical model that accurately predicts the average file download delay in a heterogeneous BitTorrent-like system. Our model is quite general, has been derived with minimal assumptions, and requires minimal system information. Then, we propose a flexible token-based scheme for BitTorrent-like systems that can be used to tradeoff between overall system performance and fairness to high bandwidth users, by properly setting its parameters. We extend our mathematical model to predict the average file download delays in the token- based system, and demonstrate how this model can be used to decide on the scheme’s parameters that achieve a target performance/fairness.     

Mapping objects

We present a technique that is based on volatile mapping objects and enables wrappers-based mediation architectures to describe bi-directional (read–write) interschema mappings of multiple, disparate data sources. We describe the structure of these mapping objects, explain how they work, and compare them to other traditional techniques used for describing schema mappings in data-mediation systems.     

A tetrachromatic model for colorimetric use in mesopic vision

In this article, a tetrachromatic colorimetric model is proposed. Four monochromatic stimuli are used as primaries instead of three to achieve colorimetric matches in mesopic vision. Tetrachromatic colorimetric matches are assumed in such a way so as to hold in both the photopic and the scotopic levels of adaptation. The fourth primary helps to balance the rod contribution in mesopic vision. The proposed model is based on the experimental observations that (a) trichromatic matches can be achieved in any light level and (b) once a tetrachromatic match is made, it holds at all radiances. The main outcome is that (a) only three channels in human vision system are important for color matching at mesopic and photopic levels and (b) additivity can be preserved at all levels once rod input is taken into account. © 2010 Wiley Periodicals, Inc. Col Res Appl, 2011