A probabilistic query routing scheme for wireless sensor networks

The use of wireless sensor networks for information discovery and monitoring of continuous physical fields has emerged as a novel and efficient solution. To this end, a query message is routed through the network to fetch data from sensor nodes and report it back to a sink node. As several applicati...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Riva, Guillermo G., Finochietto, Jorge M.
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2011
Materias:
Ciencias Informáticas
Sensor Networks
Information Discovery
Energy Conservation
Computational Intelligence
Metaheuristics
Reinforcement Learning
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/125258
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-125258
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Sensor Networks
Information Discovery
Energy Conservation
Computational Intelligence
Metaheuristics
Reinforcement Learning
spellingShingle Ciencias Informáticas
Sensor Networks
Information Discovery
Energy Conservation
Computational Intelligence
Metaheuristics
Reinforcement Learning
Riva, Guillermo G.
Finochietto, Jorge M.
A probabilistic query routing scheme for wireless sensor networks
topic_facet Ciencias Informáticas
Sensor Networks
Information Discovery
Energy Conservation
Computational Intelligence
Metaheuristics
Reinforcement Learning
description The use of wireless sensor networks for information discovery and monitoring of continuous physical fields has emerged as a novel and efficient solution. To this end, a query message is routed through the network to fetch data from sensor nodes and report it back to a sink node. As several applications only require a limited subset of the available data in the network, this query could be ideally routed to fetch only relevant data. In this way, much energy due to message exchange among nodes could be saved. In this paper, we consider the application of computational intelligence on nodes to implement a parallel adaptive simulated annealing (PASA) mechanism able to direct queries to relevant nodes. Besides, a reinforcement learning algorithm is proposed to adapt progressively the query process to the characteristics of the network, limiting the routing space to areas with useful data. Finally, the relevant data collection mechanism is also discussed to illustrate the complete process. We show by extensive simulations that the routing cost can be reduced by approximately 60% over flooding with an error less than 5%.
format Objeto de conferencia
Objeto de conferencia
author Riva, Guillermo G.
Finochietto, Jorge M.
author_facet Riva, Guillermo G.
Finochietto, Jorge M.
author_sort Riva, Guillermo G.
title A probabilistic query routing scheme for wireless sensor networks
title_short A probabilistic query routing scheme for wireless sensor networks
title_full A probabilistic query routing scheme for wireless sensor networks
title_fullStr A probabilistic query routing scheme for wireless sensor networks
title_full_unstemmed A probabilistic query routing scheme for wireless sensor networks
title_sort probabilistic query routing scheme for wireless sensor networks
publishDate 2011
url http://sedici.unlp.edu.ar/handle/10915/125258
work_keys_str_mv AT rivaguillermog aprobabilisticqueryroutingschemeforwirelesssensornetworks
AT finochiettojorgem aprobabilisticqueryroutingschemeforwirelesssensornetworks
AT rivaguillermog probabilisticqueryroutingschemeforwirelesssensornetworks
AT finochiettojorgem probabilisticqueryroutingschemeforwirelesssensornetworks
bdutipo_str Repositorios
_version_ 1764820451460120580

Ejemplares similares