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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Hills, A.: Large-scale wireless LAN design. IEEE Communications Magzine 39, 98–107 (2001)
Lee, Y., Kim, K., Choi, Y.: Optimization of AP placement and channel assignment in wireless LANs. In: Proceedings. LCN 2002. 27th Annual IEEE Conference on Local Computer Networks, November 2002, pp. 831–836 (2002)
Nagy, L., Farkas, L.: Indoor base station location optimisation using genetic algorithms. In: IEEE PIMRC 2000, vol. 2, pp. 843–846 (2000)
Kamenetsky, M., Unbehaun, M.: Coverage planning for outdoor Wireless LAN system. International Zurich Seminar on Broadband Communications (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman company, New York (1979)
Chang, C.Y., Chang, C.T., Huang, P.C.: Dynamic channel assignment and reassignment for exploiting channel reuse opportunities in ad hoc wireless networks. In: The 8th International Conference on Communication Systems(ICCS 2002) (2002)
Yeung, K.L., Yum, T.P.: Fixed channel assignment optimisation for cellular mobile networks. IEICE TRANS. Communication E83-B (August 2000)
Shashanka, M.V.S., Pati, A., Shende, A.M.: A characterisation of optimal channel assignments for wireless networks modelled as cellular and square grids. In: International Parallel and Distributed Processing Symposium (IPDPS 2003) (April 2003)
Ramanathan, S.: A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks 5, 81–94 (1999)
Lenstra, J.K., Shmoys, D.B., Tardos, E.: Approximation algorithms for scheduling unrelated parallel machines. Math. Programming 46, 259–271 (1990)
Shchepin, E.V., Vakhania, N.V.: Task distributions on multiprocessor systems. In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol. 1872, pp. 112–125. Springer, Heidelberg (2000)
Hopcroft, J.E., Karp, R.M.: An n2.5 algorithm for maximum matching in bipartite graphs. SIAM Journal on Computing, 135–158 (1973)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Low, C.P., Fang, C. (2005). On the Load-Balanced Demand Points Assignment Problem in Large-Scale Wireless LANs. In: Kim, C. (eds) Information Networking. Convergence in Broadband and Mobile Networking. ICOIN 2005. Lecture Notes in Computer Science, vol 3391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30582-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-30582-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24467-7
Online ISBN: 978-3-540-30582-8
eBook Packages: Computer ScienceComputer Science (R0)