Proactive Stealthiness for Wireless Sensor Networks

Field surveillance is one of the most important applications for wireless sensor networks. Many sensors are deployed in a region of concern to detect any potential targets. On the contrary, intelligent target finds out the deployed sensors to destroy for fear of being detected and leads to defunct surveillance. Due to the importance of sensor nodes, it is necessary to hide them from the scope of target. In this paper, we introduce Proactive Stealthiness as the natural immune system covered on sensor networks. We model the stealthiness problem, and propose a distributed marking algorithm based on Breadth-First Spanning Tree. Different from previous works which only introduce self protection to wireless sensor networks, we not only maintain the connectivity of all dominating sensors but achieve the minimum hops of urgent message to gateway. This makes the method proposed more practical and sensible. Extensive simulation confirms the performance of algorithms proposed and Experimental result manifests the feasibility and efficiency.