Analytic, simulation, and empirical evaluation of delay/fault-tolerant mobile sensor networks

The DelaylFault-Tolerant Mobile Sensor Network (DFT-MSN) has been proposed recently for pervasive information gathering. DFT-MSN distinguishes itself from conventional sensor networks by several unique characteristics such as sensor mobility, loose connectivity, and delay/fault tolerability. This paper focuses on the performance evaluation of DFT-MSN. We first introduce a queuing model by using Jackson network theory. While the queuing model is based on a few simplification assumptions for analytic tractability, it provides insights into the queuing behavior of the mobile sensors in DFT-MSN. Extensive simulations are performed under realistic environment and assumptions. Our simulation results show that the dynamic DFT-MSN data delivery scheme achieves the highest message delivery ratio with acceptable delay and transmission overhead, compared with simple schemes such as flooding and direct transmission or other approaches in the literature such as Zebranet. We, have also implemented a DFT-MSN testbed by deploying Crossbow motes for noise level monitoring in our university library. Though in a small scale, the testbed demonstrates the feasibility of DFT-MSN and provides guidance for future large scale deployment.