TY - GEN
T1 - Efficient WiFi deployment algorithms based on realistic mobility characteristics
AU - Wang, Tian
AU - Xing, Guoliang
AU - Li, Minming
AU - Jia, Weijia
PY - 2010
Y1 - 2010
N2 - Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received significant research attention due to the drastic increase of penetration rate of 802.11-based networks. Nevertheless, recent empirical studies showed that unplanned WiFi networks cannot provide satisfactory Quality of Service for interactive mobile applications due to intermittent network connectivity. In this paper, we exploit realistic mobility characteristics of users to deploy WiFi Access Points (APs) for continuous service for mobile users. We study two AP deployment problems that aim to maximize the continuous user coverage and to minimize the AP deployment cost, respectively. Both problems are formulated based on mobility graphs that capture the statistical mobility patterns of users. We prove that both problems are NP-hard. We develop several optimal and approximation algorithms with provable performance bounds for different topologies of mobility graphs. The effectiveness of our approaches is validated by extensive simulations using real user mobility traces.
AB - Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received significant research attention due to the drastic increase of penetration rate of 802.11-based networks. Nevertheless, recent empirical studies showed that unplanned WiFi networks cannot provide satisfactory Quality of Service for interactive mobile applications due to intermittent network connectivity. In this paper, we exploit realistic mobility characteristics of users to deploy WiFi Access Points (APs) for continuous service for mobile users. We study two AP deployment problems that aim to maximize the continuous user coverage and to minimize the AP deployment cost, respectively. Both problems are formulated based on mobility graphs that capture the statistical mobility patterns of users. We prove that both problems are NP-hard. We develop several optimal and approximation algorithms with provable performance bounds for different topologies of mobility graphs. The effectiveness of our approaches is validated by extensive simulations using real user mobility traces.
UR - https://www.scopus.com/pages/publications/78650996548
U2 - 10.1109/MASS.2010.5663941
DO - 10.1109/MASS.2010.5663941
M3 - 会议稿件
AN - SCOPUS:78650996548
SN - 9781424474882
T3 - 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010
SP - 422
EP - 431
BT - 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010
T2 - 2010 IEEE 7th International Conference on Mobile Adhoc and Sensor Systems, MASS 2010
Y2 - 8 November 2010 through 12 November 2010
ER -