Distributed data survivability schemes in mobile Unattended Wireless Sensor Networks

In a mobile Unattended Wireless Sensor Network (UWSN), a trusted sink visits each sensor node periodically to collect data. Data has to be secured until the next visit of the sink. Securing the data from an adversary in UWSN with mobile nodes is a challenging task.We present two non-cryptographic algorithms (DS-PADV and DS-RADV) to ensure data survivability in mobile UWSN. The DS-PADV protects against proactive adversary which compromises nodes before identifying its target. DS-RADV makes the network secure against reactive adversary which compromises nodes after identifying the target. We analyze memory overheads and communication costs both mathematically and using simulations. In existing schemes, sensors remain static between visits from the sink, whereas in our scheme sensors can move between successive visits from the sink. We show that our approaches perform better than known schemes in terms of communication overheads.