Wireless Network Optimization for Massive V2I Data Collection using Multiobjective Harmony Search Heuristics
This paper proposes to improve the efficiency of the deploy- ment of wireless network infrastructure for massive data collection from vehicles over regional areas. The increase in the devices that are carried by vehicles makes it especially interesting being able to gain access to that data. From a...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2017 |
| País: | España |
| Institución: | Basque Center for Applied Mathematics (BCAM) |
| Repositorio: | BIRD. BCAM's Institutional Repository Data |
| OAI Identifier: | oai:bird.bcamath.org:20.500.11824/1224 |
| Acceso en línea: | http://hdl.handle.net/20.500.11824/1224 https://doi.org/10.1007/978-981-10-3728-3_20 |
| Access Level: | acceso abierto |
| Palabra clave: | Vehicular Networks Cost-efficient deployment Harmony Search |
| Sumario: | This paper proposes to improve the efficiency of the deploy- ment of wireless network infrastructure for massive data collection from vehicles over regional areas. The increase in the devices that are carried by vehicles makes it especially interesting being able to gain access to that data. From a decisional point of view, this collection strategy re- quires defining a wireless Vehicular-to-Infrastructure (V2I) network that jointly optimizes the level of service and overall CAPEX/OPEX costs of its deployment. Unfortunately, it can be intuitively noted that both optimization objectives are connecting with one another: adding more equipment will certainly increase the level of service (i.e. coverage) of the network, but costs of the deployment will rise accordingly. A deci- sion making tool blending together both objectives and inferring there- from a set of Pareto-optimal deployments would be of utmost utility for stakeholders in their process of provisioning budgetary resources for the deployment. This work will explore the extent to which a multi-objective Harmony Search algorithm can be used to compute the aforementioned Pareto-optimal set of deployment by operating on two different optimiza- tion variables: the geographical position on which wireless receivers are to be deployed and their type, which determines not only their coverage range but also their bandwidth and cost. In particular we will utilize a non-dominated sorting strategy criterion to select the harmonies (solu- tion vectors) evolved by Harmony Search heuristics. |
|---|