- Open Access
Effect of network density and size on the short-term fairness performance of CSMA systems
© Koseoglu et al; licensee Springer. 2012
- Received: 31 July 2012
- Accepted: 29 November 2012
- Published: 23 December 2012
As the penetration of wireless networks increase, number of neighboring networks contending for the limited unlicensed spectrum band increases. This interference between neighboring networks leads to large systems of locally interacting networks. We investigate whether the short-term fairness of this system of networks degrades with the system size and density if transmitters employ random spectrum access with carrier sensing (CSMA). Our results suggest that (a) short-term fair capacity, which is the throughput region that can be achieved within the acceptable limits of short-term fairness, reduces as the number of contending neighboring networks, i.e., degree of the conflict graph, increases for random regular conflict graphs where each vertex has the same number of neighbors, (b) short-term fair capacity weakly depends on the network size for a random regular conflict graph but a stronger dependence is observed for a grid deployment. We demonstrate the implications of this study on a city-wide Wi-Fi network deployment scenario by relating the short-term fairness to the density of deployment. We also present related results from the statistical physics literature on long-range correlations in large systems and point out the relation between these results and short-term fairness of CSMA systems.
- Gibbs Measure
- Conflict Graph
- Grid Topology
- Random Topology
- Successive Transmission Probability
Popularity of wireless access technologies manifests itself in the form of ever increasing penetration of wireless local area networks. For example, it is estimated that household penetration of Wi-Fi networks is 61% in the USA, 73% in the UK, and 80% in South Korea as of 2011.
This trend has a number of profound implications, particularly for densely populated urban areas. First, as more Wi-Fi networks that are in close physical proximity share a common spectrum, the amount of spectrum per network drops due to interference. This effect cannot be controlled in unlicensed bands, but its extent may be bounded by estimating the maximum number of neighboring networks that is possible in view of the limited Wi-Fi transmission range.
Second, and more subtly, dense deployment of Wi-Fi networks leads to large systems of weakly interacting networks. That is, while each network contends with its immediate neighbors to access the spectrum, it also interacts obliviously with further away networks through intermediaries that form chains of neighbors. In that case, whether or not the performance of individual networks depend on the size of the alluded system is of critical importance: Because while this latter effect cannot be controlled either, in contrast to the former effect, the system size cannot easily be estimated and tends to be very large in metropolitan areas. Hence, if performance of individual networks indeed degrades persistently with the aggregate system size, then the resulting operating regime would essentially be practically unacceptable under dense deployment of such networks.
The objective of this article is to investigate key parameters that delineate practically relevant regimes of dense spectrum usage. Our focus is on delay-sensitive applications and random spectrum access with carrier sensing (CSMA). Specifically, we seek succinct conditions that predict excessive dependence between channel access delay and system size. Our ultimate interest is in understanding the relationship among throughputs, access delays, and system size; and thereby in identifying throughput levels that entail admissible access delay regardless of the system size.
Using a Markov model, it was recently shown that randomized CSMA is throughput-optimal. That is, if a collection of per-network throughputs in a given system topology can be attained by some transmission scheduling algorithm, then it can also be attained by a randomized CSMA algorithm that operates with appropriate parameters[2, 3]. Such feasible throughputs are coined the throughput region for that system topology. It was also observed that in certain parts of the throughput region CSMA displays short-term unfairness: Namely, theoretically computed throughputs emerge as time averages only if such averages are computed over long-time intervals. Over short-time intervals, however, one constellation of networks in the system tends to enjoy virtually unobstructed channel access whereas the remaining networks starve. Hence, in the short term, channel access is unfair among constituent networks of the system. Although different constellations take effect in the long term interval, this operational regime leads to high temporal variation in access delay. When it exists, this variation becomes more pronounced with increasing system size.
This phenomenon is related to the mixing time of the underlying system dynamics, and in turn to the concept of phase transitions. In statistical physics, phase transition refers to the existence of multiple equilibrium distributions in a graphical model of infinite size. In a finite, pre-limit graphical model, a phase transition typically manifests itself in the form of a unique equilibrium distribution that has multi-modal nature. That is, most of the probability measure is concentrated around several quasi-stable states. Transitions between such states become rare as the system size increases, leading to multiple distinct equilibrium distributions in the limit.
Alternatively, such short-term behavior is suggested by existence of long-range dependence in a graphical system model. In more specific terms, if states of distant nodes in the graph are strongly correlated (either negatively or positively), then such correlation is indicative of the constellations that take effect over short-time horizons.
Our main contributions are as follows:
We claim that the short-term fairness among the interacting wireless transmitters is affected by the degree of the conflict graph of these transmitters if the conflict graph is a random regular graph where each vertex has the same number of neighbors. A denser deployment results in an increase in the number of contending neighbors of a network and our results suggest that the practically useful portion of the throughput region reduces as the number of neighboring networks increases.
We demonstrate the implications of our study on a practical city-wide Wi-Fi deployment scenario. Our results indicate that short-term fairness has to be sacrificed to improve coverage in such a system. To improve coverage, the density of the deployment has to be increased which causes the nodal degree of the system to increase. This in turn reduces short-term fairness.
We discuss if there is a reduction in the performance of interacting networks as the system size increases. Our results suggest that there is a weak dependence on the system size if the density of deployment is kept unchanged and the deployment has a random regular conflict graph. On the other hand, the performance of networks with a grid conflict graph may severely degrade with system size if all networks operate at high throughputs.
We highlight the results from the statistical physics and theoretical computer science literatures on the long-range dependence in physical systems and identify a relationship between CSMA systems and physical systems. Despite the discrepancies between the physical models and the practical networking scenarios, we point out similarities between the short-term fair capacity region and the phase transition thresholds of the physical models.
The remainder of this article is organized as follows: Section 2. surveys related work and Section 3. describes the system model. We explain the short-term fairness metrics that we use in Section 4. A mathematical analysis of the short-term fairness of the tree topology is given in Section 5. Section 6. presents a simulation-based analysis of the tree, grid, and random topologies. Section 7. illustrates the trade-off between short-term fair capacity and coverage for a practical Wi-Fi deployment scenario. Several observations on the relationship between the phase transitions of the hard-core model and the CSMA network are presented in Section 8. A summary and discussion of results are given in Section 9.
The studies that investigate the fairness of a CSMA system can roughly be categorized into two classes: First class of studies deal with the fairness of fixed rate CSMA systems where each transmitter attempts to access the channel at the same rate. Second class of studies investigates the fairness of CSMA systems where the transmitters adapt their channel access rates according to recently proposed distributed CSMA algorithms.
For fixed-rate CSMA systems, unfairness in the long-term average throughputs of transmitters has been investigated. Starvation of an intermediate node in a multi-hop system topology was first noted in. A fundamental cause of the long-term unfairness of CSMA was shown to be the self-organization of transmission patterns. Unfairness in a large CSMA system caused by the unfair advantage of border nodes at high access rates was analyzed in. To eliminate border effects, channel access rates which equalize throughputs are proposed for linear networks and 2 × N grids[9, 10]. Determination of channel access rates which achieves target throughputs is investigated in.
Despite these studies that investigate long-term fairness of a fixed rate CSMA system, there are not many studies that deal with the short-term fairness problem. Short-term fairness of long-term fair grid and line topologies were analyzed briefly in. For a given topology, a method of analysis is proposed using the Markov chain of independent sets but this analysis requires enumeration of all independent sets which is computationally difficult.
Recently, adaptive CSMA algorithms that can achieve throughput optimality have been proposed[2, 3, 13, 14]. These algorithms solve the long-term fairness problem of CSMA systems by adapting the channel access rate of nodes according to their demands. In these algorithms, nodes in an unfair position will increase their channel access probability as their queue lengths grow. This mechanism balances the average throughputs of transmitters in the long run.
However, throughput allocation among transmitters may be unfair in the short term even when the average throughput distribution is fair in the long run. Short-term unfairness becomes more apparent as throughputs increase and, as a result, variation in the channel access delay of transmitters increases. Degradation in the short-term fairness as the throughput optimality is achieved is investigated in. Several bounds for delay are proposed[5, 15–18] and methods for minimizing the delay are devised[19–21]. To reduce delay, appropriate selection of the rate adaptation function is also investigated[22–24].
In this study, we investigate the short-term fairness of a fixed rate CSMA system and investigate the effect of system size, density, and topology on the short-term fairness. Previous studies on fixed-rate CSMA systems are often limited to linear and grid topologies. We study here also random regular topologies that demonstrate very different short-term fairness characteristics from the grid topology. Besides, to the best of the authors’ knowledge, the relationship between the degree of a network and its short-term fairness has not been shown before. We demonstrate that this relationship may result in a trade-off between the coverage and the short-term fairness of a Wi-Fi-based access network.
3.1 System model
We study a system of transmitters distributed over an area. The interference relationships between these transmitters are modeled using a conflict graph in which each node represents a transmitter and two nodes are connected with a link if their corresponding transmitters interfere with each other. We consider two transmitters as interfering if they are in the carrier sensing range of each other. From now on, we use the terms node, transmitter, and access point interchangeably throughout the article.
We study the idealized CSMA model which is analyzed in[2, 6, 25]. In this model, it is assumed that carrier sensing is instantaneous and always successful, which leads to a zero-collision system. Since interfering transmitters cannot be in transmission concurrently in the idealized CSMA model, the set of transmitting nodes at a given time forms an independent set of the conflict graph.
We assume that all transmitters in the system are saturated, that is, transmitters always have data to transmit. Each transmitter in the CSMA system probes the channel at random times according to a Poisson point process and starts transmission when it finds the channel idle. The mean waiting time between two consecutive probing instants, 1/λ, determines the aggressiveness of a transmitter where λ is defined as the probing rate. The lengths of transmissions are exponentially distributed with mean 1.
3.2 Studied conflict graph topologies
In this study, we analyze three different conflict graph topologies: tree, grid, and random regular topologies. In urban areas, independently distributed Wi-Fi networks can be expected to form a fairly random conflict graph. However, in a large campus or corporate network, transmitters may be placed in a more structured manner which may result in a grid conflict graph topology. Although not common in practice, tree topology is suitable for mathematical analysis and it has been commonly used in deriving bounds in the statistical physics literature.
We have also investigated the conflict graph of a mesh deployment of Wi-Fi access points. To cover an area with access points, it has been shown that a mesh deployment provides better coverage than a totally random deployment. In such a deployment, number of conflicting neighbors of an access point is determined by the density of deployment. When the access points interfere with their nearest neighbors, the conflict graph becomes the grid topology described above. As the density increases, the conflict graph becomes a higher-degree graph. We investigate the effect of the density of deployment on short-term fairness and coverage in Section 7.
4.1 Short-term fairness horizon
Short-term fairness horizon is defined as the minimum time required for the transmitters to achieve a fair share of the network. To measure the short-term fairness horizon, network is monitored for a predetermined window duration. If the throughput distribution over the window is not sufficiently fair, the window size is increased. The minimum window size which attains a fair throughput distribution is defined as the short-term fairness horizon. To calculate the short-term fairness horizon, a measure of long-term fairness is needed to determine the point after which the network is considered fair. The most widely used and intuitive long-term fairness measure is the Jain’s fairness index. We consider the network long-term fair when a Jain’s fairness index of 0.95 is achieved. It should be noted that the measured throughputs in simulations are noisy. The particular simulation technique that we use is explained in Section 6.1.
Short-term fairness horizon is originally measured in time units. However, if the probing rates of transmitters are too low, the network converges to equilibrium very slowly. This behavior results in artificially large values for the short-term fairness horizon at low probing rates. Instead of measuring time until fairness, counting the average number of transmissions per transmitter leads to a healthier comparison between different scenarios. This metric normalizes the effect of probing rate allowing a better comparison of the fairness performances at different probing rates. For that reason, we consider the number of transmissions per transmitter required to achieve fairness as the short-term fairness horizon in this study.
4.2 Short-term fair capacity region
For a given conflict graph, throughput of a node refers to the fraction of time that the node transmits, and the throughput region of the conflict graph refers to the collection of achievable per-node throughputs. In this study, we are mainly interested in how much of the throughput region can be achieved within the acceptable limits of short-term fairness. We define this subset of the throughput region as short-term fair capacity region. In order to quantify the short-term fair capacity, a short-term fairness horizon threshold has to be determined such that the network is considered short-term unfair when the short-term fairness horizon is beyond this threshold. In a study which is focused on developing a fair MAC protocol, the authors observed that it takes 80–140 packets per user for the IEEE 802.11 standard to become fair. Considering this result, we select 100 transmissions per node as a threshold for short-term fairness. We also used 50 transmissions per node as another threshold which corresponds to a stricter fairness requirement. However, these choices are not restrictive; the behavior of the capacity region does not significantly change with the selection of the threshold as it will be demonstrated in Section 6.
4.3 Successive transmission probability
Another metric that can be used for measuring short-term fairness is to calculate the probability of a node making a successive transmission before any of its neighbors has a chance to transmit. If this probability is high, it indicates that a node captures the channel for a long time and its neighbors starve during this period.
For a random access protocol, a successive transmission probability of indicates a perfectly short-term fair network where d is the number of neighbors of the node. At the time a node finishes its transmission, it is certain that its neighbors are idle. Including the recently finished node, all of the (d + 1) nodes will probe the channel after waiting for an exponentially distributed duration with mean 1/λ. If the recently finished node probes the channel before all its neighbors, it is certain that it will find the channel idle and it can start another transmission. However, if one of the neighboring nodes probes the channel before the recently finished node, it may not find the channel idle because of its other neighbors. For that reason, the probability of a node to start a successive transmission is higher than the transmission probability of neighboring nodes.
Successive transmission probability is a local measure of short-term fairness which can be computed using the statistics of a single node and its neighbors. Short-term fairness horizon, however, is a global metric which requires states of all nodes have to be taken into account. For that reason, successive transmission probability appears to be a more tractable metric for mathematical analysis. We present an analysis of the short-term fairness of the tree conflict graph using this metric in the next section.
In this section, we develop an approximate fairness model for a tree conflict graph using the successive transmission probability as the fairness metric.
We are interested in determining the probability that a node starts transmission before its neighbors after finishing its transmission. In order to evaluate the successive transmission probability of a node, we refer to Kelly’s work which gives the conditional probability of a node being in transmission when its parent is not transmitting as a function of probing rate. For the tree topology, let p be the probability of the child being idle given that its parent is idle. The value of this probability typically depends on the node, but for large trees nodes that are far from the leaves tend to have similar values due to symmetry. Kelly’s analysis identifies a common value in the limit of an infinite tree, which serves as a convenient approximation for large finite trees. Namely, it is shown that p is the positive solution of and the throughput of each node is when channel access rates of leaf nodes are normalized to compensate for their advantage. Although Kelly’s analysis is carried out for the Cayley tree in which the root node has d children, it extensible for the tree that we study whose root node has d − 1 children.
where 0 < T < 0.5.
T = 0.5 is the maximum achievable throughput by all nodes in the network because it is not possible for more than half of the nodes in the tree to be active concurrently. In this case, once a node has a chance to transmit, it tends to transmit repeatedly at successive probing instants, severely degrading short-term fairness.
The assumption of causes the proposed model to slightly deviate from simulation results which will be analyzed in Section 6.2a.
We now study the effects of several network attributes on short-term fairness. We investigate three different conflict graph topologies: tree, grid, and random regular.
6.1 Simulation method
In this section, we use the short-term fairness horizon as the fairness metric. We also measure the successive transmission probability for the tree topology in order to evaluate the accuracy of proposed analysis.
We measure the short-term fairness horizon in our simulations using the following procedure: we keep a throughput counter for each node; this counter records the total throughput that the node has gained until the current time in the simulation. Using these throughput values, we repeatedly check for the Jain’s index of the network as the simulation continues. If the network achieves a Jain’s index of 0.95, we record the number of completed transmissions per node until that moment as the short-term fairness horizon. At this moment, we reset the counters and again wait for the network to reach a fairness index of 0.95. We sample the short-term fairness horizon 50 times by repeating this procedure and take the average of these values.
In order to measure the short-term fairness horizon, the network has to achieve a fairness index of 0.95 in the long run; that is, it must be long-term fair. To establish long-term fairness, probing rates of nodes have to be adjusted such that all nodes have the same long-term throughput. However, computing the probing rates that result in a fair equilibrium distribution is non-trivial. Although there is a closed form expression for probing rates which equalizes throughputs for the tree topology, there is no such expression for N × N grids and random topologies.
In the simulations of grid and random topologies, we assign the same probing rate to each node and assume that they can achieve a fairness index of 0.95 in the long-run. This assumption is valid for our simulations because all simulations achieved a fairness index of 0.95. Simulating large random topologies is also of help because the effect of locally unfair throughput distributions can be balanced in a large network.
In the tree topology, leaf nodes have an important advantage over the internal nodes; they have a single neighbor whereas internal nodes have d neighbors. For that reason, leaf nodes face less competition and they can gain higher throughputs than internal nodes. Since the leaf nodes form a large portion of nodes in the tree, the probing rates of leaf nodes have to be adjusted such that they have the same throughput with internal nodes. Using the analysis in, we select the probing rates such that the throughput distribution is long-term fair.
6.2 Tree topology
The relationship between fairness and throughput is more relevant for our purposes than the relationship between fairness and probing rate because we are interested in characterizing a practically useful throughput region. Figure3b shows how short-term fairness horizon changes as a function of throughput. At low throughputs, short-term fairness horizon does not depend on d. As the throughput increases, there is a sharp increase in the short-term fairness horizon. The maximum value of the throughput where short-term fairness can be satisfied decreases as d increases. The reason behind this behavior is that the nodes are more dependent on each other in densely connected networks at high throughputs. When the average throughput in the network is low, transmission of a node is rarely prevented by its neighbors. So, nodes behave almost independently and short-term fairness does not depend on the global properties of the system such as the degree. As the probing rates increase, dependence between nodes increases. A node frequently finds the channel busy since at least one of its neighbors is already transmitting. This phenomenon is more apparent in higher degree networks because nodes are more densely connected. So, the nodes in higher-degree topologies starve for a long time at high probing rates that are required for achieving high throughputs.
This relationship between the fairness and the degree of the tree demonstrates an important limitation of random access networks working at high throughput. A centralized scheduler can provide a throughput of 0.5 to all nodes in the tree independent of the degree by alternating transmissions between nodes at even and odd distances to the root node. Since the transmissions are alternated between nodes at each time step, short-term fairness of this scheduler is optimum. On the other hand, fairness of the CSMA network significantly depends on the degree and average throughput of the network.
6.2.1 Successive transmission probability
We now present the mean number of successive transmissions of a node and compare the results with the analysis given in Section 5. We collected transmission statistics of each node during the simulations presented in the previous part. Statistics of only internal nodes are used because leaf nodes have only a single neighbor resulting in different transmission statistics from internal nodes.
Figure6 is very similar to Figure3b which shows that both metrics, short-term fairness horizon and number of successive transmissions, characterize the short-term fairness behavior in a similar manner. Since behaviors of both metrics resemble, we do not present the successive transmission probability statistics in the rest of this article.
6.3 Grid topology
We now examine the short-term fairness properties of the grid topology. Since the degree of the grid topology is fixed at 4 for internal nodes, the only parameter that we investigate is the network size. We simulated the grid topology for n = 50 × 50,100 × 100, and 150 × 150.
Grid topology exhibits undesirable short-term fairness properties mainly because it has two maximal independent sets which correspond to the blacks and whites of the checkerboard pattern. The throughput distribution of the network favors either of these maximal independent sets at high probing rates. Since these maximal independent sets have no elements in common, transition from one to the other occurs rarely at high probing rates resulting in long starvation periods for some nodes.
6.4 Random topology
We now investigate the short-term fairness properties of randomly generated contention graph topologies. For each d, ten random topologies each having 5,000 nodes are generated as described in Section 3.2. Short-term fairness horizon of these topologies are computed for increasing throughputs and averaged to obtain a short-term fairness horizon plot for each d.
These results imply that the performance of a system of randomly placed networks does not degrade with the system size if the number of neighbors is kept fixed. However, as the density, along with d, increases, a performance reduction in the short-term fairness is observed.
6.5 Comparison of different topologies
In contrast to the tree topology, grid topology exhibits high dependency between nodes which results in a poor fairness performance. The active nodes of the grid topology tend to be in one of the two maximal independent sets so that nodes which do not belong to the active transmission pattern wait for a long time to become active. Random topology lies between the tree and the grid topologies in terms of short-term fairness.
This comparison demonstrates that although the network degree is the main determining factor for the short-term fairness, it is not the sole influencing factor. Other characteristics such as the structure of independent sets and network topology may also affect the short-term fairness performance. Also, it should be noted that we here present averages taken over a large number of topologies; however, short-term fairness of each individual topology may not monotonically degrade with d.
Municipal wireless networks become increasingly widespread to provide wireless connectivity for cities. For example, Oklahoma City provides wireless coverage for a 555-square-mile area using 1,100 mesh nodes and 900 mobile nodes. As well as municipalities, private companies are also interested in providing urban wireless coverage. For instance, Google provides city-wide Wi-Fi access for Mountain View, California.
Our findings may have some implications on the performance of such city-wide networks regarding their deployment density. Densely deploying Wi-Fi access points may be required to provide a better coverage of the mobile users. On the other hand, as the density of deployment increases, the number of interfering neighbors of an access point increases, which in turn increases the nodal density of the system. Our analysis indicates that nodal degree of the system inversely affects the short-term fairness of a system of wireless networks. For that reason, there may be a trade-off between the short-term fairness of the system and the deployment density to some extent.
To investigate this relationship, we simulated a 10km × 10km area covered by Wi-Fi access points. Previous studies showed that a regular deployment such as the mesh deployment provides better coverage than a totally random deployment. We here investigate the relationship between the density of deployment and short-term fairness performance of networks.
The results imply that there is a trade-off between the short-term fairness of the network and its coverage. Improving coverage may come at the expense of reducing short-term fairness which should be considered in designing Wi-Fi networks along with other factors such as cost, connectivity, etc.
The idealized CSMA network model closely resembles a simple model of a material which is called as the hard-core model. In this model, particles of the material can be found at the vertices of a lattice graph under the condition that two particles cannot be found at neighboring nodes. This model is equivalent to the ideal CSMA network where two neighboring nodes cannot be active at the same time. So, finding a particle at a given vertex is equivalent to finding a node transmitting in a CSMA network. Recently, the underlying dynamics of the hard-core model has been used to analyze the performance of ideal CSMA[3, 14, 19].
The equivalent of the probing rate in the CSMA network is the fugacity in the hard-core model. As the probing rate of a node increases in the CSMA network, the probability of finding it active increases. Similarly, probability of finding a particle at a given vertex is increased as the fugacity increases. The difference between the idealized CSMA model and the hard-core model is that the individual transmitters in the CSMA model can have different probing rates. In contrast, the fugacity in the hard-core model is a system-wide parameter. So, the equivalent of the hard-core gas model with a given fugacity is a CSMA network where the probing rate of all nodes is equal to the fugacity.
There is substantial literature in statistical physics, and more recently in theoretical computer science, on characterization of conditions under which long-term correlations arise in the hard-core model. On the one hand, this literature is relevant to our purposes due to the alluded relationship between long-range dependence in spatial models and short-term fairness. On the other hand, explicit characterization of these conditions is known to be difficult, and has been achieved only for special graph topologies such as regular trees, which have limited relevance to spatial systems of interacting Wi-Fi networks that may arise in practice. In addition, conventional approach is to characterize such conditions in terms of parameters coined “fugacities” that may roughly be associated with backoff timers in Wi-Fi transmitters. In contrast, since we are interested in identifying the practically useful portion of the throughput region, our goal here is to obtain conditions that are in terms of throughputs.
Since long-range correlations in a CSMA network causes transmission patterns to persist over long time scales, we here investigate if conditions creating long-range correlations have a relationship with the short-term fairness of a CSMA network. We explain two conditions from the literature which corresponds to two different intensities of long range correlations and present simulation results which demonstrate the possible relation between these conditions and the short-term fair capacity.
The first condition which is indicative of long-range correlations in the model is the existence of multiple equilibrium distributions. The second condition which indicates a stronger correlation is the reconstruction condition under which long-range correlations enable the reconstruction of the state of the root node using the states of leaf nodes in the tree as the length of the tree approaches to infinity.
8.1 Uniqueness of a Gibbs measure
Gibbs measure is the equilibrium distribution of a large number of locally interacting particles. Since the interactions between particles are local, Gibbs measure has the Markov property where each node is conditionally independent of the rest of the network given the states of its neighbors. It is known that there exists at least one Gibbs measure satisfying the local conditional distributions. However, the system may also admit multiple measures in an infinite graph under some conditions which is called as phase transition.
The hard-core model on the infinite square lattice, for example, may admit multiple equilibrium distributions. For small λ, there is a unique Gibbs measure on the square lattice. However, it is possible to find two equilibrium distributions for large λ, namely μwhite and μblack. μwhite corresponds to the case where the whites of the checkerboard pattern have a higher probability than the blacks of the checkerboard pattern. μblack corresponds to the opposite case where the blacks are favored over whites.
A phase transition typically manifests itself in the form of a unique equilibrium distribution that has multi-modal nature in a finite graph. That is, most of the probability measure is concentrated around several quasi-stable states. Transitions between such states become rare as the system size increases, leading to multiple distinct equilibrium distributions in the limit.
Previous literature was interested in determining threshold fugacities but they did not consider the stationary probabilities, that is, throughputs that correspond to these thresholds. The uniqueness threshold for the tree topology corresponds to the case where the stationary probability of a node being active is which also follows from. If the throughput of nodes in the tree is less than, the system has a unique measure.
8.2 Reconstruction threshold
A stronger condition that is indicative of long-range correlations between nodes is called the reconstruction condition. Reconstruction problem is interested in characterizing the conditions under which the state of the root can be reconstructed using the states of the leaf nodes as the height of the tree approaches to infinity. Reconstruction property is a stronger condition than having multiple equilibrium distributions.
8.3 Short-term fairness and mixing time
The described conditions occur as a result of increased correlation between the particles in the material. Similarly, short-term fairness of a CSMA network reduces mainly because states of nodes become increasingly correlated which causes some nodes to starve for a long time reducing short-term fairness.
Short-term fairness is thought to be estimated by the mixing time of the underlying system dynamics where mixing time is defined as the time required for the underlying Markov chain to converge to its equilibrium distribution. Convergence to equilibrium slows down if the network sticks to some transmission patterns during the convergence process. For that reason, slow mixing is considered to be an indicator of short-term unfairness.
Previous studies on the mixing time of the hard-core model investigate the conditions of fast mixing. A recent study shows that the fast mixing region extends beyond the uniqueness region and reaches to the reconstruction region for the tree topology. Because of this relationship, we investigate here whether these two thresholds have any implications in determining the region beyond which short-term fairness of the CSMA network starts to deteriorate.
The described uniqueness and reconstruction thresholds are for the tree topology and are in terms of fugacities. We obtain throughputs obtained at these fugacities by performing simulations and compare the results against the short-term fair horizon for the tree topology.
These simulations demonstrate a possible analogy between the phase transitions of the hard-core model and short-term fairness of the CSMA network. In light of the recent research, results showing that the fast mixing threshold of the tree topology extends to the reconstruction threshold, this line of study suggests further research especially for other topologies.
This article was aimed at characterizing the performance of a system of networks employing CSMA protocol under a short-term fairness constraint. Our main findings can be summarized as follows: (1) Short-term fairness significantly depends on the degree of the network: high-degree topologies have less short-term fair capacity than low-degree topologies. (2) Short-term fairness does not depend on network size for reasonably large fixed degree random networks.
Conflict graph topology is an important factor affecting the short-term fair capacity. The grid topology is inherently unfair at high throughputs. When the Wi-Fi transmitters form a grid conflict graph the network may become severely unfair at high throughputs. However, in random conflict graphs, such behavior is not observed so that randomly placed transmitters are unlikely to experience this degradation in short-term fairness.
Dependence of short-term fairness on the degree of the network has implications for deployment of large area Wi-Fi networks. Deploying a dense network improves coverage; however, it reduces short-term fair capacity by increasing the average degree.
We have also presented simulation results which suggest a correlation between the phase transitions of the hard-core model from statistical physics literature to the short-term fairness of the CSMA network. Our results suggest that the reconstruction threshold can be used as a good indicator of the short-term fair capacity region for the tree topology which is in accordance with the recent results on the mixing time.
Our study focuses on fixed-rate CSMA systems where the nodes do not adaptively change their probing rates. Whether a similar short-term unfairness phenomenon will be observed in adaptive CSMA systems is a subject of future study. We conjecture that the short-term unfairness problem may also be observed in adaptive CSMA systems at high loads because the nodes need to probe the channel very frequently resembling a fixed rate system at high loads. Similarly, the extent of short-term unfairness in CSMA-based MAC protocols, such as the 802.11 protocol, has to be investigated.
In addition to further analysis of adaptive CSMA, methods to resolve the short-term fairness problems have to be devised. As our results show, only a portion of the capacity region can be achieved under short-term fairness constraints, so a sacrifice from throughput may be needed to alleviate the short-term unfairness problem in a distributed fashion.
- Thota K: Broadband and Wi-Fi households global forecast 2012. Technical report, Strategy Analytics 2012. . www.strategyanalytics.com/default.aspx?mod=pressreleaseviewer%26a0=5193
- Jiang L, Walrand J: A distributed CSMA algorithm for throughput and utility maximization in wireless networks. In 46th Annual Allerton Conference on Communication, Control, and Computing. (Monticello; 2008.Google Scholar
- Rajagopalan S, Shah D, Shin J: Network adiabatic theorem: an efficient randomized protocol for contention resolution. In SIGMETRICS ’09. (New York, NY, USA (ACM); 2009.Google Scholar
- Liu J, Yi Y, Proutiere A, Chiang M, Poor HV: Towards utility-optimal random access without message passing. Wirel. Commun. Mob. Comput 2010, 10: 115-128. 10.1002/wcm.897View ArticleGoogle Scholar
- Jiang L, Leconte M, Ni J, Srikant R, Walrand J: Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling. In IEEE INFOCOM. (Shanghai; 2011.Google Scholar
- Wang X, Kar K: Throughput modelling and fairness issues in CSMA/CA based ad-hoc networks. In IEEE INFOCOM. (Miami; 2005.Google Scholar
- Durvy M, Dousse O, Thiran P: Self-organization properties of CSMA/CA systems and their consequences on fairness. IEEE Trans. Inf. Theory 2009, 55(3):931-943.MathSciNetView ArticleGoogle Scholar
- Durvy M, Dousse O, Thiran P: On the fairness of large CSMA networks. IEEE J. Sel. Areas Commun 2009, 27(7):1093-1104.View ArticleGoogle Scholar
- van de Ven PM, Borst SC, Denteneer D, Janssen AJ, van Leeuwaarden JS: Equalizing throughputs in random-access networks. SIGMETRICS Perform. Eval. Rev 2010, 38: 39-41. 10.1145/1870178.1870192View ArticleGoogle Scholar
- van de Ven P, van Leeuwaarden J, Denteneer D, Janssen A: Spatial fairness in linear random-access networks. Perform. Eval 2012, 69(3–4):121-134.View ArticleGoogle Scholar
- van de Ven P, Janssen A, van Leeuwaarden J, Borst S: Achieving target throughputs in random-access networks. Perform. Eval 2011, 68(11):1103-1117. 10.1016/j.peva.2011.07.019View ArticleGoogle Scholar
- Kai CH, Liew SC: Temporal starvation in CSMA wireless networks. In IEEE International Conference on Communications (ICC). (Kyoto; 2011.Google Scholar
- Rajagopalan S, Shah D: Distributed algorithm and reversible network. In 42nd Annual Conference on Information Sciences and Systems. (Princeton; 2008.Google Scholar
- Jiang L, Shah D, Shin J, Walrand J: Distributed random access algorithm: scheduling and congestion control. IEEE Trans. Inf. Theory 2010, 56(12):6182-6207.MathSciNetView ArticleGoogle Scholar
- Bouman N, Borst S, van Leeuwaarden J: Achievable delay performance in CSMA networks. In 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton). (Monticello; 2011.Google Scholar
- Shah D, Tse D, Tsitsiklis J: Hardness of low delay network scheduling. IEEE Trans. Inf. Theory 2011, 57(12):7810-7817.MathSciNetView ArticleGoogle Scholar
- Jiang L, Ni J, Srikant R, Walrand J: Performance bounds of distributed CSMA scheduling. In Information Theory and Applications Workshop (ITA). (San Diego; 2010.Google Scholar
- Subramanian V, Alanyali M: Delay performance of CSMA in networks with bounded degree conflict graphs. In IEEE International Symposium on Information Theory. (St. Petersburg; 2011.Google Scholar
- Lotfinezhad M, Marbach P: Throughput-optimal random access with order-optimal delay. In IEEE INFOCOM. (Shanghai; 2011.Google Scholar
- Shah D, Shin J: Delay optimal queue-based CSMA. SIGMETRICS Perform. Eval. Rev 2010, 38: 373-374. 10.1145/1811099.1811093View ArticleGoogle Scholar
- Ni J, Tan B, Srikant R: Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks. In IEEE INFOCOM. (San Diego; 2010.Google Scholar
- Ghaderi J, Srikant R: On the design of efficient CSMA algorithms for wireless networks. In 49th IEEE Conference on Decision and Control (CDC). (Atlanta; 2010.Google Scholar
- Bouman N, Borst SC, van Leeuwaarden JS: Delay performance of backlog based random access. SIGMETRICS Perform. Eval. Rev 2011, 39(2):32-34. 10.1145/2034832.2034839View ArticleGoogle Scholar
- Bouman N, Borst S, van Leeuwaarden J, Proutiere A: Backlog-based random access in wireless networks: fluid limits and delay issues. In 23rd International Teletraffic Congress (ITC). (San Francisco; 2011.Google Scholar
- Boorstyn R, Kershenbaum A, Maglaris B, Sahin V: Throughput analysis in multihop CSMA packet radio networks. IEEE Trans. Commun 1987, 35(3):267-274.View ArticleGoogle Scholar
- Viger F, Latapy M: Efficient and simple generation of random simple connected graphs with prescribed degree sequence. In Computing and Combinatorics, Volume 3595 of Lecture Notes in Computer Science. Edited by: Wang L. Springer, Berlin; 2005.Google Scholar
- Robinson J, Knightly E: A performance study of deployment factors in wireless mesh networks. In IEEE INFOCOM. (Anchorage; 2007.Google Scholar
- Koksal CE, Kassab H, Balakrishnan H: An analysis of short-term fairness in wireless media access protocols (poster session). In ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems. (New York; 2000.Google Scholar
- Jain R, Chiu D, Hawe W: A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. ArXiv Computer Science (e-prints). 1998.Google Scholar
- Cetinkaya C, Orsun F: Cooperative medium access protocol for dense wireless networks. In The Third Annual Mediterranean Ad Hoc Networking Workshop - Med Hoc Net. (Bodrum; 2004.Google Scholar
- Kelly FP: Stochastic models of computer communication systems. J. R. Stat. Soc. Ser. B (Methodological) 1985, 47(3):379-395.MathSciNetMATHGoogle Scholar
- van den Berg J, Steif JE: Percolation and the hard-core lattice gas model. Stoch. Process. Appl 1994, 49(2):179-197. 10.1016/0304-4149(94)90132-5MathSciNetView ArticleMATHGoogle Scholar
- Georgii HO: Gibbs Measures and Phase Transitions. Walter de Gruyter & Co, Berlin; 1988.View ArticleMATHGoogle Scholar
- Dobrushin RL: The problem of uniqueness of a Gibbsian random field and the problem of phase transitions. Funct. Anal. Appl 1968, 2: 302-312.View ArticleMathSciNetMATHGoogle Scholar
- Bhatnagar N, Sly A, Tetali P: Reconstruction threshold for the hardcore model. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, Volume 6302 of Lecture Notes in Computer Science. Edited by: Serna M, Shaltiel R, Jansen K, Rolim J. Springer, Berlin; 2010.Google Scholar
- Restrepo R, Stefankovic D, Vera JC, Vigoda E, Yang L: Phase transition for glauber dynamics for independent sets on regular trees. In 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. (San Francisco; 2011.Google Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.