Abstract
Green wireless local area networks (WLANs) have captured the interests of academia and industry recently, because they save energy by scheduling an access point (AP) on/off according to traffic demands. However, it is very challenging to determine user association in a green WLAN while simultaneously considering several other factors, such as avoiding AP congestion and user migration constraints. Here, we study the energy‐efficient user association with congestion avoidance and migration constraint (EACM). First, we formulate the EACM problem as an integer linear programming (ILP) model, to minimize APs’ overall energy consumption within a time interval while satisfying the following constraints: traffic demand, AP utilization threshold, and maximum number of demand node (DN) migrations allowed. Then, we propose an efficient migration‐constrained user reassociation algorithm, consisting of two steps. The first step removes k AP‐DN associations to eliminate AP congestion and turn off as many idle APs as possible. The second step reassociates these k DNs according to an energy efficiency strategy. Finally, we perform simulation experiments that validate our algorithm’s effectiveness and efficiency.
Highlights
The IEEE 802.11-based wireless local area network (WLAN) is one of the most popular, widely used wireless access technologies in fog computing [1, 2]
The main contributions of this paper are as follows: (i) We investigate the energy-efficient user association with congestion avoidance and migration constraint (EACM) in green WLANs and formulate the EACM problem as an integer linear programming (ILP) model
(ii) We propose an efficient migration-constrained user reassociation algorithm (MURA), where k access point (AP)-DN (DN stands for demand node) associations are removed to eliminate AP congestion and make as many APs as possible idle, and the k DNs are reassociated according to an energy efficiency strategy
Summary
The IEEE 802.11-based wireless local area network (WLAN) is one of the most popular, widely used wireless access technologies in fog computing [1, 2]. In green WLANs, APs are scheduled on/off according to time-varying traffic demands, thereby saving energy. Because of time-varying traffic demands, user association should be adjusted dynamically with several user migrations. We investigate the user association problem in green WLANs, to minimize the network’s energy consumption while satisfying time-varying traffic demands. (i) We investigate the energy-efficient user association with congestion avoidance and migration constraint (EACM) in green WLANs and formulate the EACM problem as an integer linear programming (ILP) model. (ii) We propose an efficient migration-constrained user reassociation algorithm (MURA), where k AP-DN (DN stands for demand node) associations are removed to eliminate AP congestion and make as many APs as possible idle, and the k DNs are reassociated according to an energy efficiency strategy. (iii) We conduct simulation experiments to evaluate the performance of the proposed algorithm, and the results show its efficiency and effectiveness
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have