Study On Algorithm For Identifying Compromised Nodes In Wireless Field Surveillance Networks

As the development of electronic and communications technology, field surveillance, such as farmland disaster prevention, forest fires prevention, are gradually developing to the high level automatic altitude control. Because of Wireless sensor networks'easy to deploy and comprehensive coverage, it soon becomes the main approach of field surveillance, and also has had considerable development.Currently, the Wireless Sensor Networks has become arouse wide concerned and multidisciplinary. It gathers modern communications technology, microelectronic technology, sensing technology, distributed information processing technology. It can be easily used in real-time monitoring and information gathering of various environment or object detection.The paper introduces the development of Wireless Sensor Network and its application in field surveillance, and several kinds of Wireless Sensor Network. According to the characteristics about Wireless Sensor Network in the application of field surveillance, a universal algorithm base on graph theory for identify the compromised nodes is improved. This algorithm can identify the compromised nodes in net without depending on the particular devices, so it can be used in many kinds of sensor networks.At last, the algorithm is validated and evaluated in matlab simulation environment, the effect of algorithm is showed, and influence about the algorithm in various network configuration.