Online Association Policies in IEEE 802.11 WLANs

Kasbekar, Gaurav S.; Kuri, Joy; Nuggehalli, Pavan

doi:10.1109/wiopt.2006.1666467

Cited by 22 publications

(29 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More generally, (3) can be used to approximate the throughput of any shared channel access mechanism with multi-rate transmitters, which transmit a single packet when they gain access to the wireless channel. Indeed, a similar approximation has been used for optimally associating wireless clients to access points [17], [18], [19].…”

Section: A Throughput Model For Shared Wireless Channel Accessmentioning

confidence: 99%

A Contention-Aware Routing Metric for Multi-Rate Multi-Radio Mesh Networks

Genetzakis

Siris

2008

2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

View full text Add to dashboard Cite

Abstract-We present a new routing metric for multi-rate multi-radio mesh networks, which takes into account both contention for the shared wireless channel and rate diversity in multi-radio multi-channel mesh networks. A key property of the proposed Contention-Aware Transmission Time (CATT) metric is that it is isotonic, hence can be applied to link-state routing protocols. We have implemented the CATT metric in the OLSR routing protocol, and evaluate it in a test-bed with mesh nodes each equipped with four radio interfaces. Our experiments show that the proposed routing metric significantly outperforms other metrics that have appeared in the literature, in a number of scenarios that correspond to different mesh network topologies.

show abstract

Section: A Throughput Model For Shared Wireless Channel Accessmentioning

confidence: 99%

A Contention-Aware Routing Metric for Multi-Rate Multi-Radio Mesh Networks

Genetzakis

Siris

2008

2008 5th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

View full text Add to dashboard Cite

show abstract

“…Similar throughput approximations have been used in [9], [10], [11], [12] and [13]. Our main contribution lies in the application of the above model to predict the impact of handovers and decide whether handing over the nodes that communicate at low rates is beneficial for both access points.…”

Section: Introductionmentioning

confidence: 99%

Handover Incentives for WLANs with Overlapping Coverage

Fafoutis

Siris

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. It is well known that in IEEE 802.11 networks, the assignment of low-rate and high-rate users to the same access point significantly degrades the performance of the high-rate users. Our objective is to investigate the implications of the above performance degradation on the incentives for handover between 802.11 wireless local area networks with overlapping coverage. Our focus is on the incentives for supporting handovers, due solely to the improved performance handovers yield for both wireless networks. To study the phenomenon and estimate the potential gain of such handovers, we propose a simple model that predicts the throughput of each access point in different cases. The throughput approximation model can indicate when the handover is expected to be beneficial, and can be used in a handover acceptance policy. Simulation of the proposed procedure suggests that the model is accurate and that there are significant throughput gains for both wireless networks.

show abstract

“…However, the above methods cannot improve load balancing, if not worsen it. Meanwhile, centralized approaches [4][5][6] try to maximize performance with global optimization, and require full AP collaboration to exchange relevant parameters which may not be practical for most WiFi applications. On the other hand, distributed approaches have been proposed attempting to improve system performance through local optimization [7][8][9].…”

Section: Introductionmentioning

confidence: 99%