On the load-balanced demand points assignment problem in large-scale wireless LANs

Authors:
Chor Ping Low;Can Fang
Affiliations:
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore;School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore
Venue:
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Year:
2005

Citing 8
Cited 0

Approximation algorithms for scheduling unrelated parallel machines

Mathematical Programming: Series A and B
A unified framework and algorithm for channel assignment in wireless networks

Wireless Networks
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Task Distributions on Multiprocessor Systems

TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Optimization of AP Placement and Channel Assignment in Wireless LANs

LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
A Characterisation of Optimal Channel Assignments for Wireless Networks Modelled as Cellular and Square Grids

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Dynamic channel assignment and reassignment for exploiting channel reuse opportunities in ad hoc wireless networks

ICCS '02 Proceedings of the The 8th International Conference on Communication Systems - Volume 02
Large-scale wireless LAN design

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the main issues to be addressed in the design of large-scale wireless LANs is that of assigning demand points to access points (APs) in such a way that each demand point is assigned to one AP and the aggregate traffic demand (which is referred to as load in this paper) of all demand points assigned to any AP does not overload that AP. In this paper, we consider the problem of assigning demand points to APs with the objective of minimizing the maximum load among the set of APs, which qualitatively represents congestion at some hot spots in the network service area. We refer to this problem as the Load-Balanced Demand Points Assignment Problem (LBDPAP). We formulated this problem as an integer linear program (ILP) and show that the problem is NP-hard. We propose an efficient $\frac{4}{3}$-approximation algorithm for the problem.