A Hybrid Grouping Genetic Algorithm for citywide ubiquitous WiFi access deployment

Agustin-Blas, E.; Salcedo‐Sanz, Sancho; Vidales, Pablo; Urueta, G.; Portilla-Figueras, Antonio; Solarski, Marcin

doi:10.1109/cec.2009.4983210

Cited by 10 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• The city is composed by eight 30 meters-wide streets that have been randomly constructed. For the sake of fairness in the comparison, we use the same scenario as that used in [7], [8].…”

Section: Proposed Grouping Algorithm For the Wifidpmentioning

confidence: 99%

“…Therefore, the designed global search GHS algorithm is hybridized with local search and repair procedures. First proposed in [7], both processes are based on an exhaustive Greedy strategy, which increase dramatically the computational complexity of the proposed scheme. This procedure randomly selects an oAP and switches it off, then, the AP that maximizes the network coverage is found and switched on and the whole process is repeated for all the APs in the network.…”

Section: Proposed Grouping Algorithm For the Wifidpmentioning

confidence: 99%

“…By following this model, a set of scenarios with varying N ∈ {192, 50, 75, 100} is obtained. Note that N = 192 corresponds to the scenario used in [7], [8] and therefore, used as the comparison benchmark. • The set of users U is generated as…”

Section: Proposed Grouping Algorithm For the Wifidpmentioning

confidence: 99%

“…In this same line of research, a low-cost deployment of metropolitan networks is presented in [6], where the modeling process of ubiquitous WiFi networks is shown to entail a combinatorial constrained optimization problem. Likewise, in [7] a Genetic Algorithm (GA) is designed to deal with the WiFi access deployment (WIFIDP) problem with budget constraints based on two different synthetically-modeled scenarios. More recently, an extension of their previous work considering interference between routers has been presented in [8].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Grouping Harmony Search approach for the Citywide WiFi deployment problem

Landa-Torres

Gil-López

Ser

et al. 2011

2011 11th International Conference on Intelligent Systems Design and Applications

View full text Add to dashboard Cite

This paper presents a novel Grouping Harmony Search (GHS) algorithm for the Citywide Ubiquitous WiFi Network Design problem (WIFIDP). The WIFIDP is a NP-hard problem where private customers owning wireless access points connected to Internet share bandwidth with third parties. Aspects such as allocated budget and router capacities (coverage radius, capacity, price, etc) are taken into account in order to obtain the optimal network deployment (in terms of costeffectiveness) when applying the GHS algorithm. The approach to tackle the aforementioned WIFIDP problem consists of a hybrid Grouping Harmony Search (GHS) algorithm with a local search method and a technique for repairing unfeasible solutions. Furthermore, the presented GHS algorithm is differential, since each proposed harmony is produced (improvised) based on the same harmony in the previous iteration. This differential scheme employs the grouping concept based on the connectivity between nomadic users and routers, which increases significantly its searching capability. Preliminary Monte Carlo simulations show that this proposed technique statistically outperforms genetically-inspired algorithms previously presented for the WIFIDP, with an emphasis in scenarios with stringent capacity and budget constraints. This first approach paves the way for future research aimed at applying the proposed algorithm to real scenarios.

show abstract

Section: Proposed Grouping Algorithm For the Wifidpmentioning

confidence: 99%

Section: Proposed Grouping Algorithm For the Wifidpmentioning

confidence: 99%

Section: Proposed Grouping Algorithm For the Wifidpmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Grouping Harmony Search approach for the Citywide WiFi deployment problem

Landa-Torres

Gil-López

Ser

et al. 2011

2011 11th International Conference on Intelligent Systems Design and Applications

View full text Add to dashboard Cite

show abstract

“…On the other hand, the limited WiFi coverage has mainly constraint access to homes, offices and some public spaces (Audeh, 2004). The deployment of citywide WiFi access networks is, however, an interesting topic, in which solid research is being carried out (Lee & Murray, 2010;Nekovee & Saksena, 2010;Sastry, Crowcroft, & Sollins, 2007;Thraves, Urueta, Vidales, & Solarski, 2008; Agustín-Blas, Salcedo-Sanz, Vidales, Urueta, & Portilla-Figueras, 2009). Moreover, there is already an ongoing effort to deploy ubiquitous WiFi networks in many cities around the world (Gratton, 2007).…”

Section: Introductionmentioning

confidence: 96%