A Space-Filling Curve Heuristic for Wireless Networks Design

• Main Authors: LEONG, Thin Yin, CHU, Chao-Hsien
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2006
• Subjects: Wireless Network; Heuristics; Software Engineering
• Online Access: https://ink.library.smu.edu.sg/sis_research/608
• Institution: Singapore Management University

In recent years, wireless local area networks (WLANs) have experienced rapid adoption due to the many advantages they offer like mobility and in situations where laying of cables for wired network is physical prohibitive and costly. Although installing a small WLAN is relatively easy, deploying a large-scale enterprise wireless infrastructure requires careful planning, so as to minimize cost while meeting various quality of service requirements. Existing research has focus on either formulating simpler mathematical models or finding solution approaches. The major difficulty in these methods is in the numerous measurements, of signal strengths between possible user and base station locations, required to provide the input data. In this paper, we propose an efficient space-filling curve (SFC) based heuristic for solving the network design problem. The SFC heuristic is easy to implement, fast in execution and can provide good first-cut solutions. Most importantly, the SFC’s property of preserving nearness among points makes the solution feasible and sound, and thereby reduces the signal strength measurements effort needed.