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

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.