Pasar al contenido principal

Resultados relacionados

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

e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Optimized Sensor Network and Multi-Agent Decision Support for Smart Traffic Light Management

  • Cruz Piris, Luis De La|||0000-0002-9570-2851
  • Rivera Pinto, Diego|||0000-0002-7076-9048
  • Fernández Melián, Susel|||0000-0002-1576-4340
  • Marsá Maestre, Iván|||0000-0002-5529-2851
One of the biggest challenges in modern societies is to solve vehicular traffic problems. Sensor networks in traffic environments have contributed to improving the decision-making process of Intelligent Transportation Systems. However, one of the limiting factors for the effectiveness of these systems is in the deployment of sensors to provide accurate information about the traffic. Our proposal is using the centrality measurement of a graph as a base to locate the best locations for sensor installation in a traffic network. After integrating these sensors in a simulation scenario, we define a Multi-Agent Systems composed of three types of agents: traffic light management agents, traffic jam detection agents, and agents that control the traffic lights at an intersection. The ultimate goal of these Multi-Agent Systems is to improve the trip duration for vehicles in the network. To validate our solution, we have developed the needed elements for modelling the sensors and agents in the simulation environment. We have carried out experiments using the Simulation of Urban MObility (SUMO) traffic simulator and the Travel and Activity PAtterns Simulation (TAPAS) Cologne traffic scenario. The obtained results show that our proposal allows to reduce the sensor network while still obtaining relevant information to have a global view of the environment. Finally, regarding the Multi-Agent Systems, we have carried out experiments that show that our proposal is able to improve other existing solutions such as conventional traffic light management systems (static or dynamic) in terms of reduction of vehicle trip duration and reduction of the message exchange overhead in the sensor network., Universidad de Alcalá, Ministerio de Economía y Competitividad
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

A Coral Reefs Optimization algorithm with substrate layer for robust Wi-Fi channel assignment

  • Camacho Gómez, Carlos
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Salcedo Sanz, Sancho|||0000-0002-4048-1676
In this paper, we tackle a problem of frequency assignment in Wi-Fi networks with a novel evolutionary-type algorithm. In this version of the problem, we consider the interferences originated by the access points, and also by the clients and all the 11 available channels in the 2.4 GHz Wi-Fi frequency band. The proposed evolutionary-type algorithm is the Coral Reefs Optimization approach with substrate layer (CRO-SL). It is a recently proposed algorithm, which simulates the processes which occur in real coral reefs, including the reproduction and fight for the space of living corals. This version of the algorithm includes a layer of “substrates” which allows using different search patterns jointly in the algorithm. This way, the CRO-SL is able to apply search patterns such as harmony search, differential evolution, Gaussian-based mutations and other traditional and novel search procedures, including local search algorithms, within a single population of solutions. We show the good performance of the proposed approach in a real case study of Wi-Fi frequency assignment, in the Polytechnic School building of the Universidad de Alcalá (Spain), where different realistic scenarios of the problem have been simulated and successfully solved with the CRO-SL algorithm., Ministerio de Economía y Competitividad, Comunidad de Madrid
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Nonlinear Negotiation Approaches for Complex-Network Optimization: A Study Inspired by Wi-Fi Channel Assignment

  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Orden Martín, David|||0000-0001-5403-8467
  • Klein, Mark
At the present time, Wi-Fi networks are everywhere. They operate in unlicensed radio-frequency spectrum bands (divided in channels), which are highly congested. The purpose of this paper is to tackle the problem of channel assignment in Wi-Fi networks. To this end, we have modeled the networks as multilayer graphs, in a way that frequency channel assignment becomes a graph coloring problem. For a high number and variety of scenarios, we have solved the problem with two different automated negotiation techniques: a hill-climbing mediated negotiation and a simulated annealing mediated negotiation. As an upper bound reference for the performance of these two techniques, we have also solved the problem using a particle swarm optimizer. Results show that the annealer negotiator behaves as the best choice because it is able to obtain even better results than the particle swarm optimizer in the most complex scenarios under study, with running times one order of magnitude below. Moreover, we study how different properties of the network layout affect to the performance gain that the annealer is able to obtain with respect to the particle swarm optimizer. Finally, we show how the different strategic behavior of the participants affects the results., Ministerio de Economía y Competitividad, Agencia Estatal de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

REACT: reactive resilience for critical infrastructures using graph-coloring techniques

  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Orden Martín, David|||0000-0001-5403-8467
  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
  • Klein, Mark
Nowadays society is more and more dependent on critical infrastructures. Critical network infrastructures (CNI) are communication networks whose disruption can create a severe impact. In this paper we propose REACT, a distributed framework for reactive network resilience, which allows networks to reconfigure themselves in the event of a security incidents so that the risk of further damage is mitigated. Our framework takes advantage of a risk model based on multilayer networks, as well as a graph-coloring problem conversion, to identify new, more resilient configurations for networks in the event of an attack. We propose two different solution approaches, and evaluate them from two different perspectives, with a number of centralized optimization techniques. Experiments show that our approaches outperform the reference approaches in terms of risk mitigation and performance., Ministerio de Economía y Competitividad, Universidad de Alcalá, Agencia Estatal de Investigación, European Commission
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Automated Negotiation for Resource Assignment in Wireless Surveillance Sensor Networks

  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Orden Martín, David|||0000-0001-5403-8467
Due to the low cost of CMOS IP-based cameras, wireless surveillance sensor networks have emerged as a new application of sensor networks able to monitor public or private areas or even country borders. Since these networks are bandwidth intensive and the radioelectric spectrum is limited, especially in unlicensed bands, it is mandatory to assign frequency channels in a smart manner. In this work, we propose the application of automated negotiation techniques for frequency assignment. Results show that these techniques are very suitable for the problem, being able to obtain the best solutions among the techniques with which we have compared them., Ministerio de Economía y Competitividad, Comunidad de Madrid, Agencia Española de Investigación
e_Buah Biblioteca Digital Universidad de Alcalá
Publicación Artículo científico (JournalArticle)

Bounds on spectrum graph coloring

  • Orden Martín, David|||0000-0001-5403-8467
  • Marsá Maestre, Iván|||0000-0002-5529-2851
  • Giménez Guzmán, José Manuel|||0000-0002-1645-8476
  • Hoz de la Hoz, Enrique de la|||0000-0003-4837-3837
We propose two vertex-coloring problems for graphs, endorsing the spectrum of colors with a matrix of interferences between pairs of colors. In the Threshold Spectrum Coloring problem, the number of colors is fixed and the aim is to minimize the maximum interference at a vertex (interference threshold). In the Chromatic Spectrum Coloring problem, a threshold is settled and the aim is to minimize the number of colors (among the available ones) for which respecting that threshold is possible. We prove general upper bounds for the solutions to each problem, valid for any graph and any matrix of interferences. We also show that both problems are NP-hard and perform experimental results, proposing a DSATUR-based heuristic for each problem, in order to study the gap between the theoretical upper bounds and the values obtained., Ministerio de Economía y Competitividad, Comunidad de Madrid