Local Optimum Algorithms for Self-Protection in Wireless Sensor Networks

Since the sensor node is important and critical in wireless sensor networks (WSNs), it is necessary to provide wireless sensor network certain level of protection. The self protection problem focuses on using the sensor nodes of the network to protect themselves rather than other objects so that the network can resist attacks. In this paper, we study both the minimum 1-self protection and minimum k-self protection problems, and propose our distributed local optimum algorithms. In addition, we give our method of finding multiple protection sets when the network is redundant, so that the protection sets can work by turns. Experimental result manifests the efficiency and feasibility of our algorithms proposed.