Minimizing contention through cooperation between densely deployed wireless LANs

Authors:
Frank A. Zdarsky;Ivan Martinovic;Jens B. Schmitt
Affiliations:
Distributed Computer Systems Lab (DISCO), University of Kaiserslautern, Kaiserslautern, Germany 67653;Distributed Computer Systems Lab (DISCO), University of Kaiserslautern, Kaiserslautern, Germany 67653;Distributed Computer Systems Lab (DISCO), University of Kaiserslautern, Kaiserslautern, Germany 67653
Venue:
Wireless Networks
Year:
2009

Citing 7
Cited 1

Genetic Algorithms in Search, Optimization and Machine Learning

Genetic Algorithms in Search, Optimization and Machine Learning
Optimization of AP Placement and Channel Assignment in Wireless LANs

LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Fairness and load balancing in wireless LANs using association control

Proceedings of the 10th annual international conference on Mobile computing and networking
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks

DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Self-management in chaotic wireless deployments

Proceedings of the 11th annual international conference on Mobile computing and networking
Weighted coloring based channel assignment for WLANs

ACM SIGMOBILE Mobile Computing and Communications Review
Radio resource management in wireless LANs

IEEE Communications Magazine

Data traffic load balancing and QoS in IEEE 802.11 network: Experimental study of the signal strength effect

Computers and Electrical Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Contention at shared medium access may seriously degrade the performance of a CSMA/CA-based wireless LAN. Where wireless LANs from different operators are densely deployed, controlling contention merely by intelligent selection of installation sites and assignment of operating channels becomes challenging at least. We show that cooperation between these networks may lead to a significant reduction in overall contention. To this end, we present a mathematical programming formulation of the minimal inter-domain contention problem and derive theoretical lower bounds for it. We show how to practically determine exact solutions for small problem instances and near-optimal solutions for larger scenarios. Most importantly, we introduce a distributed algorithm and protocol that allows access points to self-coordinate in order to minimize contention and relies solely on information about each access point's immediate neighborhood. In experiments, we show that cooperation between domains may more than halve contention even in only moderately dense deployments. Furthermore, we demonstrate that our distributed algorithm may reduce contention by 19% compared to cooperation using standard WLAN mechanisms. Contrary to common belief, our findings suggest that in dense deployments switching off selected access points may be more effective in decreasing contention than using them for load balancing.