By Topic

Energy efficient routing algorithms for application to agro-food 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

7 Author(s)
F. Chiti ; Dipt. di Elettronica e Telecomunicazioni, Univ. di Firenze, Italy ; A. De Cristofaro ; R. Fantacci ; D. Tarchi
more authors

Precision agriculture (PA) represents a novel paradigm for managing agro-food production, by monitoring the physical parameters of different farming zones. This might be pursued by means of different communication infrastructures, but the most promising technology seems to be the wireless sensor network (WSN). However, merely applying this approach to the PA context, while resulting in a more flexible communication platform, still exhibits a rigid information management architecture. This limitation can be overcome by applying the ambient intelligent (AmI) paradigm to create an environment highly interactive with all the users involved in the process. Our proposal deals with the porting of the AmI concepts on a highly-integrated WSN platform with a special focus on the routing strategies. In particular, we investigate a class of dynamic flooding algorithm which is aware of the status of neighbor nodes in terms of geographical position and residual battery charge. By comparing this approach with the gossiping and the static flooding schemes, we are able to highlight a remarkable improvement in the network life-time with a particular regard to the most solicited nodes, without increasing complexity.

Published in:

IEEE International Conference on Communications, 2005. ICC 2005. 2005  (Volume:5 )

Date of Conference:

16-20 May 2005