Local optimum algorithms for self-protection in wireless sen

SENSOR NETWORKSJIBIN CHENG, WENZHE ZHANG, JIWEN YANGSchool of Computer Science and Technology, Soochow University, Jiangsu, China, 215006E-MAIL: {20074227065021, wzzhang, jwyang}@Abstract—Since the sensor node is important and critical inWireless Sensor Networks (WSNs）, it is necessary to providewireless sensor network certain level of protection. The selfprotection problem focuses on using the sensor nodes of thenetwork to protect themselves rather than other objects so thatthe network can resist attacks. In this paper, we study both theminimum 1-self protection and minimum k-self protectionproblems, and propose our distributed local optimumalgorithms. In addition, we give our method of finding multipleprotection sets when the network is redundant, so that theprotection sets can work by turns. Experimental resultmanifests the efficiency and feasibility of our algorithmsproposed.Keywords- Self protection; active nodes; local information;multiple protection setsI.INTRODUCTIONWireless Sensor Network consists of a set of sensornodes which are deployed over interested geographical area.These sensor nodes compose a network after they get thetopology information, and also the sensor nodes get involvedwith all kinds of work such as computing, detecting,monitoring, transmitting and etc. The sensor node can losefunction because of its limited energy, and also it is toofragile to withstand physical attack. The density of sensors ofa WSN must thick enough so that the target area can betotally covered by the network. Apparently, the thicker of thesensor nodes the higher of the coverage ratio is [1].Otherwise, the coverage ratio of the network is affected bythe transmit range of the sensor node [2], that is the longer ofthe range the higher coverage ratio of the network.One of the main three applications of the Wireless Sensor