By Topic

Q-Probabilistic Routing in Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Rocio Arroyo-Valles ; Dpto. de Teoría de la Señal y Comunicaciones, Universidad Carlos III de Madrid Avda. de la Universidad, 30, 28911 Leganés-Madrid, Spain, ; Rocio Alaiz-Rodriguez ; Alicia Guerrero-Curieses ; Jesus Cid-Sueiro

Unpredictable topology changes, energy constraints and link unreliability make the information transmission a challenging problem in wireless sensor networks (WSN). Taking some ideas from machine learning methods, we propose a novel geographic routing algorithm for WSN, named Q-probabilistic routing (Q-PR), that makes intelligent routing decisions from the delayed reward of previous actions and the local interaction among neighbor nodes, by using reinforcement learning and a Bayesian decision model. Moreover, by considering the message importance embedded in the message itself routing decisions can be adapted to traffic importance. Experimental results show that Q-PR becomes a routing policy that, as a function of the message importance, achieves a trade-off among the expected number of retransmissions (ETX), the successful delivery rate and the network lifetime.

Published in:

Intelligent Sensors, Sensor Networks and Information, 2007. ISSNIP 2007. 3rd International Conference on

Date of Conference:

3-6 Dec. 2007