By Topic

A scheme for reduced latency in wireless sensor networks using self organized mirrors

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
$31 $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

2 Author(s)
Gaynor, P. ; Univ. of the West Indies, Kingston, Jamaica ; Coore, D.

New applications for wireless sensor networks (WSNs) that demand stricter quality of service guarantees may require high levels of scalability, robustness, life expectancy and response time. Unfortunately, most sensor network communication protocols often guarantee several of these requirements at the risk of others. Caching provides a doorway to a solution, however works reviewed thus far in WSN caching involve the energy intensive practice of cache placement. We show that when applying a strategy of using random backup addresses in a sensor network, an emergent functionality that places data closer to required sinks can be achieved in an energy efficient way.

Published in:

IEEE SoutheastCon 2010 (SoutheastCon), Proceedings of the

Date of Conference:

18-21 March 2010