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

Lecture Notes in Computer Science

Volumn 3391, Issue , 2005, Pages 21-30

  Low, Chor Ping ^a   Fang, Can ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Approximation algorithm; Demand points assignment; Load balancing; NP hard; Wireless LANs

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONGESTION CONTROL (COMMUNICATION); LINEAR PROGRAMMING; TELECOMMUNICATION TRAFFIC; WIRELESS TELECOMMUNICATION SYSTEMS;

INTEGER LINEAR PROGRAM (ILP); LARGE-SCALE WIRELESS LAN; LOAD-BALANCED DEMAND; TRAFFIC DEMAND;

LOCAL AREA NETWORKS;

EID: 24144440769     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30582-8_3     Document Type: Conference Paper

References (12)

1. A.Hills, Large-scale wireless LAN design, IEEE Communications Magzine, vol. 39, Nov 2001, pp. 98-107.
2. Youngseok Lee and Kyoungae Kim and Yanghee Choi, Optimization of AP placement and channel assignment in wireless LANs, Proceedings. LCN 2002. 27th Annual IEEE Conference on Local Computer Networks, Nov 2002, pp. 831-836.
3. L. Nagy and L. Farkas, Indoor base station location optimisation using genetic algorithms, IEEE PIMRC 2000, vol. 2, 2000, pp. 843-846.
4. M. Kamenetsky and M. Unbehaun, Coverage planning for outdoor Wireless LAN system, International Zurich Seminar on Broadband Communications, 2002.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman company, New York, 1979.
6. C. Y. Chang, C. T. Chang and P.C. Huang, Dynamic channel assignment and reassignment for exploiting channel reuse opportunities in ad hoc wireless networks, The 8th International Conference on Communication Systems(ICCS 2002), 2002.
7. K. L. Yeung and T. P. Yum, Fixed channel assignment optimisation for cellular mobile networks, IEICE TRANS. Communication, vol. E83-B, Aug 2000.
8. M.V.S. Shashanka, A. Pati and A. M. Shende, A characterisation of optimal channel assignments for wireless networks modelled as cellular and square grids, International Parallel and Distributed Processing Symposium (IPDPS'03), Apr 2003.
9. S. Ramanathan, A unified framework and algorithm for channel assignment in wireless networks, Wireless Networks, vol. 5, Mar 1999, pp. 81-94.
10. J.K. Lenstra, D.B. Shmoys and E. Tardos, Approximation algorithms for scheduling unrelated parallel machines, Math. Programming, vo. 46, 1990, pp. 259-271.
11. E.V. Shchepin and N.V. Vakhania, Task distributions on multiprocessor systems, Lecture Notes in Computer Science, vol. 1872, 2000, pp. 112-125.
12. 2.5 algorithm for maximum matching in bipartite graphs, SIAM Journal on Computing, 1973, pp. 135-158.