Radio Planning of Wireless Local Area Networks
- 26 December 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE/ACM Transactions on Networking
- Vol. 15 (6) , 1414-1427
Abstract
In this paper we propose mathematical models to tackle the WLAN planning problem. Our approach aims at maximizing network efficiency by taking into account the inter-AP domain interference and the access mechanism. Both the single-channel and the multiple-channel WLAN planning problems are considered. We give different formulations which capture at different levels of detail the effect of interference on the network efficiency. In order to evaluate the quality of the proposed models, we obtain the optimal solutions for synthetic network instances, and propose heuristics to get suboptimal solutions in a reasonable computing time. We show that the networks planned according to our approach feature higher efficiency than the ones planned using classical models, like the minimum-cardinality set covering problem (SCP), by privileging network solutions with low-power APs installed. The achieved gain reaches 167% in particular network scenarios. Moreover, we test the obtained solutions through simulation and real-life testbed implementation; both analyses show that the networks planned with the proposed approaches are the ones with the highest saturation throughput with respect to those configurations obtained with SCP.Keywords
This publication has 21 references indexed in Scilit:
- WLAN coverage planning: optimization models and algorithms2004
- On the deployment of picocellular wireless infrastructureIEEE Wireless Communications, 2003
- On the design and capacity planning of a wireless local area network2002
- Large-scale wireless LAN designIEEE Communications Magazine, 2001
- Does the IEEE 802.11 MAC protocol work well in multihop wireless ad hoc networks?IEEE Communications Magazine, 2001
- Wireless communication network design in IC factoryIEEE Transactions on Industrial Electronics, 2001
- Hyperbolic 0–1 programming and query optimization in information retrievalMathematical Programming, 1991
- Boolean query optimization and the 0-1 hyperbolic sum problemAnnals of Mathematics and Artificial Intelligence, 1990
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study1980
- Packet Switching in Radio Channels: Part II--The Hidden Terminal Problem in Carrier Sense Multiple-Access and the Busy-Tone SolutionIEEE Transactions on Communications, 1975