Abstract
Sensor networks are meant for sensing and disseminating information about the environment they sense. The criticality of a sensed phenomenon determines its importance to the end user. Hence, data dissemination in a sensor network should be information aware. Such information awareness is essential firstly to disseminate critical information more reliably and secondly to consume network resources proportional to the criticality of information. In this paper, we describe a protocol called ReInForM to deliver packets at desired reliability at a proportionate communication cost. ReInForm sends multiple copies of each packet along multiple paths from source to sink, such that data is delivered at the desired reliability. It uses the concept of dynamic packet state in context of sensor networks, to control the number of paths required for the desired reliability, and does so using only local knowledge of channel error rates and topology. We show that for uniform unit disk graphs, the number of edge-disjoint paths between nodes is equal to the average node degree with very high probability. ReInForm utilizes this property in its randomized forwarding mechanism which results in use of all possible paths and efficient load balancing.