Time-optimized contextual information forwarding in mobile sensor networks

• We study on the scheduling of Context Forwarding (CF) in Mobile Sensor Networks (MSNs).
• We formulate the CF scheduling problem as an optimal stopping time problem.
• We propose an optimal CF policy over MSN.
• The proposed policy exhibits efficient CF in MSN.

We study on the forwarding of quality contextual information in mobile sensor networks (MSNs). Mobile nodes form ad-hoc distributed processing networks that produce accessible and quality-stamped information about the surrounding environment. Due to the dynamic network topology of such networks the context quality indicators seen by the nodes vary over time. A node delays the context forwarding decision until context of better quality is attained. Moreover, nodes have limited resources, thus, they have to balance between energy conservation and quality of context. We propose a time-optimized, distributed decision making model for forwarding context in a MSN based on the theory of optimal stopping. We compare our findings with certain context forwarding schemes found in the literature and pinpoint the advantages of the proposed model.