We obtain an association policy for STAs in an IEEE 802.11 WLAN by taking into account explicitly two aspects of practical importance: (a) TCP-controlled short file downloads interspersed with read times (motivated by web browsing), and (b) different STAs associated with an AP at possibly different rates (depending on distance from the AP). Our approach is based on two steps. First, we consider an analytical model to obtain the aggregate AP throughput for long TCP-controlled file downloads when STAs are associated at k different rates r1, r2, : : :, rk; this extends earlier work in the literature. Second, we present a 2-node closed queueing network model to approximate the expected average-sized file download time for a user who shares the AP with other users associated at a multiplicity of rates. These analytical results motivate the proposed association policy, called the Estimated Delay based Association (EDA) policy: Associate with the AP at which the expected file download time is the least. Simulations indicate that for a web-browsing type traffic scenario, EDA outperforms other policies that have been proposed earlier; the extent of improvement ranges from 12.8 to 46.4 for a 9-AP network. To the best of our knowledge, this is the first work that proposes an association policy tailored specifically for web browsing. Apart from this, our analytical results could be of independent interest
In the second group, we have association policies that start from the throughputs that individual STAs are getting at present @cite_22 , @cite_7 , @cite_20 , @cite_2 and @cite_4 . For each STA associated with an AP, the ratio of throughput to the physical rate of association is obtained, and this fraction is added over all the STAs. This leads to a figure of merit for each AP, and the newcomer chooses the AP with the highest figure of merit.
@cite_4 @cite_22 @cite_7 @cite_2 @cite_20
1845350023 2165715302 2013948355 2057262989
Wireless LANs have been widely deployed, and multiple access points (APs) are likely to become much more available for wireless stations (STAs) which can roam from one AP to another by some rule. We focus on an efficient and fair way to use the wireless access resources provided by multiple APs. In particular, our major concern is to develop a decentralized way to enable each STA to select an appropriate available AP independently. A straightforward way is to select the AP with the strongest signal; however, this is shown to need further improvement. Hence, we propose decentralized AP selection strategies to achieve an efficient and fair share of wireless access resources, and evaluate them by simulations. The results show that the proposed strategies can attain an excellent throughput performance by use of the number of active STAs sharing each AP, even if STAs employ the strategies only when entering the wireless LAN. In addition, if STAs roam from one AP to another, the total throughput and fairness can be further improved very much. In multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users in a fair manner, proportional fair or time-based fair scheduling has been proposed to apply at each access point (AP). However, since a realistic deployment of wireless LANs can consist of a network of APs, this paper considers proportional fairness in this much wider setting. Our technique is to intelligently associate users with APs to achieve optimal proportional fairness in a network of APs. We propose two approximation algorithms for periodical offline optimization. Our algorithms are the first approximation algorithms in the literature with a tight worst-case guarantee for the NP-hard problem. Our simulation results demonstrate that our algorithms can obtain an aggregate throughput which can be as much as 2.3 times more than that of the max-min fair allocation in 802.11b. While maintaining aggregate throughput, our approximation algorithms outperform the default user-AP association method in the 802.11b standard significantly in terms of fairness. Most wireless local area network performance estimations are done with the assumption of uniformly distributed (UD) users. In practice, however, stations (STAs) are distributed unevenly among access points (APs) in an extended service area, causing congested hot-spots (HS) and under-utilized APs. Considering a typical network is made up of multiple APs, having some nodes carrying excessive loads degrades the overall network performance. The system performance can be improved by associating STAs efficiently throughout the network, in a sense sharing the network resources fairly among APs and thus relieving congestion. The association algorithm currently employed in IEEE 802.11 systems, that is specifically designed for residential and small office environments, takes into account signal strength as the only parameter and associates STAs to the closest (in signal strength sense) AP, ignoring its load. Novel user association algorithms are required to solve the problems commonly seen in corporate network environments spanning multiple APs, namely congestion relief and resource sharing. In this work, a distributed and online association algorithm is proposed that demonstrates improved average throughput performance, a balanced load distribution as well as fairness across the network compared to the conventional algorithm. Copyright © 2008 John Wiley & Sons, Ltd. Characterizing user to access point (AP) association strategies in heterogeneous cellular networks (HetNets) is critical for their performance analysis, as it directly influences the load across the network. In this letter, we introduce and analyze a class of association strategies, which we term stationary association, and the resulting association cells. For random HetNets, where APs are distributed according to a stationary point process, the area of the resulting association cells are shown to be the marks of the corresponding point process. Addressing the need of quantifying the load experienced by a typical user, a "Feller-paradox" like relationship is established between the area of the association cell containing origin and that of a typical association cell. For the specific case of Poisson point process and max power association, the mean association area of each tier is derived and shown to increase with channel gain variance and decrease in the path loss exponents of the corresponding tier.