Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 8
Encontrada(s) 1 página(s)

Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Analysis of ISO/IEEE 11073 built-in security and its potential extensibility

Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Contribución de congreso (ConferenceOutput)

A greedy approach for resource allocation in Virtual Sensor Networks

  • Bousnina, Sonda
  • Cesana, Matteo
  • Ortín, Jorge
  • Delgado, Carmen
  • Gallego, José Ramón
  • Canales, María
Virtual Sensor Networks (VSNs) envision the creation of general purpose wireless sensor networks which can be easily adapted and configured to support multifold applications with heterogeneous requirements, in contrast with the classical approach of wireless sensor networks vertically optimized on one specific task/service. The very heart of VSNs'' vision is the capability to dynamically allocate shared physical resources (processing power, bandwidth, storage) to multiple incoming applications. In this context, we tackle the problem of optimally allocating shared resources in VSNs by proposing an efficient greedy heuristic that aims to maximize the total revenue out of the deployment of multiple concurrent applications while considering the inherent limitations of the shared physical resources. The proposed heuristic is tested on realistic network instances with notable performances in terms of execution time while keeping the gap with respect to the optimal solution limited (below 5% in the tested environments).
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Energy-aware dynamic resource allocation in virtual sensor networks

  • Delgado, C.
  • Canales, M.
  • Ortin, J.
  • Gallego, J.R.
  • Redondi, A.
  • Bousnina, S.
  • Cesana, M.
Sensor network virtualization enables the possibility of sharing common physical resources to multiple stakeholder applications. This paper focuses on addressing the dynamic adaptation of already assigned virtual sensor network resources to respond to time varying application demands. We propose an optimization framework that dynamically allocate applications into sensor nodes while accounting for the characteristics and limitations of the wireless sensor environment. It takes also into account the additional energy consumption related to activating new nodes and/or moving already active applications. Different objective functions related to the available energy in the nodes are analyzed. The proposed framework is evaluated by simulation considering realistic parameters from actual sensor nodes and deployed applications to assess the efficiency of the proposals.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Frame aggregation in central controlled 802.11 WLANs: The latency versus throughput tradeoff

  • Saldaña, J.
  • Ruiz-Mas, J.
  • Almodovar, J.
Frame aggregation is widely used in 802.11 WLANs in order to provide a significant throughput improvement. However, the latency increase that comes as a counterpart can reduce the quality experienced by the users of applications with real-time constraints. This letter explores the throughput versus latency tradeoff in the context of central controlled solutions (e.g. SDWN-based). First, a scenario with a single Access Point (AP) is used to illustrate the problem and to propose two possible solutions. Then, a centralized algorithm that dynamically (de)activates aggregation is tested in a scenario with a number of APs. The results show that aggregation parameters can be tuned in order to keep latency in low levels, with a low throughput penalty.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Resource-on-demand schemes in 802.11 WLANs with non-zero start-up times

  • Ortin, J.
  • Donato, C.
  • Serrano, P.
  • Banchs, A.
Increasing the density of access points is one of the most effective mechanisms to cope with the growing traffic demand in wireless networks. To prevent energy wastage at low loads, a resource-on-demand (RoD) scheme is required to opportunistically (de)activate access points as network traffic varies. While previous publications have analytically modeled these schemes in the past, they have assumed that resources are immediately available when activated, an assumption that leads to inaccurate results and might result in inappropriate configurations of the RoD scheme. In this paper, we analyze a general RoD scenario with N access points and non-zero start-up times. We first present an exact analytical model that accurately predicts performance but has a high computational complexity, and then derive a simplified analysis that sacrifices some accuracy in exchange for a much lower computational cost. To illustrate the practicality of this model, we present the design of a simple configuration algorithm for RoD. Simulation results confirm the validity of the analyses, and the effectiveness of the configuration algorithm.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Optimal configuration of a resource-on-demand 802.11 WLAN with non-zero start-up times

  • Ortín, J.
  • Serrano, P.
  • Donato, C.
Resource on Demand in 802.11 Wireless LANs is receiving an increasing attention, with its feasibility already proved in practice and some initial analytical models available. However, while these models have assumed that access points (APs) start up in zero time, experimentation has showed that this is hardly the case. In this work, we provide a new model to account for this time in the simple case of a WLAN formed by two APs where the second AP is switched on/off dynamically to adapt to the traffic load and reduce the overall power consumption, and show that it significantly alters the results when compared to the zero start-up time case, both qualitatively and quantitatively. Our findings show that having a non-zero start up time modifies significantly the trade-offs between power consumption and performance that appears on Resource on Demand solutions. Finally, we propose an algorithm to optimize the energy consumption of the network while guaranteeing a given performance bound.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Joint cell selection and resource allocation games with backhaul constraints

  • Ortín, J.
  • Gállego, J. R.
  • Canales, M.
In this work we study the problem of user association and resource allocation to maximize the proportional fairness of a wireless network with limited backhaul capacity. The optimal solution of this problem requires solving a mixed integer non-linear programming problem which generally cannot be solved in real time. We propose instead to model the problem as a potential game, which decreases dramatically the computational complexity and obtains a user association and resource allocation close to the optimal solution. Additionally, the use of a game-theoretic approach allows an efficient distribution of the computational burden among the computational resources of the network.
Zaguán. Repositorio Digital de la Universidad de Zaragoza
Publication Artículo científico (JournalArticle)

Joint Application Admission Control and Network Slicing in Virtual Sensor Networks

  • Delgado, C.
  • Canales, M.
  • Ortin, J.
  • Gallego, J.R.
  • Redondi, A.
  • Bousnina, S.
  • Cesana, M.
We focus on the problem of managing a shared physical wireless sensor network (WSN) where a single network infrastructure provider leases the physical resources of the networks to application providers to run/deploy specific applications/services. In this scenario, we solve jointly the problems of application admission control (AAC), that is, whether to admit the application/service to the physical network, and wireless sensor network slicing (SNS), that is, to allocate the required physical resources to the admitted applications in a transparent and effective way. We propose a mathematical programming framework to model the joint AAC-SNS problem which is then leveraged to design effective solution algorithms. The proposed framework is thoroughly evaluated on realistic WSNs infrastructures.